Did Euclid Prove There Are Infinitely Many Primes?

💡 The Answer

• Euclid's proof assumes a finite list, multiplies them, adds 1, and gets a new prime factor.
• The new number is either prime or has a prime factor not in the original list.
• This contradiction shows the list cannot be finite.
• It is one of the most elegant proofs in mathematics.