Working notes on the primes
Grant Golland’s working notes on how the prime numbers are spread out. Every figure is computed here from a sieve of all 5 761 455 primes below 100 000 000, or with mpmath, and its caption says how. A sibling site, Zeta Zeros, covers the zeros that control these patterns.
Sentences carry a flag: Settled for proved theorems or computations on a stated range, Open for conjectures. A numerical match is never a proof.
Step 7
Twin primes and the Hardy–Littlewood conjectures
Twin primes are pairs like 11 and 13, two apart. Nobody can prove there are infinitely many. Hardy and Littlewood did something bolder: they predicted how many there should be, and the prediction keeps matching.
- Open The twin prime conjecture: infinitely many twin pairs. Open.
- Open Hardy and Littlewood (Acta Mathematica, 1923), conjecture B: the count up to x is asymptotic to 2C₂∫dt/(log t)². The match above, to about 0.01 percent at 108, is evidence, not proof.
- Settled Brun (1919): the sum of 1/p over twin primes converges, so twins are rare compared with primes.
Other gaps h
The same conjecture covers any even difference h. It predicts each count is the twin count times ∏ (p − 1)/(p − 2) over odd primes p dividing h. So pairs 6 apart should be twice as common as twins, and pairs 30 apart (30 = 2·3·5) about 2.67 times.
- Open The general Hardy–Littlewood k-tuple conjecture predicts the count of any admissible pattern, such as prime triples p, p + 2, p + 6. Not one case with two or more primes is proved.
Reading path · step 8 of 11