The Chebyshev function
is defined by
,
where
is the von Mangoldt function. The Chebyshev function is often used in proofs related to prime numbers, because it is typically simpler to work with than the prime counting function,
.
Based on a conjecture by Riemann, von Mangoldt proved an explicit for
whose main term is a sum over the nontrivial zeros of the Riemann zeta function:

Here
runs over the nontrivial zeros of the zeta function, and

From the Taylor series for the logarithm, the last term in the explicit formula can be understood as a summation of
over the nontrivial zeros of the zeta function,
, i.e.
.
Relation to the prime counting function
The Chebyshev function can be related to the prime counting function as follows. Define

Then
.
The transition from
to the prime counting function,
, is made through the equation

Certainly
, so for the sake of approximation, this last relation can be recast in the form
.
The Riemann hypothesis
The Riemann hypothesis states that all nontrivial zeros of the zeta function have real part 1/2. In this case,
. Then
,
where
runs over the imaginary parts of the nontrivial roots of the zeta function.
Then by the above, it can readily be shown that
