Artin's primitive root conjecture

At least 13 years old · documented by

Let aa be an integer that is not a square number and not −1-1. A prime pp is aa-rooted if aa generates the multiplicative group (Z/pZ)∗(\mathbb{Z}/p\mathbb{Z})^*, equivalently if

{ai mod p∣i∈Z}={1,…,p−1}.\{a^i \bmod p \mid i\in\mathbb{Z}\}=\{1,\ldots,p-1\}.

Artin's primitive root conjecture. The set of aa-rooted primes is infinite.

This is a famous conjecture concerning primitive roots modulo primes. It remains open in general, although important conditional and partial results are known.

References

Primary source

Gabriele Fici, Estéban Gabory, Giuseppe Romana and Marinella Sciortino, “Unclustered BWTs of any Length over Non-Binary Alphabets”, arXiv:2508.20879 (2025).

Additional references

15 papers in this index state this conjecture (2012–2025). The statement above is taken from the most recent of them; the others are arXiv:2507.13548, arXiv:2502.12844, arXiv:2410.09694, arXiv:2402.03280, arXiv:2312.11258, arXiv:2107.12121, arXiv:2107.12123, arXiv:2006.15683, arXiv:1906.07446, arXiv:1809.09811, arXiv:1408.0602, arXiv:1404.4007, and 2 more.

Progress summary

Refreshed
Claimed progress

The conjecture remains open, although an undated preprint claims a complete proof that has not been independently verified.

Artin conjectured in 1927 that every admissible integer is a primitive root modulo infinitely many primes.

Known results

  • Hooley, 1967: proved the conjecture conditionally under the relevant Generalized Riemann Hypothesis.
  • Gupta–Murty, 1984: proved it for infinitely many integers, without an explicit infinite list.
  • Heath-Brown, 1986: showed that at most two prime values and at most three squarefree values can be exceptions; in particular, one of 22, 33, or 55 works.
  • No particular admissible integer is known unconditionally to work.

2026 claimed proof and new bounds

An undated version-1414 preprint claims an unconditional positive-density asymptotic for every admissible integer, which would settle the conjecture, but supplies no independent verification or referee assessment. On August 25, 2026, a new paper by M. Ram Murty and Sunil Naik was announced on a non-abelian large sieve and Artin’s conjecture; the retrieved record gives no theorem details. A 2026 journal article by Chi Wa Chan reports uniform density bounds in quadratic number fields, but its precise advance cannot be assessed from the available record.

Current status (as of August 2026): Artin’s conjecture remains open unconditionally; Hooley’s conditional theorem and the classical partial results stand, while the claimed complete proof is unverified.

Sources

Solutions 2

RemarkAI-assistedClaimed by OpenAI. For every integer base a that is neither a square nor -1, the manuscript claims infinitely many primes for which a is a primitive root, with a lower bound of order x/(log x)^2 in sufficiently large dyadic intervals. It does not claim the conjectured density formula.See full solutionHide full solution

Claimed by OpenAI. For every integer base a that is neither a square nor -1, the manuscript claims infinitely many primes for which a is a primitive root, with a lower bound of order x/(log x)^2 in sufficiently large dyadic intervals. It does not claim the conjectured density formula.

GitHub repository: https://github.com/openai/math

Manuscript: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/primitive-roots-all-integer-bases.pdf

  • OpenAI-029-01-Primitive-roots-for-every-admissible-integer-base.pdf891,737 bytesOpen
RemarkAI-assistedClaimed by OpenAI. Assuming Inputs 3.1, 4.1, 5.1 and 5.2 from the companion work, the manuscript claims simultaneous primitive roots for any fixed finite set of distinct positive prime bases, with at least c x/(log x)^2 such primes in every sufficiently large dyadic interval. This is conditional progress for prime bases.See full solutionHide full solution

Claimed by OpenAI. Assuming Inputs 3.1, 4.1, 5.1 and 5.2 from the companion work, the manuscript claims simultaneous primitive roots for any fixed finite set of distinct positive prime bases, with at least c x/(log x)^2 such primes in every sufficiently large dyadic interval. This is conditional progress for prime bases.

GitHub repository: https://github.com/openai/math

Manuscript: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Simultaneous-primitive-roots-a-conditional-lower-bound-for-prime-bases-October-4-2026/simultaneous-primitive-roots-conditional-lower-bound-prime-bases.pdf

  • OpenAI-029-02-Simultaneous-primitive-roots-a-conditional-lower-bound-for-prime-bases.pdf450,863 bytesOpen