# NT1

From Example Problems

Prove that there are infinitely many primes.

Let where is a prime. Then is not divisible by any prime less than or equal to . Now either is prime or it is divisible by primes greater than and less than . In either case there is a prime greater than , which proves the theorem.

-Euclid