Difference between revisions of "Prime number theorem"
Jump to navigation
Jump to search
(New page: The '''prime number theorem''' is an estimate of the number of primes below any given number: Let π(''n'') be a function providing the number of primes less than or equal to ''n'', for a...) |
|||
| Line 1: | Line 1: | ||
The '''prime number theorem''' is an estimate of the number of primes below any given number: | The '''prime number theorem''' is an estimate of the number of primes below any given number: | ||
| − | Let π(''n'') be a function providing the number of primes less than or equal to ''n'', for any | + | Let π(''n'') be a function providing the number of primes less than or equal to ''n'', for any positive number ''n''. The prime number theorem states that |
: <math>\pi(n) = \lim_{n\to\infty}n/\ln(n)</math> | : <math>\pi(n) = \lim_{n\to\infty}n/\ln(n)</math> | ||
[[category:mathematics]] | [[category:mathematics]] | ||
Revision as of 04:52, August 31, 2007
The prime number theorem is an estimate of the number of primes below any given number:
Let π(n) be a function providing the number of primes less than or equal to n, for any positive number n. The prime number theorem states that
