Least prime primitive roots

zbMATH Open1396.11003arXiv1709.01172MaRDI QIDQ2960897FDOQ2960897

Authors: Nelson A. Carella 

Publication date: 17 February 2017

Abstract: This note presents an upper bound for the least prime primitive roots $g^{\ast }(p)$ modulo $p$, a large prime. The current literature has several estimates of the least prime primitive root $g^{\ast }(p)$ modulo a prime $pgeq2$ such as $g^{\ast }(p)ll{p}^c,c>2.8$. The estimate provided within seems to sharpen this estimate to the smaller estimate $g^{\ast }(p)ll{p}^{5/loglogp}$ uniformly for all large primes $pgeq2$.

Full work available at URL: https://arxiv.org/abs/1709.01172

Recommendations

• On the least prime primitive root
• The least primitive root modulo \(p^2\)
• On the magnitude of the least prime primitive root
• Explicit upper bounds on the least primitive root
• The least prime primitive root and the shifted sieve

zbMATH Keywords

prime numberprimitive rootcyclic groupleast primitive rootprime primitive root

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Number-theoretic algorithms; complexity (11Y16)

Cited In (7)

• Densities of primes and primitive roots
• Least primitive root and simultaneous power non-residues
• On the least prime primitive root
• On the least primitive root in number fields
• Explicit upper bounds on the least primitive root
• The least primitive root modulo \(p^2\)
• On the least primitive root of a prime

This page was built for publication: Least prime primitive roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960897)