The proof of the Euler Product Formula
(Written by AI)
Start with the full sum
ζ(s)=1+2s1+3s1+4s1+5s1+…
The sifting
Multiply the entire equation by 2s1:
2s1ζ(s)=2s1+4s1+6s1+…
Subtract this new equation from the original. This removes every term that is a multiple of 2:
(1−2s1)ζ(s)=1+3s1+5s1+7s1+…
Repeat for every prime
Repeat the process for the next available number, 3:
(1−3s1)(1−2s1)ζ(s)=1+5s1+7s1+11s1+…
Now all multiples of 2 and 3 are gone.
If you keep doing this for every prime number (5,7,11,…), every term on the right-hand side disappears except for 1.
…(1−5s1)(1−3s1)(1−2s1)ζ(s)=1
The result
To isolate ζ(s), move all those prime factors to the other side:
ζ(s)=(1−2−s)1⋅(1−3−s)1⋅(1−5−s)1…