Prime counting function
From AoPSWiki
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.
