Prime Number Theorem

The Prime Number Theorem describes the asymptotic distribution of prime numbers: the number of primes less than or equal to a given number x is approximately x / ln(x). More precisely, if π(x) denotes the prime-counting function, then the theorem states that π(x) ~ x / ln(x) as x approaches infinity — meaning the ratio of π(x) to x / ln(x) tends to 1.

This result, proved independently by Hadamard and de la Vallée Poussin in 1896, resolved a century of speculation. Gauss had conjectured the approximation as a teenager, based on examining tables of primes. Riemann's 1859 paper introduced the zeta function and suggested that the distribution of primes was controlled by the zeros of this function — a connection that would eventually yield the proof and that remains the subject of the Riemann hypothesis.

The theorem is not merely a statistical curiosity. It establishes that the primes, despite their definition as numbers with no divisors other than 1 and themselves, exhibit a regularity in the large that is as predictable as the behavior of random events. The primes are deterministic yet distributed like a random process — a pattern that has inspired models from probabilistic number theory to random matrix theory and that connects arithmetic to statistical physics in ways that remain incompletely understood.