statement theorem
Prime number theorem
Statement
Let be the prime-counting function, and let be the natural logarithm. Then
Remarks
We write this as . An equivalent form: the -th prime satisfies . The logarithmic integral gives a better approximation of , with the same limit. For example, and .
History
Legendre and Gauss conjectured the result from tables of primes, at the end of the 18th century. Hadamard and de la Vallée Poussin proved it independently in 1896, with methods of complex analysis. Selberg and Erdős found elementary proofs in 1949.
Explanations
L1 human
Near a large number , about one number in is prime. For numbers with digits, , so about one number in is prime. The theorem makes this rough rule precise.
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Divisibility definition
- Prime number definition
- Prime-counting function definition
- Prime number theorem statement
Sources
What links here
No node links to this node yet.