If p is a prime number, then a primitive root modulo p is an integer a such that (a mod p) generates multiplicatively the group of non-zero residues modulo p. For finding a primitive root modulo p, one can try out candidates. Our aim is to discuss which candidates to try first, heuristically, according to Artin’s conjecture on primitive roots.

primitive root, Artin’s conjecture.

Received: April 3, 2024; Accepted: June 4, 2024; Published: July 30, 2024

How to cite this article: Antonella Perucca and Mia Tholl, Computing primitive roots according to Artin’s conjecture, JP Journal of Algebra, Number Theory and Applications 63(5) (2024), 435-445. https://doi.org/10.17654/0972555524026

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] S. Lang, Algebra, Graduate Texts in Mathematics 211, Springer, New York, 2011.
[2] P. Moree, Artin’s primitive root conjecture – a survey, Integers 12(6) (2012), 1305-1416.
[3] A. Schinzel, Abelian binomials, power residues and exponential congurences, Acta Arith. 32(3) (1977), 245-274.