Kevin J. McGown, Jonathan P. Sorenson
Published 2022-06-28Version 1
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.
The computation of $ζ(2k)$, $β(2k+1)$ and beyond by using telescoping series
Computation of Hecke eigenvalues (mod $p$) via quaternions
Computation of a 30750-Bit Binary Field Discrete Logarithm
![QR code for arXiv:2206.14193 [math.NT]](http://oss.arxitics.com/images/favicon.svg)