Prime numbers
Results about prime numbers: how they are spaced, how they divide other numbers and how they are counted.
12 AI-made results on prime numbers, from 21 papers in the OpenAI math collection, each explained in plain English. 7 have a formal Lean proof listed; 5 are claimed in a paper and not yet machine-checked. They span 2 fields, led by number theory (11) and topology (1). The oldest question here dates back to 1927: Primitive roots for every admissible integer base.
Number theory11
-
Unrestricted pro-modularity at the prime two
Every continuous odd absolutely irreducible two-dimensional 2-adic representation of unramified outside finitely many primes occurs in a completed Hecke algebra at some odd tame level. Also proves classical modularity up to Tate twist for irreducible odd representations with these finiteness conditions that are de Rham at 2 with distinct Hodge–Tate weights, resolving the dyadic Fontaine–Mazur case without residual restrictions.
Claimed, not checked -
Prime-factor statistics of
Proves that the normalized ordered logarithms of the prime factors of , counted with multiplicity, converge jointly to the Poisson–Dirichlet law as p ranges uniformly over primes up to x and . This resolves the Ford–Konyagin–Luca conjecture. It also proves that infinitely many integers n have more than totient preimages, for every ε > 0.
Claimed, not checked -
Independent largest prime factors of consecutive integers
Resolves the Erdős–Pomerance joint Dickman conjecture: the logarithmic sizes of the largest prime factors of n and are asymptotically independent in ordinary natural density. In particular, the integers satisfying have density 1/2.
Formal proof listed -
Ostmann’s inverse Goldbach conjecture
Proves that no finite modification of the primes can be written as with each containing at least two elements. This resolves Ostmann's inverse Goldbach conjecture on additive indecomposability.
Formal proof listed -
A quadratic bound for Jacobsthal’s function
Answers Jacobsthal's quadratic-bound question: every interval of consecutive integers contains an integer coprime to any prescribed positive integer with at most k distinct prime divisors, for an absolute constant C. The bound is uniform over prime sets and interval positions and removes the classical logarithmic loss.
Formal proof listed -
The weak inhomogeneous Duffin–Schaeffer conjecture
Proves that for every real shift γ and finite-valued , divergence of implies for infinitely many q, for almost every x. Here ϕ is Euler's totient and the norm is distance to the nearest integer. Numerators are unrestricted; no monotonicity or Diophantine condition on γ is needed.
Claimed, not checked -
Patterson's first moment for cubic Gauss sums
Proves unconditionally the all-primary-prime form of Patterson’s first-moment asymptotic: normalized cubic Gauss sums over primary Eisenstein primes of norm at most X, including both conjugates, have an explicit positive main term of order . Every fixed nonzero prime-angle Fourier mode has smaller order.
Formal proof listed -
An asymptotic formula for the number of totients
Gives an asymptotic equivalent for the number of distinct totient values up to x, with a positive bounded phase-dependent factor determined by convergent arithmetic approximations. In particular, for every fixed c > 0, answering Erdős and Hall’s scaling question.
Formal proof listed -
Positive lower density of large prime gaps
For every fixed C > 0, a positive proportion of consecutive prime gaps exceed , throughout every sufficiently large initial segment of the primes. The proportion may depend on C. Consequently, the indices where increases have positive lower density, answering Erdős and Prachar.
Formal proof listed -
Uniformly bounded components of Gaussian-prime graphs
Proves the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have uniformly bounded steps. More strongly, for every distance bound D, the graph joining Gaussian primes at distance at most D has uniformly bounded finite component sizes, depending only on D, including primes on the coordinate axes.
Formal proof listed -
Primitive roots for every admissible integer base
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 primes in every sufficiently large interval have primitive root a, with .
Claimed, not checked
Topology1
-
Chromatic splitting: filtrations and counterexamples
Disproves strong chromatic splitting at height three for primes p ≥ 5, and weak splitting for the derived p-completed sphere at heights p (p ≥ 5) and (p ≥ 7). Nevertheless, for n ≥ 1 and , the overlap admits a -stage filtration by the predicted localized-sphere pieces. At height three and prime three, even finite assembly from such pieces fails in the category of -local modules over the derived completed sphere.
Claimed, not checked