|
The {\it prime counting function} is a non-multiplicative function for any positive real number $x$, denoted as $\pi(x)$ and gives the number of primes not exceeding $x$. It usually takes a positive integer $n$ for an argument. The first few values of $\pi(n)$ for $n = 1, 2, 3, \ldots $ are $0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8 \ldots $ (\PMlinkexternal{Sloane's sequence A000720}{http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=000720}
|
The {\it prime counting function} is a non-multiplicative function for any positive real number $x$, denoted as $\pi(x)$ and gives the number of primes not exceeding $x$. It usually takes a positive integer $n$ for an argument. The first few values of $\pi(n)$ for $n = 1, 2, 3, \ldots $ are $0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8 \ldots $.
|
