NarrowHighway

A card from a free library — ask anything, no account, works offline. Every card carries its source.

The Riemann chain - from Euler's product and Legendre's count to the critical line

floor

Two trees. The analytic: Euler's product over the primes (1737), Dirichlet's L-functions (1837). The arithmetic: Legendre's guess at the prime count (1798), Gauss's logarithmic integral (counted 1792, written 1849), Chebyshev's bounds (1852). They become one in Riemann's eight pages of 1859: zeta on the whole plane, the explicit formula, the hypothesis. Then the prime number theorem (Hadamard, de la Vallée Poussin, 1896), the zero count (von Mangoldt 1905), zeros on the line - infinitely many (Hardy 1914), a positive proportion (Selberg 1942), a third (Levinson 1974), two fifths (Conrey 1989) - and the computations: Turing's method (1953), Odlyzko's tables (1987), Platt and Trudgian to 3·10^12 (2021). The open end stands on the last links.

source
Narrow Highway - a chain on the one map (operator seed) · docs/MILLENNIUM_PREPAREDNESS.md
card id
card_floor_riemann
address
WIT.codex.EXP/the-riemann-chain-from-euler-s-product-and-legen/REF.WITNESSED@narrow-highway-a-chain-o

related in the keeping ↗ · raw JSON ↗

adjoining cards

Is this card incomplete? Tell the library — it will call out for more ↗