Difference between revisions of "Prime counting function"
Pi3point14 (talk | contribs) |
Pi3point14 (talk | contribs) |
||
| Line 6: | Line 6: | ||
* [[Prime Number Theorem]] | * [[Prime Number Theorem]] | ||
| − | *[[Riemann | + | *[[Riemann zeta function]] |
{{stub}} | {{stub}} | ||
Revision as of 12:05, 13 August 2015
The prime counting function, denoted 
, is a function defined on real numbers. The quantity 
is defined as the number of positive prime numbers less than or equal to 
.
The function is asymptotically equivalent to 
. This is the prime number theorem. It is also asymptotically equivalent to Chebyshev's theta function.
See also
This article is a stub. Help us out by expanding it.
