Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Openai 2026 primitive roots admissible integer base
theorem_1_1: The claimed infinitude part of Artin's conjecture for every integer base other than -1 and the squares, with a lower bound of order x/(log x)^2 in each large dyadic interval; reduced to a sieve construction of primes with controlled predecessors and a uniform complete-splitting bound. Unverified.
theorem_1_2: The claimed analytic input: a zero-free strip of common width 10^{-6} for every finite-order Hecke L-function of every cyclotomic field containing the twelfth roots of unity, proved by comparing a reflected second moment of cubic theta coefficients with a Poisson evaluation. Unverified.
OpenAI, Primitive roots for every admissible integer base, OpenAI Math Release
preprint, October 4, 2026. Released under the Apache License 2.0 at
https://github.com/openai/math (revision adc7f1241), folder
preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026;
the held PDF, primitive-roots-all-integer-bases.pdf in the release, is
retained as
openai_2026_primitive_roots_admissible_integer_base.pdf,
and the release's TeX bundle sits in the same release folder.
@misc{OAI:Primitive-roots-for-every-admissible-integer-base-October-4-2026,
author = {{OpenAI}},
title = {{Primitive roots for every admissible integer base}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/primitive-roots-all-integer-bases.pdf}{OAI:Primitive-roots-for-every-admissible-integer-base-October-4-2026}},
year = {2026}
}Attestation as the release states it. The release's root README says the collection holds manuscripts "produced by an internal OpenAI model", that it "includes results at different stages of verification", that not all of them have Lean formalizations, and that "Some of the unformalized results could have issues". The manuscript's own README carries only the title, the author line "OpenAI", the date October 4, 2026 and the citation block above, and adds no sentence about human assistance or verification. The manuscript itself names no author beyond "OpenAI" and carries no statement on how it was produced. These are the source's historical attestations, not this corpus's review. No refereed publication, no arXiv version and no independent review of the manuscript is recorded here and nothing on this card is independently reviewed.
The release's Lean catalog (lean/formalization.yaml) lists no
formalization for this manuscript and has no page for its family.
Companions. The release groups this manuscript with Simultaneous primitive roots: a conditional lower bound for prime bases (same date), whose abstract claims that every fixed finite set of distinct positive primes is a set of simultaneous primitive roots for at least primes in , conditionally on four stated analytic and sieve inputs taken from this manuscript; that companion is not held in this library. Three other release manuscripts enter as cited inputs and are held here: the marked Type II estimate is imported from the Poisson--Dirichlet law for prime predecessors (its Theorem 3.1), two elementary sieve lemmas are adapted with proofs from Weighted dilation graphs, smooth shifted primes and totient fibers (its Lemmas 2.9 and 7.4), and the analytic argument follows the reflection and additive-probe method of The Quasi-Riemann Hypothesis (its Part I, Sections 5--7) without importing its theorem. A fourth, Prime predecessors with an even number of prime factors, is cited in Section 10 for its Proposition 2.1 and Lemmas 3.1 and 3.3 and is not held here.
Read status: claims checked for Theorem 1.1, Theorem 1.2, Proposition 2.1,
Proposition 2.2 and Lemmas 2.3--2.4, read clause by clause in the TeX source
(sections/01-introduction.tex lines 17--45 and
sections/01a-reduction.tex lines 18--38, 50--63, 69--76 and 104--113 of
the TeX bundle; PDF pp. 2--6) on 2026-10-07; the proof of Theorem 1.1
(01a-reduction.tex lines 150--201, PDF p. 7) and Sections 3--12 and
Appendix A were read for their structure only and no step was checked;
nothing here is independently reviewed.
Contents
The PDF has 92 pages; section numbers below are the printed ones, and the TeX bundle's section files are named in order.
- Section 1, Introduction (pp. 2--5;
01-introduction.tex). Defines the multiplicative order , a primitive root, and calls an integer admissible when and is not a square (the two necessary conditions). States Theorem 1.1: for every admissible there are and such that for all real at least primes , , have ; the predicted scale is and the constants may depend on . States Theorem 1.2: for every cyclotomic field and every finite-order Hecke character of , has no zero in , the principal character included with its pole allowed; the width is common to all such and , while the constants in the proof may depend on them. Section 1.1 recalls Hooley's conditional proof of Artin's asymptotic under the Riemann hypothesis for the Kummer fields , the unconditional results of Gupta--Murty (one of thirteen bases) and Heath-Brown (at most two prime bases fail, so one of works), the average results of Goldfeld, Stephens and Klurman--Shparlinski--Teräväinen, and the Thorner--Zaman simultaneous zero-free region with its possible exceptional zero. Sections 1.2--1.3 outline the two parts of the proof; Section 1.4 gives the plan and notation (). - Section 2, Reduction to controlled predecessors and complete splitting
(pp. 5--8;
01a-reduction.tex). The index ; Hooley's index-divisor reduction. Proposition 2.1 (primes with controlled predecessors): for fixed , and with , and , there are primes with and , prime, every prime factor of in . Proposition 2.2 (uniform bound for complete splitting): for fixed , , all large and all primes large in terms of with , the number of primes splitting completely in is , with constant and threshold independent of (for every , with absolute constants). Lemma 2.3 (splitting test, proved in the manuscript): for , splits completely in iff and . Lemma 2.4 (proved in the manuscript): for admissible and there are meeting Proposition 2.1's conditions with for every prime (quadratic reciprocity and a seven-entry table for the squarefree kernels ). Proof of Theorem 1.1 (p. 7), summarized on the result page. Remark 2.5 on negative squares and odd perfect powers; the case can use . - Section 3, S-integers, residue symbols, and Gauss sums (pp. 8--15;
02-arithmetic.tex). For a fixed cyclotomic and a finite set of places (enlarged so that the ring of -integers is principal and to include two excluded sets fixed later), chooses generators with fixed power classes, for which sextic reciprocity holds without a supplementary factor (Lemma 3.2), and identifies the two Hecke characters giving the cubic and sextic Gauss-sum phases (Lemmas 3.3--3.4). Inputs: Neukirch, Weil, Hoshi--Kanai (Davenport--Hasse). - Section 4, The coefficient family and analytic comparison (pp. 15--18;
02a-coefficient-family.tex). Defines the Gaussian profile , the coefficient sums over with squarefree, the scales , , , and the row sets . States Proposition 4.1 (reflected second moment): over rows with powerful part of norm about and squarefree part about , hence total mass . Then explains in prose how the comparison of a probe scalar (upper bound from Proposition 4.1; evaluation from Poisson summation) gives and so excludes zeros of in . This is the outline the result page for Theorem 1.2 follows. - Section 5, The normalized cubic theta input (pp. 18--27;
03-theta.tex). Proposition 5.1: a threefold central cover of over (the Kazhdan--Patterson cover modulo scalars) and a genuine automorphic representation with one-dimensional local Whittaker spaces, with its exact lifts, exterior local values and complex local behavior; Corollary 5.2 identifies the exterior coefficient of . Lemmas on a finite torus cutoff, norm-sheet profiles and exact Gaussian smoothing. Appendix A supplies the normalization. - Section 6, Reflection and the quadratic large sieve (pp. 27--41;
04-reflection.tex). Proves Proposition 4.1: as a theta average, the rational Weyl element, a local Weyl calculation, the full reflected expansion, and the quadratic large sieve for the exterior symbols (Lemma 6.4, verified from Goldmakher--Louvel's Theorem 1.1 and Heath-Brown's real-character mean value). The sextic exponents and sum to , making the pairing quadratic. - Section 7, The Poisson probe and its Euler product (pp. 41--51;
05-poisson.tex). Weights , a separated additive large sieve (Lemma 7.1), the probe bound (Section 7.1), Poisson summation in three Mellin variables (Section 7.2), and the Euler factorization of the frequency series with a correction holomorphic in two explicit numerical regions and bounded by ; is bounded and nowhere zero once contains all primes of norm below a fixed constant (Section 7.3). - Section 8, Zero detection and Mellin continuation (pp. 51--60;
06-zero-free.tex). Lemma 8.1, a primitive conductor large sieve over ; a zero-density proposition (Proposition 8.2, p. 53) putting rows in an exceptional set and bounding reciprocals of the remaining -functions in ; the principal row and the other frequency rows (Section 8.2); completion (Section 8.3), with Table 1 (p. 59) listing the seven numerical exponent margins relative to (the one nearest zero, , from the reflection bound), the bound , the Mellin transform holomorphic for , its identification with by Fourier inversion and the identity theorem, and the conclusion of Theorem 1.2 (the half-plane the manuscript claims contains ). - Section 9, A uniform estimate for complete splitting (pp. 60--63;
07-splitting.tex). Lemma 9.1: for large , , , and has no zero in , , by placing under , factoring into Hecke -functions of covered by Theorem 1.2, and descending (Neukirch, Chapter VII). Lemma 9.2: a smooth explicit formula for any number field whose zeta function is zero-free in , with the Tate functional equation and the Hasanalizade--Shen--Wong zero count. Proof of Proposition 2.2 (p. 63). - Section 10, Marked Type II estimates and rough factors (pp. 63--70;
08-type-ii.tex). , prime groups with , the marked weight . Theorem 10.1 (one-sided marked Type II estimate) is stated as imported from the Poisson--Dirichlet release manuscript's Theorem 3.1, without proof here. Lemma 10.2 (coefficient criterion) is, in the manuscript's words, extracted from the proof of that cited theorem: it depends on the structure of the cited argument, not only on its statement. Proposition 10.3 verifies the criterion for the rough-factor coefficient . - Section 11, Two elementary sieve facts (pp. 70--74;
11-sieve.tex). Lemma 11.1, a Brun--Hooley block sieve with bounded coefficients (Ford--Halberstam product inequalities); Lemma 11.2, Buchstab's rough-number density identity and the bound for small , with allowed. Both adapted, with proofs, from the weighted-dilation release manuscript. - Section 12, Primes with a controlled predecessor in a fixed progression
(pp. 74--84;
12-construction.tex). Proves Proposition 2.1: weights with detecting ; a Type II estimate in the progression (Lemma 12.1, from Lemma 10.2 and Proposition 10.3 after expanding the congruence in Dirichlet characters); the harmonic mass (Lemma 12.2); distribution of the weighted family and by Bombieri--Vinogradov (Lemma 12.3); mass conditioned on a divisor (Lemma 12.4); removal of composites by their least prime factor; an upper bound for pairs of nearly equal prime factors (Lemma 12.5, constant independent of ); and the parameter choice , , small, then large and , closing with prime mass at least . - Appendix A, The cubic theta normalization (pp. 84--90;
10-whittaker-calculation.tex). The Kazhdan--Patterson cover with , the central datum, the normalized global Whittaker expansion, the spherical induced vector, the shells of the Jacquet integral and the unit normalization behind Proposition 5.1; cites Kazhdan--Patterson 1984 with its 1985 corrections and Kubota. - References (pp. 91--92;
references.tex): 30 entries, including four release manuscripts (the Poisson--Dirichlet law, the weighted dilation graphs, prime predecessors with an even number of prime factors, and the Quasi-Riemann Hypothesis).
Flags. The manuscript marks nothing as conditional, numerical or
computer-assisted; its analytic conclusion rests on the hand-tabulated
exponent margins of Table 1, and its sieve conclusion on the imported
Theorem 10.1 and on a criterion extracted from that theorem's proof in
another unreviewed release manuscript. The release folder holds no
verification/ directory for this manuscript.
Bears on
- Problem 985: background. The question asks whether every prime has a prime primitive root . Theorem 1.1 with claims at least primes with the prime as a primitive root, so infinitely many would have a prime primitive root below ; it says nothing about the "every " quantifier, and Heath-Brown's 1986 theorem, cited on the page, already gives infinitely many such with one of . The claim is unverified here, and the page's status rests on its own acceptance evidence.
- Problem 429: comparison with an input the page records as cited and not held. Weisenberg's Theorem 1, the page's status-defining source, fixes a positive integer that is a primitive root modulo infinitely many primes and cites Gupta--Murty and Heath-Brown for its existence. Theorem 1.1 would, if accepted, name every positive admissible base (every integer that is not a square, for instance ) as such an integer, with a count; the disproof does not depend on it, since the cited classical results already supply existence and the paper's second construction avoids the input. The claim is unverified here, and the page's status rests on the refereed source it names.