English

On power residues modulo a prime

Number Theory 2019-09-04 v2

Abstract

Let pp be a sufficiently large prime number, nn be a positive odd integer with np1n|\,p-1 and n>pεn>p^\varepsilon , where ε\varepsilon is a sufficiently small constant. Let k(p,n)k(p,\,n) denote the least positive integer kk such that for x=k,,1,1,2,,kx=-k,\,\dots,\,-1,\,1,\,2,\,\dots,\,k, the numbers xn(modp)x^n\pmod p yield all the non-zero nn-th power residues modulo pp. In this paper, we shall prove k(p,n)=O(p1δ), k(p,\,n)=O(p^{1-\delta}), which improves a result of S. Chowla and H. London in the case of large nn.

Keywords

Cite

@article{arxiv.1908.10536,
  title  = {On power residues modulo a prime},
  author = {Ke Gong and Chaohua Jia},
  journal= {arXiv preprint arXiv:1908.10536},
  year   = {2019}
}

Comments

Not for publication in journal

R2 v1 2026-06-23T10:58:38.788Z