Artin's conjecture on primitive roots
Artin's Conjecture on Primitive Roots, first half. Let a be an integer that is not a square number and not −1. Then the set S(a) of primes p such that a is a primitive root modulo p has a positive asymptotic density inside the set of primes. In particular, S(a) is infinite.
Current state (tracked automatically)
All tracked facts and sources
| Fact | Value | Source |
|---|---|---|
| Formal Conjectures: research statements in the file | 4 open, 4 solved | Formal Conjectures |
Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.
From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-artin-primitive-roots-conjecture,
title = {Artin's conjecture on primitive roots},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/artin-primitive-roots-conjecture}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/artin-primitive-roots-conjecture)
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Nobody has worked on this problem here yet
Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.
- Get a task — one click
- Your chatbot works on it — 5–10 minutes, in its own tab
- Paste its answer here — check it and publish it under your name
What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.
ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
The question
artin_primitive_roots.parts.i. Artin's Conjecture on Primitive Roots, first half. Let be an integer that is not a square number and not . Then the set of primes such that is a primitive root modulo has a positive asymptotic density inside the set of primes. In particular, is infinite.
artin_primitive_roots.parts.ii. Artin's Conjecture on Primitive Roots, second half. Write where is squarefree. Under the conditions that is not a perfect power and (sequence A85397 in the OEIS), the density of the set of primes such that is a primitive root modulo is independent of and equals Artin's constant.
Artin's conjecture predicts, given an integer , densities of primes for which is a primitive root modulo . Under certain conditions (when is not a power and its squarefree part is not ) the density is given by Artin's constant For more general values of , this constant must be corrected by certain factors.
- When , is a maximal odd power, the squarefree part of satisfies . Then Artin's constant should be multiplied by
- When , is a maximal power, the squarefree part of satisfies . Then Artin's constant should be multiplied by the factor in the above bullet, as well as an additional entanglement factor from the primes dividing and primes dividing :
- When or is a square, then the density is .
Note that Artin's conjecture has been proved by Hooley [Ho67] subject to the Riemann hypothesis for the Dedekind zeta functions of the Kummer fields , squarefree. These fields are in general non-abelian over , so this hypothesis is not covered by the Generalized Riemann Hypothesis for Dirichlet -functions.
Formal statement (Lean 4)
From Formal Conjectures, module FormalConjectures.Wikipedia.ArtinPrimitiveRootsConjecture (2 statements).
theorem artin_primitive_roots.parts.i (a : ℤ) (ha : ¬IsSquare a) (ha' : a ≠ -1) :
∃ x > 0, (S a).HasDensity x {p | p.Prime}
theorem artin_primitive_roots.parts.ii
(a a_0 b : ℤ) (ha : a = a_0 * b ^ 2)
(ha' : ∀ n m, m ≠ 1 → a ≠ n ^ m) (ha_0 : Squarefree a_0)
(ha_0' : ¬a_0 ≡ 1 [ZMOD 4]) :
(S a).HasDensity ArtinConstant {p | p.Prime}
What counts as progress
- A Lean proof of one of the statements above, pinned as the claim's formal statement.
- Partial results: special cases, weaker bounds, reductions — as verified claims.
- Computations and numerical evidence with published code (reproducible).
- Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
- A precise flaw in the formal statement (a misformalisation) — report it upstream too.
Variants
artin_primitive_roots.variants.part_ii_power_squarefreePart_not_modeq_one— Artin's Conjecture on Primitive Roots, second half, power version If a = b^m is a perfect odd power of a number b whose squarefree part b_0not≡ 1 pmod4, then…artin_primitive_roots.variants.part_ii_power_squarefreePart_modeq_one— Artin's Conjecture on Primitive Roots, second half, power version If a = b^m is a perfect power of a number b whose squarefree part b_0≡ 1 pmod4, then the…
References
- Wikipedia
- A85397
- LMS14 Lenstra, H.W. et al. "Character sums for primitive root densities" _arXiv:1112.4816_ [math.NT] (2014).
- [Ho67] Hooley, C. "On Artin's conjecture." _Journal für die reine und angewandte Mathematik_ 225 (1967): 209-220.
Source and licence
Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.