(Adding categories) |
(Adding categories) |
||
Line 10: | Line 10: | ||
<math>P_x \approx x\ln(x)</math>, where <math>P_x</math> is the <math>x</math>th prime number. |
<math>P_x \approx x\ln(x)</math>, where <math>P_x</math> is the <math>x</math>th prime number. |
||
[[Category:Theorems and Proofs]] |
[[Category:Theorems and Proofs]] |
||
+ | [[Category:Important Pages]] |
Revision as of 07:31, 6 July 2014
The Prime Number Theorem (or the PNT) is a theorem that concerns the distribution of primes and, subsequently, the gaps between primes. Its first proof date is not known.
Statement of Theorem
The theorem, formally stated, says that:
where is the number of primes up to and including . This means that for any number , the number of primes up to and including approaches divided by the the log to base e (or the natural log) of as approaches infinity and becomes a better approximation of as grows larger. This also means that:
, where is the th prime number.