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:
“In todays world parents find themselves at the mercy of a society which imposes pressures and priorities that allow neither time nor place for meaningful activities and relations between children and adults, which downgrade the role of parents and the functions of parenthood, and which prevent the parent from doing things he wants to do as a guide, friend, and companion to his children.”
—Urie Bronfenbrenner (b. 1917)
