Difference between revisions of "Prime number theorem"
Jump to navigation
Jump to search
m (missing word) |
m |
||
| Line 1: | Line 1: | ||
The '''prime number theorem''' is the name given to several theorems that provide estimates of the number of primes less than or equal to any given number: | The '''prime number theorem''' is the name given to several theorems that provide estimates of the number of primes less than or equal to any given number: | ||
| − | Let π(''n'') be | + | Let π(''n'') be the [[prime counting function]] providing the number of primes less than or equal to ''n'', for any positive number ''n''. The simplest form of the prime number theorem states that |
:<math>\pi(n)\sim\frac{n}{\ln n}</math>. | :<math>\pi(n)\sim\frac{n}{\ln n}</math>. | ||
Revision as of 00:40, May 3, 2008
The prime number theorem is the name given to several theorems that provide estimates of the number of primes less than or equal to any given number:
Let π(n) be the prime counting function providing the number of primes less than or equal to n, for any positive number n. The simplest form of the prime number theorem states that
- .
That is, as n tends to infinity, the relative error between π(n) and n/(ln n) tends to zero. This can be expressed using limit notation as