Difference between revisions of "Prime counting function"

m (new page)
 
Line 6: Line 6:
  
 
* [[Prime Number Theorem]]
 
* [[Prime Number Theorem]]
 +
*[[Riemann Zeta Function]]
  
 
{{stub}}
 
{{stub}}

Revision as of 13:05, 13 August 2015

The prime counting function, denoted $\pi$, is a function defined on real numbers. The quantity $\pi(x)$ is defined as the number of positive prime numbers less than or equal to $x$.

The function $\pi(x)$ is asymptotically equivalent to $x/\log x$. 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.