Small prime kth power residues for k=2,3,4: a reciprocity laws approach
From MaRDI portal
Publication:4644699
Abstract: Nagell proved that for each prime , , there is a prime that is a cubic residue modulo . Here we show that for each fixed , and each prime with , the number of prime cubic residues exceeds . 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 , there are more than prime quadratic residues .
Recommendations
Cites work
- scientific article; zbMATH DE number 5635018 (Why is no real title available?)
- scientific article; zbMATH DE number 1452559 (Why is no real title available?)
- scientific article; zbMATH DE number 3238706 (Why is no real title available?)
- A higher-dimensional sieve method. With procedures for computing sieve functions
- Bounds for the first several prime character nonresidues
- Conditional bounds for the least quadratic non-residue and related problems
- Corrigendum to \lq\lq Conditional bounds for the least quadratic non-residue and related problems\rq\rq
- Explicit bounds for primes in residue classes
- On the theory of cubic residues and nonresidues
- Supplements to the theory of quartic residues
- Sur les restes et les non-restes cubiques
- The Least Prime K -th-Power Residue
Cited in
(4)
This page was built for publication: Small prime \(k\)th power residues for \(k=2,3,4\): a reciprocity laws approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644699)