The Prime Number Theorem

Number Theory · Axiom Academy

LESSON The Prime Number Theorem The crowning achievement of analytic number theory: understanding the asymptotic distribution of prime numbers Let π(x) denote the number of primes less than or equal to x. The Prime Number Theorem states: This asymptotic notation means that the ratio of π(x) to x/ln(x) approaches 1 as x grows without bound. In other words, x/ln(x) provides an increasingly accurate approximation to π(x) for large values of x. The Prime Number Theorem has a beautiful probabilistic interpretation: the "probability" that a randomly chosen integer near n is prime is approximately 1/ln(n). This tells us that primes become progressively rarer as we move to larger numbers, but they never disappear entirely. The density decreases logarithmically, not exponentially, which means primes remain surprisingly abundant even among large numbers. The journey to proving the Prime Number Theorem spans over a century and connects some of mathematics' greatest minds: 4. Connection to the Riemann Zeta Function The proof of the Prime Number Theorem relies crucially on properties of the Riemann zeta function: The key insight is that ζ(s) has no zeros on the line Re(s) = 1. This seemingly abstract fact about complex analysis directly translates to the asymptotic behavior of primes. Let's see how well x/ln(x) approximates π(x) for various values: x = 10³: π(x) = 168, x/ln(x) ≈ 145 (error ~14%) x = 10⁶: π(x) = 78,498, x/ln(x) ≈ 72,382 (error ~8%)

This is the written version of the interactive lesson above. See the full Number Theory course.