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 9
The Ulam spiral, read honestly
In 1963 Stanisław Ulam, doodling in a meeting, wrote the integers in a square spiral and circled the primes. They lined up in diagonal streaks. The picture is real; what it means is more modest than it looks.
Diagonals in a square spiral are values of quadratic polynomials such as 4n² + bn + c. Some quadratics avoid small prime factors far more than others, so their diagonals are dense with primes. Euler’s n² + n + 41 is prime for n = 0 to 39 and stays unusually rich after that.
- Settled No non-constant polynomial with integer coefficients takes only prime values (Goldbach, 1752, in substance).
- Open Whether n² + 1 is prime infinitely often is one of Landau’s four problems (1912), open. The Bateman–Horn conjecture (1962) predicts how many prime values each polynomial should have, with a constant measuring how it avoids small divisors; it explains the bar lengths above but is unproved.
- Reading The streaks do not reveal a formula for primes or a hidden geometric order. They are a picture of divisibility by small primes, which is the same effect that makes gaps of 6 common on the gaps page.
Reading path · step 10 of 11