The Infinitude of Primes
It's like building endlessly with Lego bricks and discovering that the supply of unique, indivisible starter pieces never runs out.
Definition The mathematical theorem stating that prime numbers (natural numbers greater than 1 divisible only by 1 and themselves) continue endlessly. No matter how large numbers get, a 'final prime' simply does not exist.
The Building Blocks of Every Number
Imagine a toy box filled with Lego bricks. You can snap multiple bricks together to build a towering castle or a race car, but the individual bricks themselves cannot be broken down any further.
In mathematics, the numbers that serve as these fundamental building blocks are prime numbers (numbers with no positive divisors other than 1 and themselves). These are numbers like 2, 3, 5, and 7. You make 6 by multiplying 2 and 3, and 12 by multiplying 2, 2, and 3. Every whole number greater than 1 can be broken down into a product of primes.
So, as numbers climb into the millions, trillions, and beyond, do brand-new building blocks keep showing up? Because larger numbers have more chances to be divided, it might seem like primes should eventually vanish. But even if you travel to the edge of infinity, primes never run out.
Euclid's Brilliant Twist
About 2,300 years ago, the ancient Greek mathematician Euclid came up with an exceptionally elegant answer. He used proof by contradiction (assuming the opposite to reveal an impossibility) by pretending that the total list of primes was finite.
Imagine for a moment that there were only three primes in the entire universe: 2, 3, and 5. Now, multiply them all together and add 1. That gives you (2 Γ 3 Γ 5) + 1 = 31.
Try dividing this new number 31 by 2: you get a remainder of 1. Divide by 3: remainder of 1. Divide by 5: remainder of 1. In other words, it is not divisible by any prime on our complete list! That means 31 must either be a brand-new prime itself, or divisible by some other prime we missed. Either way, a new prime outside the original list must exist.
A Closer Look at the Logic
Multiplying all known primes and adding 1 doesn't always create a prime number on its own. More precisely, even when the resulting number is composite (not prime), it is guaranteed to have prime factors that were not on your original list.
For example, multiplying the first six primes and adding 1 gives (2 Γ 3 Γ 5 Γ 7 Γ 11 Γ 13) + 1 = 30,031. This is not a prime; it breaks down into the product of two new primes: 59 and 509. What matters is that whether the result is prime or composite, you are always forced to find new primes outside the starting list.
Primes become rarer as numbers grow larger, but they never vanish entirely. Today, the backbone of modern cryptographyβsecuring everything from online banking to private messagingβrelies on this infinite and mysterious property of prime numbers.
π€ Common misconceptions
Following Euclid's method of multiplying all known primes and adding 1 always produces a prime number itself.
The resulting number is not necessarily prime. It can be composite, but even then, its prime factors will always include brand-new primes absent from the original list, keeping the proof rock-solid.
π§Ί Where you meet it
Primes are the indivisible building blocks of all numbers, and no matter how high you count, new primes will continue to appear forever.