Number theory · Oct 6, 2026

Artin primitive-root infinitude

Proves the infinitude assertion in Artin's primitive root conjecture for every integer a that is neither −1 nor a square. For each such base, at least cax/(log⁡x)2c_a x/(\log x)^2 primes in every sufficiently large interval (x,2x)(x,2x) have primitive root a, with ca>0c_a\gt 0.

Scope and what remains

The full quantitative density version is a stronger statement; do not infer it from infinitude.

Contributors

OpenAI source publisher and an unnamed unreleased internal model. Exact paper-level human roles are not disclosed by the family summary.

AI systems: Unreleased OpenAI model

Sources