Prime number theorem




<mathematics> The number of prime numbers less than x is about x/log(x).

Here "is about" means that the ratio of the two things tends to 1 as x tends to infinity.

This was first conjectured by Gauss in the early 19th century, and was proved (independently) by Hadamard and de la Vall'ee Poussin in 1896.

Their proofs relied on complex analysis, but Erdös and Selberg later found an "elementary" proof.



< Previous Terms Terms Containing prime number theorem Next Terms >
primary key
primary management domain
Primary Rate Interface
Prime Computer
Primenet, Inc.
 Carl Friedrich Gauss
 prime time
primitive
Princeton University
principal type
PRINT