NT1
From Exampleproblems
Prove that there are infinitely many primes.
Let 
where p is a prime. Then q is not divisible by any prime less than or equal to p. Now either q is prime or it is divisible by primes greater than p and less than q. In either case there is a prime greater than p, which proves the theorem.
-Euclid
