The Numbers That Refuse to Obey Any Pattern
A prime number is divisible only by 1 and itself. They're the atoms of arithmetic. After 2,300 years of mathematical effort, we still cannot predict where the next prime will appear — and the entire security of the internet depends on that.
A prime number is divisible only by 1 and itself. They're the atoms of arithmetic. After 2,300 years of mathematical effort, we still cannot predict where the next prime will appear — and the entire security of the internet depends on that.
Euclid proved around 300 BCE that there are infinitely many primes. His argument is elegant: suppose you had a list of all primes. Multiply them all together and add 1. The result isn't divisible by any prime on your list (they'd all leave remainder 1). So either the new number is prime, or it's divisible by a prime you missed. Either way, your list was incomplete.
For something so fundamental, primes behave with unsettling irregularity. The first few are 2, 3, 5, 7, 11, 13. But the gaps widen unpredictably. Sometimes they come in pairs (twin primes, like 11 and 13, or 17 and 19). Sometimes there's a desert — a stretch of hundreds of consecutive numbers with no primes at all. And yet, no matter how far you go, primes keep appearing.
In 1859, Bernhard Riemann proposed a hypothesis about a deep connection between primes and a specific function (the zeta function). If true, the Riemann Hypothesis would explain why primes are distributed the way they are — neither too clumped nor too scattered. Despite 165 years of attempts, it remains unproven. It's the most famous unsolved problem in mathematics. The Clay Mathematics Institute offers a million-dollar prize to anyone who can prove or disprove it.
The practical importance exploded in 1977 when the RSA algorithm made primes the foundation of internet security. Online banking, encrypted email, credit card transactions, and secure messaging all rely on the fact that multiplying two very large primes is easy, but factoring their product back is currently impossible in reasonable time.
If someone ever finds a fast factoring algorithm — or builds a sufficiently powerful quantum computer — a huge portion of the world's digital security collapses. Nations already archive encrypted communications in the hope of decrypting them later when quantum computers mature.
This means mathematicians are in a peculiar position. Proving new things about primes is beautiful pure research, a quest stretching back to Euclid. It's also a matter of national security. The oldest and most abstract branch of mathematics is now entangled with the most modern technology.
Primes have been studied for 24 centuries and still guard their secrets. The most fundamental numbers we know remain, in many ways, a mystery.