arXiv · 2206.14193
Computation of the least primitive root
Abstract
Let $g(p)$ denote the least primitive root modulo $p$, and $h(p)$ the least primitive root modulo $p^2$. We computed $g(p)$ and $h(p)$ for all primes $p\le 10^{16}$. Here we present the results of that computation and prove three theorems as a consequence. In particular, we show that $g(p) 3$ and that $h(p)<p^{2/3}$ for all primes $p$.
Explore related subjects
Keep this discovery
Kevin J. McGown, Jonathan P. Sorenson. 2022-06-28. Computation of the least primitive root. https://doi.org/10.1090/mcom%2F4003
Cite the original work for its findings. Save a collection to share your selection of sources.