Computation of the least primitive root

Kevin J McGown, Jonathan P Sorenson

Research output: Contribution to journalArticlepeer-review

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 ≤10 16 . Here we present the results of that computation and prove three theorems as a consequence.
Original languageAmerican English
JournalMathematics of Computation
DOIs
StatePublished - Jul 24 2024

Disciplines

  • Number Theory

Cite this