Number theory Analytic number theory Theorem
Prime number theorem
Builds on Prime-counting function
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.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Prime number definition
- Prime-counting function definition
- Prime number theorem statement
Where this leads
6 pages build on this one.
Further reading
About this page
| Tag | 0EHBY5Y84N |
|---|---|
| URI | m2://0EHBY5Y84N |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 11N05 |
| Status | This copy of the site has no build data. Run m2 status 0EHBY5Y84N. |
| Uses | Prime-counting function |
| Same as |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.