Artin's conjecture on primitive roots
Artin's conjecture on primitive roots is an in numbers theory, a given integer a which is not a perfect square and not −1 is a primitive root modulo infinitely many primes p.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2567834344
- Described as
- in numbers theory, a given integer a which is not a perfect square and not −1 is a primitive root modulo infinitely many primes p
- What it is
- conjecture
- Named after
- Emil Artin
- Wikipedias with a page
- 13
Wikidata item Q2319635 (wikidata.org/wiki/Q2319635), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1385430920
In number theory, Artin's conjecture on primitive roots states that a given integer a that is neither a square number nor −1 is a primitive root modulo infinitely many primes p. The conjecture also ascribes an asymptotic density to these primes. This conjectural density equals Artin's constant or a rational multiple thereof.
The conjecture was made by Emil Artin to Helmut Hasse on September 27, 1927, according to the latter's diary. The conjecture is still unresolved as of 2026. It is proven that there cannot be more than two primes for which Artin's conjecture fails.
In October 2026, OpenAI released a catalogue of manuscripts produced by an internal model, including a paper (029) claiming an unconditional proof of the existence part of Artin's conjecture on primitive roots, establishing a density lower bound of cax/(logx)2 that is lower than the conjectured density. The result had not been reviewed by the mathematical community.
In a preprint posted on 14 October 2026, Manjul Bhargava derived a positive lower relative density among the primes for each admissible integer base, improving the lower bound to order x/logx. The argument uses OpenAI's marked Type II estimates and a zero-free result of Cureton and Thorner, and gives a lower bound rather than the exact conjectural density.
In November 2026, Vlado Vojdanovski posted a preprint claiming an unconditional extension to simultaneous primitive roots for arbitrary nonempty finite sets of integer bases excluding 0,1,−1. It states that the primes for which every base is a primitive root have positive lower relative density whenever neither of Matthews' two obstructions occurs, and form a finite set otherwise. The accompanying Lean formalization covers the simultaneous theorem, including the single-base existence assertion of Artin's conjecture, and incorporates formalizations of the OpenAI results used in the proof.
From the Wikipedia article “Artin's conjecture on primitive roots” (en.wikipedia.org/wiki/Artin's_conjecture_on_primitive_roots), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
