This chapter opens with the ``Euler product", a remarkable identity
that unlocks a whole vista of further ideas. Stated in modern terms ,
it says that for a completely multiplicative function
,
The summation function of
(denoted by
) is similar
to Chebyshev's
, but differs by counting powers of primes as well
as primes. We show that it would do just as well for the purpose of proving
the prime number theorem. The final step, which must wait until chapter 3,
will be to deduce the required estimation of
from the
behaviour of the function
.
Meanwhile, the methods of the present chapter are enough to give
very satisfactory estimates of the summation functions of various other
arithmetic functions, and of sums like
. A number of results of this sort are described
in sections 2.5 and 2.6. The reader
wanting a fast track to the prime number theorem can defer these sections.