Starting from the idea of decomposing (or factoring) natural
numbers using multiplication (or division), we find primes using the
Sieve of Eratosthenes (but only finitely
many!). There are infinitely many -- they just don't stop! The proof
was discovered by Euclid over 2000 years ago.
Even though primes seem to appear irregularly amongst the natural numbers,
primes become sparser and sparser as the natural numbers get bigger and
bigger. It's just that there's always another one!
Question: How do we know?