Prime counting function

The 60 first values of π(n)

In mathematics, the prime counting function is the function counting the number of prime numbers less than or equal to some real number x. It is written as $\pi (x)$, but it is not related to the number π. Some key values of the function include $\pi (1)=0$, $\pi (2)=1$ and $\pi (3)=2$.

In general, if $p_{n}$stands for the n-th prime number, then $\pi (p_{n})=n$.

History

Of great interest in number theory is the growth rate of the prime-counting function. It was conjectured in the end of the 18th century by Gauss and by Legendre to be approximately

${\frac {x}{\log(x)}}$

where log is the natural logarithm, in the sense that

$\lim _{x\rightarrow \infty }{\frac {\pi (x)}{x/\log(x)}}=1.$

This statement is the prime number theorem. An equivalent statement is

$\lim _{x\rightarrow \infty }\pi (x)/\operatorname {li} (x)=1$

where li is the logarithmic integral function. The prime number theorem was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin independently, using properties of the Riemann zeta function introduced by Riemann in 1859. Proofs of the prime number theorem not using the zeta function or complex analysis were found around 1948 by Atle Selberg and by Paul Erdős (for the most part independently).

Related pages

• Ramanujan prime