Number of Primes is Infinite/Proof 1

From ProofWiki
Jump to: navigation, search

Theorem

The number of primes is infinite.


Proof

Euclid's Theorem states that:

For any finite set of prime numbers, there exists a prime number not in that set.

The result follows by corollary.

$\blacksquare$