Departure question
Find order without counting everythingPort 9 of 16Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
"The number of primes up to N is roughly N / ln N." Proved independently in 1896 by Hadamard and de la Vallée-Poussin via complex analysis. Primes look irregular locally yet obey a striking average distribution. The Riemann Hypothesis would give a far sharper, near square-root-scale error bound; it would not list individual primes.
Compare exact π(N), Gauss’s first guess x/ln(x), and the refined Li(x). The Prime Number Theorem describes their large-scale asymptotic relationship, not monotonic improvement at every N. Try values up to 5,000,000.
The prime-counting function π(x) is asymptotic to x/ln(x). Gauss recalled an early table-based observation in an 1849 letter; Hadamard and de la Vallée Poussin proved the theorem independently in 1896.
Ports in time
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
Gauss recalled that in his early years he had read prime tables as suggesting average density 1/ln(x), with Li(x) as a better approximation. The retrospective account does not establish one exact age-fifteen discovery date.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearIn a short Berlin Academy paper, Riemann connected fluctuations in prime counting with zeros of the zeta function. The resulting hypothesis would sharpen the error term, but is not required for the prime number theorem.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearThe two mathematicians independently proved the prime number theorem, joining number theory with complex analysis.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearTheir work showed that the theorem could be proved without complex analysis. “Elementary” describes the tools rather than the difficulty; the episode also involved a dispute over priority and attribution.
No reliable place is given, so time continues without an invented pin
Continue through the world of this yearAnalysis of how often algorithms should encounter large prime candidates, distribution theory, and the benchmark behind sharper questions such as the Riemann hypothesis. It does not by itself guarantee cryptographic security.
Curated sources and problems. Bring one discovery back from OEIS, Project Euler, MathOverflow, or arXiv.
No concept belongs to one person
These are not inventor credits. They are different ports: opening a problem, sharpening a language, or carrying it into another world.
Number lenses
These numbers are editorial lenses for the voyage, not required prerequisites.
Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
Open the number voyage
Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
Open the number voyage
Trace recurring structure through exploding possibilities, divisibility, and the apparent irregularity of primes.
Open the number voyage
Concept genealogy
Concepts arriving from before
Current port
Prime Number Theorem
Concepts opened from here
No direct successor port is curated yet.
Only direct editorial links are shown; this is not a complete learning order or historical influence line.
