Papers
Topics
Authors
Recent
Search
2000 character limit reached

Small prime $k$th power residues for $k=2,3,4$: A reciprocity laws approach

Published 6 Nov 2017 in math.NT | (1711.01706v1)

Abstract: 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 $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$, the number of prime cubic residues $q < p{1/2+\epsilon}$ exceeds $p{\epsilon/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<p$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.