Proof. Consider any number n. Let n! be the factorial of n, and consider the number p = n! + 1. So p is larger than n, and it has a remainder of 1 when divided by any number up to n. So p is prime, and we have therefore found a prime number above n. So there are infinitely many prime numbers.