Other Prime-counting Functions
Other prime-counting functions are also used because they are more convenient to work with. One is Riemann's prime-counting function, usually denoted as or . This has jumps of 1/n for prime powers pn, with it taking a value half-way between the two sides at discontinuities. That added detail is because then it may be defined by an inverse Mellin transform. Formally, we may define by
where p is a prime.
We may also write
where Λ(n) is the von Mangoldt function and
Möbius inversion formula then gives
Knowing the relationship between log of the Riemann zeta function and the von Mangoldt function, and using the Perron formula we have
The Chebyshev function weights primes or prime powers pn by ln(p):
Riemann's prime-counting function has the ordinary generating function:
Read more about this topic: Prime-counting Function
Famous quotes containing the word functions:
“Nobody is so constituted as to be able to live everywhere and anywhere; and he who has great duties to perform, which lay claim to all his strength, has, in this respect, a very limited choice. The influence of climate upon the bodily functions ... extends so far, that a blunder in the choice of locality and climate is able not only to alienate a man from his actual duty, but also to withhold it from him altogether, so that he never even comes face to face with it.”
—Friedrich Nietzsche (18441900)