Euler's product is an infinite product over the prime numbers that has numerous applications in analysis and number theory. It is an alternative form of the Riemann zeta function
Where , the Euler product is equal to,
Where is some complex number.
Sketch of a proof
Consider the following series,
Now, multiply through ,
By subtracting these two series, we will remove every other term, hence removing any with a denominator that divides 2.
One can repeat this process infinitely with every prime, to remove every th term, in turn removing any number with a denominator divisible by . This mimics the behaviour of the Sieve of Eratosthenes. Notice that this will remove all primes, leaving only 1, as one is not conventionally considered prime and is excluded in the Sieve of Eratosthenes for obvious technical reasons. This forms an infinite series on the LHS while leaving 1 on the RHS,
Dividing both sides, we can obtain,
Consequences regarding the infinitude of prime numbers
Let , we know that
(ignore technicalities regarding that equality statement for the time being)
Observe that represents the harmonic series, which quite famously diverges. As it diverges, hence does the RHS. As the product on the RHS also diverges, that implies that there must be an infinite number of terms, else the product would converge. This implies that there is an infinite number of primes.
|This article is a stub. You can help Math Wiki by expanding it.|