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 10
Sources
Primary papers for every theorem and conjecture on the site, and the software that computed the figures.
- Euclid. Elements, Book IX, Proposition 20 (about 300 BC).
- C. F. Gauss. Disquisitiones Arithmeticae (1801); letter to J. F. Encke, 24 December 1849.
- P. L. Chebyshev. “Mémoire sur les nombres premiers”, Journal de mathématiques pures et appliquées 17 (1852), 366–390.
- P. G. L. Dirichlet. “Beweis des Satzes, dass jede unbegrenzte arithmetische Progression … unendlich viele Primzahlen enthält”, Abh. Königl. Preuss. Akad. Wiss. (1837), 45–81.
- B. Riemann. “Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse”, Monatsberichte der Berliner Akademie (1859).
- H. von Mangoldt. “Zu Riemanns Abhandlung …”, J. reine angew. Math. 114 (1895), 255–305.
- J. Hadamard. “Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques”, Bull. Soc. Math. France 24 (1896), 199–220.
- C. de la Vallée Poussin. “Recherches analytiques sur la théorie des nombres premiers”, Ann. Soc. Sci. Bruxelles 20 (1896), 183–256.
- H. von Koch. “Sur la distribution des nombres premiers”, Acta Math. 24 (1901), 159–182.
- J. E. Littlewood. “Sur la distribution des nombres premiers”, C. R. Acad. Sci. Paris 158 (1914), 1869–1872.
- V. Brun. “La série 1/5 + 1/7 + … est convergente ou finie”, Bull. Sci. Math. 43 (1919).
- G. H. Hardy and J. E. Littlewood. “Some problems of ‘Partitio numerorum’ III”, Acta Math. 44 (1923), 1–70.
- H. Cramér. “On the order of magnitude of the difference between consecutive prime numbers”, Acta Arith. 2 (1936), 23–46.
- J. Leech. “Note on the distribution of prime numbers”, J. London Math. Soc. 32 (1957), 56–58.
- M. L. Stein, S. M. Ulam and M. B. Wells. “A visual display of some properties of the distribution of primes”, Amer. Math. Monthly 71 (1964), 516–520.
- C. Bays and R. H. Hudson. “On the fluctuations of Littlewood for primes of the form 4n ± 1”, Math. Comp. 32 (1978); and Bays–Hudson, Math. Comp. 69 (2000) on π(x) − li(x).
- M. Rubinstein and P. Sarnak. “Chebyshev’s bias”, Experimental Mathematics 3 (1994), 173–197.
- A. Granville. “Harald Cramér and the distribution of prime numbers”, Scand. Actuarial J. (1995), 12–28.
- B. Green and T. Tao. “The primes contain arbitrarily long arithmetic progressions”, Annals of Math. 167 (2008), 481–547.
- Y. Zhang. “Bounded gaps between primes”, Annals of Math. 179 (2014), 1121–1174.
- J. Maynard. “Small gaps between primes”, Annals of Math. 181 (2015), 383–413.
- D. H. J. Polymath. “Variants of the Selberg sieve, and bounded intervals containing many primes”, Research in the Mathematical Sciences 1 (2014), article 12.
- T. Oliveira e Silva, S. Herzog and S. Pardi. “Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4·1018”, Math. Comp. 83 (2014), 2033–2060.
- T. Xylouris. “On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions”, Acta Arith. 150 (2011), 65–91.
- Software. Python 3 with numpy 2.5 (sieve to 108) and mpmath (li, zetazero, quadrature), 23 October 2026 PT. Build scripts: figs.py and build.py.
Quoted, not recomputed
- Rubinstein–Sarnak densities 0.9959 and 0.9990 (conditional).
- The mod 3 first lead change 608 981 813 029 (Bays–Hudson).
- The record gap 1550 and the 264 verification.
- The bound 1.4 × 10316 for the first sign change of π(x) − li(x).
- Chebyshev’s constants 0.92129 and 1.10555 as quoted in standard texts.
Sibling site: Zeta Zeros sources.
Reading path · step 11 of 11