History — How many primes are there?

Euclid proved (Elements, Book IX, Prop. 20) that the primes are infinite: if p1,,pkp_1,\ldots,p_k were all the primes, the number N=p1pk+1N=p_1\cdots p_k+1 would not be divisible by any of them, so it would have a new prime factor — a contradiction.

The prime number theorem, conjectured by Gauss and proved independently by Hadamard and by de la Vallée Poussin in 1896, refines the picture: π(N)N/lnN\pi(N)\sim N/\ln N, where π(N)\pi(N) is the number of primes N\le N. For N=106N=10^6 there are 7849878\,498 primes against the estimate 106/ln1067238210^6/\ln 10^6\approx 72\,382: a relative error of about 8%8\%, which decreases (slowly) to zero as NN\to\infty.

Topics: Numbers and operations
Concepts: Prime number
People: De la Vallée Poussin · Euclid · Carl Friedrich Gauss · Hadamard