

Chebyshev Functions
The two functions and
defined below are known as the Chebyshev functions.
The function is defined by
(1) | |||
(2) | |||
(3) |
(Hardy and Wright 1979, p. 340), where is the
thprime,
is theprime counting function, and
is theprimorial. This function has the limit
(4) |
and the asymptotic behavior
(5) |
(Bach and Shallit 1996; Hardy 1999, p. 28; Havil 2003, p. 184). The notation is also commonly used for this function (Hardy 1999, p. 27).
The related function is defined by
(6) | |||
(7) |
where is theMangoldt function (Hardy and Wright 1979, p. 340; Edwards 2001, p. 51). Here, the sum runs over all primes
and positive integers
such that
, and therefore potentially includes some primes multiple times. A simple and beautiful formula for
is given by
(8) |
i.e., the logarithm of theleast common multiple of the numbers from 1 to (correcting Havil 2003, p. 184). The values of
for
, 2, ... are 1, 2, 6, 12, 60, 60, 420, 840, 2520, 2520, ... (OEISA003418; Selmer 1976). For example,
(9) |
The function also has asymptotic behavior
(10) |
(Hardy 1999, p. 27; Havil 2003, p. 184).
The two functions are related by
(11) |
(Havil 2003, p. 184).
Chebyshev showed that,
, and
(Ingham 1995; Havil 2003, pp. 184-185).
According to Hardy (1999, p. 27), the functions and
are in some ways more natural than theprime counting function
since they deal with multiplication of primes instead of the counting of them.
See also
Mangoldt Function,Prime Counting Function,Prime Number Theorem,PrimorialExplore with Wolfram|Alpha

More things to try:
References
Bach, E. and Shallit, J.Algorithmic Number Theory, Vol. 1: Efficient Algorithms. Cambridge, MA: MIT Press, pp. 206 and 233, 1996.Chebyshev, P. L. "Mémoir sur les nombres premiers."J. math. pures appl.17, 366-390, 1852.Costa Pereira, N. "Estimates for the Chebyshev FunctionReferenced on Wolfram|Alpha
Chebyshev FunctionsCite this as:
Weisstein, Eric W. "Chebyshev Functions."FromMathWorld--A Wolfram Resource.https://mathworld.wolfram.com/ChebyshevFunctions.html