**Euler's Proof**

Another proof, by the Swiss mathematician Leonhard Euler, relies on the fundamental theorem of arithmetic: that every integer has a unique prime factorization. If *P* is the set of all prime numbers, Euler wrote that:

The first equality is given by the formula for a geometric series in each term of the product. To show the second equality, distribute the product over the sum:

in the result, every product of primes appears exactly once, so by the fundamental theorem of arithmetic, the sum is equal to the sum over all integers.

The sum on the right is the harmonic series, which diverges. So the product on the left must diverge also. Since each term of the product is finite, the number of terms must be infinite, so there is an infinite number of primes.

Read more about this topic: Euclid's Theorem

### Famous quotes containing the word proof:

“When children feel good about themselves, it’s like a snowball rolling downhill. They are continually able to recognize and integrate new *proof* of their value as they grow and mature.”

—Stephanie Martson (20th century)