The Euler Product for Zeta
Why should a function built from all integers tell us anything about primes? The
answer is the Euler product,
now read as a statement about the
zeta function.
It is the precise hinge connecting analysis to arithmetic.
The identity
For s > 1,
\zeta(s) = \sum_{n=1}^{\infty}\frac{1}{n^{s}} = \prod_{p \text{ prime}} \frac{1}{1 - p^{-s}}.
The sum sees every integer; the product sees only primes. Their equality is
unique factorisation
in analytic clothing — and it means \zeta is a faithful encoding of the
primes. Anything we learn about the function becomes a fact about the primes, and vice versa.
The primes are encoded in the zeros
Taking a logarithm turns the product into a sum over primes, and differentiating relates
\zeta to a sum that counts primes (and prime powers). The upshot
— Riemann's great insight — is an exact formula for the prime-counting function
\pi(x) written in terms of the zeros of
\zeta:
\pi(x) \approx \operatorname{Li}(x) - \sum_{\rho} (\text{term from each zero } \rho).
Each zero contributes an oscillation; together they correct the smooth estimate into the exact
prime count. The primes' apparent randomness is the music of the zeta zeros.
Why this matters
This is the strategy behind every proof of the
Prime Number Theorem:
control where \zeta can vanish, and you control how the primes are spread.
Showing simply that \zeta(s) \ne 0 on the line
\Re(s) = 1 is already enough to prove it. Pinning the zeros down
exactly is the
Riemann Hypothesis.