
arXiv: 1711.01706
Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $ε> 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(ε)$, the number of prime cubic residues $q < p^{1/2+ε}$ exceeds $p^{ε/30}$. Our argument, like Nagell's, is rooted in the law of cubic reciprocity; somewhat surprisingly, character sum estimates play no role. We use the same method to establish related results about prime quadratic and biquadratic residues. For example, for all large primes $p$, there are more than $p^{1/9}$ prime quadratic residues $q
7 pages
reciprocity law, Mathematics - Number Theory, 1A15 (primary), 11N36 (secondary), power residues, Power residues, reciprocity, FOS: Mathematics, Applications of sieve methods, Number Theory (math.NT)
reciprocity law, Mathematics - Number Theory, 1A15 (primary), 11N36 (secondary), power residues, Power residues, reciprocity, FOS: Mathematics, Applications of sieve methods, Number Theory (math.NT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
