As we all know, a (natural) number is called prime if its positive divisors are only and . The fact that prime numbers are infinite in number was proved by Euclid (although it is not clear whether he discovered it) and the proof is a little gem of mathematical reasoning. We present his proof below:

**Theorem:** There are infinitely many prime numbers.

**Proof: **Consider any list of prime numbers, say . The number is clearly not on the list. If is not prime, then by definition there is a prime number which divides . Clearly for any as otherwise divides , a contradiction. So is a prime number not on the list. If, on the other hand, is prime, then it is anyway a prime number not on the list. Hence our list is incomplete.

We now give another beautiful proof for the same theorem owing to Euler. Although it does not strictly qualify as a valid mathematical proof by modern standards and is really nothing more then heuristic reasoning yet its “wow factor” is so high that as an exception it is still referred to as a proof. It can be recast into a more rigorous form but we do not so here so that its original taste is not disturbed. The essential argument here is that if the primes were finite then the product would be finite which is not the case.

**Theorem:** There are infinitely many prime numbers.

**Proof:** Let denote the set of all primes. Now consider the product i.e.

by the formula of the geometric series.

Next we observe that if we multiply out the terms (assuming such a multiplication is valid) then the reciprocal of every positive integer will occur exactly once by the uniqueness of the fundamental theorem of arithmetic. If is the unique factorization of then would result in the multiplication only when are multiplied. Hence the above product

. The latter harmonic series is well known to be divergent. Hence there must be infinitely many terms in .