Euclid's proof that there are infinitely many primes works by constructing the number N = (product of first n primes) + 1 and showing that either N is prime itself (and thus larger than all primes in the list) or N has a prime divisor not in the original list (since N leaves remainder 1 when divided by any prime in the list), so the list can always be extended, proving infinitude.

factualpending

Speaker

Keith Devlin

Evidence Quote

“clearly n is bigger than pn so if n happens to be prime we found a prime number bigger than p n... if n is not prime then it's going to be divisible by a prime... p cannot be any of the primes p1 p2 p3 up to pn”

Source

Introduction to mathematical thinking complete course— Nerd's lesson
Created: 8/10/2026, 9:54:16 PM

Your notes

Loading notes...