It is well-known that there are infinitely many prime numbers, but how can we prove that this is true? In ancient Greece, Euclid had a proof which is still the best one. First we start with the lemma that every integer greater than 1 has a prime factors. Then we use this to prove the infinitude of the primes via an ingenious multiplication trick.