Prime Predecessors: Inside OpenAI’s Proof of Even Prime-Factor Parity

Prime predecessors cover with two ceramic tiles for the factors of 6 beside an ivory tile for the prime 7.

The primes 7 and 31 both leave squarefree numbers behind them. Yet 6 has two prime factors and 30 has three. Do prime predecessors like 6 keep turning up, with an even number of prime factors and no repeats? OpenAI’s September 17, 2026 preprint proves that infinitely many do. Its Theorem 1.1 says that there … Read more

p-Adic Galois Representations: How OpenAI Proves Pro-Modularity Without de Rham Conditions

A glass fan and red marker illustrate how one point informs the proof for p-adic Galois representations.

Why should a Galois representation have modular Hecke eigenvalues if it has no prescribed algebraic weight? For p-adic Galois representations at the prime two, OpenAI’s October 6, 2026 manuscript answers this through the completed Hecke algebra. Every continuous, odd, absolutely irreducible two-dimensional representation over a finite extension of the 2-adic numbers, unramified outside finitely many … Read more

Number of Totients: How OpenAI’s Proof Counts Euler’s Distinct Outputs

Number of totients artwork shows separate ribbons converging into one output, with the full article title.

Euler’s totient function sends both 8 and 12 to 4. Computing either output is easy. Counting every distinct output, without counting 4 twice, leads to a question that has resisted precise asymptotics for decades. OpenAI’s September 25, 2026 manuscript gives an asymptotic formula for the number of totients, together with the Erdős–Hall scaling result: multiplying … Read more

Erdős–Pomerance Conjecture: How OpenAI Proved the 50–50 Prime-Factor Law

Erdős–Pomerance conjecture illustrated by adjacent jade and vermilion prime-factor sculptures.

Two neighbors can share no prime factors and still conceal a statistical dependence. The Erdős–Pomerance conjecture asks whether the relative sizes of their largest prime factors eventually behave independently. OpenAI’s September 24, 2026 preprint, The joint Dickman law for consecutive integers, proves the predicted product law in ordinary natural density. Its striking consequence: each neighbor … Read more

Large Prime Gaps: OpenAI Proof Solves a Longstanding Frequency Puzzle

Large prime gaps represented by recurring chasms in a sculptural ribbon, with the full article title.

A prime desert is easy to admire and surprisingly difficult to count. One enormous gap can contain thousands of empty intervals, making rare events look common. OpenAI’s September 25, 2026 manuscript, Positive Lower Density of Large Prime Gaps, presents a proof that large prime gaps occur with positive lower density: for every fixed positive multiplier, … Read more

Elliptic Curve Modularity: How OpenAI’s Proof Cracked the Imaginary Quadratic Barrier

Elliptic curve modularity visualized as a sculpted torus passing through three coloured geometric facets.

Counting an elliptic curve’s points modulo primes produces an arithmetic fingerprint. Modularity says that an entirely different object, an automorphic representation, reproduces that fingerprint and its deeper local structure. OpenAI’s October 4, 2026 manuscript claims elliptic curve modularity for every elliptic curve over every imaginary quadratic field, removing restrictions that earlier results still required. The … Read more