The least prime primitive root and the shifted sieve
From MaRDI portal
Publication:4345833
Abstract: We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was log p to an exponent tending to infinity with p, lies in the use of the linear sieve (a particular version called the shifted sieve) rather than Brun's sieve. The same methods allow us to rederive a conditional result of Shoup on the least prime primitive root (mod p) for all prime moduli p, assuming the generalized Riemann hypothesis. We also extend both results to composite moduli q, where the analogue of a primitive root is an element of maximal multiplicative order (mod q).
Recommendations
Cited in
(13)- On Grosswald's conjecture on primitive roots
- Uniform bounds for the least almost‐prime primitive root
- scientific article; zbMATH DE number 65933 (Why is no real title available?)
- Least prime primitive roots
- Least primitive root and simultaneous power non-residues
- scientific article; zbMATH DE number 1996340 (Why is no real title available?)
- On the least prime primitive root
- On a generalization of Artin's conjecture among almost primes
- On the least primitive root in number fields
- Distinguishing eigenforms modulo a prime ideal
- Resolving Grosswald's conjecture on GRH
- On the smallest simultaneous power nonresidue modulo a prime
- Artin's conjecture on average for composite moduli
This page was built for publication: The least prime primitive root and the shifted sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345833)