What Is a Prime Number?
A prime number is a whole number greater than 1 that has exactly two factors: 1 and itself. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29… The sequence continues, thinning out as numbers grow larger, but never stopping. There are infinitely many prime numbers — a fact proved by Euclid more than 2,000 years ago in an argument so elegant it is still taught today. Euclid’s proof: Suppose, for the sake of contradiction, that there are only finitely many primes: p₁, p₂, …, pₙ. Consider the number N = (p₁ × p₂ × … × pₙ) + 1. This number is either prime itself, or it has a prime factor. But it cannot be divisible by any of p₁ through pₙ — dividing by any of them leaves remainder 1. So N is either a new prime, or it has a prime factor not in our list. Either way, our list was incomplete. Contradiction. Therefore there are infinitely many primes. This proof is a perfect example of mathematical elegance: a few lines of reasoning that establish an infinite fact with complete certainty. No computer could verify this by checking cases — there are infinitely many cases to check. Logic, not computation, is what makes it work.The Fundamental Theorem of Arithmetic
What makes primes so special is not just that there are infinitely many of them, but that they are the building blocks of all whole numbers. The Fundamental Theorem of Arithmetic states that every whole number greater than 1 can be expressed as a product of prime numbers in exactly one way (ignoring order). This is called the prime factorization. 12 = 2 × 2 × 3 100 = 2 × 2 × 5 × 5 997 = 997 (prime, no factorization) 1,000,000 = 2⁶ × 5⁶ Primes are to whole numbers what atoms are to matter: the irreducible constituents from which everything else is built. Every composite number is a unique product of primes. Change the primes, and you get a different number. This uniqueness is not obvious — it requires proof. And the proof reveals something deep: the structure of multiplication among whole numbers is entirely determined by primes.The Distribution of Primes: Order in Apparent Chaos
Primes seem to appear randomly among the whole numbers. There is no simple formula that generates all primes and nothing else. The gaps between consecutive primes are irregular, unpredictable on the surface. And yet, zoom out far enough, and a remarkable regularity emerges. The Prime Number Theorem, proved in 1896, describes precisely how primes are distributed among large numbers. If you pick a large number N at random, the probability that it is prime is approximately 1/ln(N), where ln is the natural logarithm. Primes become rarer as numbers grow larger — but they thin out in a predictable way. This is one of the most astonishing results in mathematics: local chaos, global order. Individually, primes behave unpredictably. Collectively, they follow laws as precise as those governing the motion of planets. The deeper questions about prime distribution remain open. The Riemann Hypothesis — one of the Millennium Prize Problems, with a $1 million prize attached — is fundamentally a question about how primes are distributed. It has been verified for trillions of cases. It has not been proved. It may be the most important unsolved problem in mathematics.Why Primes Protect the Internet
Here is where the abstract becomes urgently practical. Modern internet security relies on a fundamental asymmetry: some mathematical operations are easy to perform but practically impossible to reverse. Multiplying two large prime numbers together is easy — a computer can do it in a fraction of a second. Factoring the resulting number back into its two prime components is, for large enough primes, effectively impossible with current technology. This asymmetry is the basis of RSA encryption — the system that protects the majority of secure internet communications. Here is how it works at a conceptual level: Choose two large prime numbers, p and q. Multiply them: n = p × q. Publish n as part of your public key. Anyone can encrypt a message using n. But only someone who knows p and q — the original prime factors — can decrypt it. The security of the system rests on the difficulty of factoring n. For primes with hundreds of digits, factoring their product would require more computing time than the current age of the universe, even on the fastest classical computers. The mathematics of prime numbers, developed by ancient Greek mathematicians for reasons having nothing to do with communication, turns out to be the foundation of modern cryptography. This is one of the most remarkable examples of “unreasonable effectiveness” in the history of human thought: abstract mathematics, pursued with no practical application in mind, becoming essential infrastructure for global civilization.Twin Primes, Mersenne Primes, and Open Questions
Number theory is unusual among mathematical disciplines in that some of its most famous open questions are easy to state but have resisted proof for centuries. The Twin Prime Conjecture asks whether there are infinitely many pairs of primes that differ by exactly 2: (3, 5), (5, 7), (11, 13), (17, 19), (29, 31)… These pairs thin out as numbers grow larger, but do they ever stop? No one knows. In 2013, Yitang Zhang proved that there are infinitely many prime pairs differing by less than 70 million — a breakthrough after decades of no progress. The gap has since been reduced to 246. But infinity of pairs differing by exactly 2 remains unproven. Mersenne Primes are primes of the form 2ⁿ – 1. The largest known primes are almost always Mersenne primes — they have a special structure that makes them easier to test with existing algorithms. The Great Internet Mersenne Prime Search (GIMPS) is a distributed computing project that has found the largest known primes using the spare processing power of volunteers’ computers. The current record holder, M136279841 = 2¹³⁶²⁷⁹⁸⁴¹ – 1, has 41,024,320 digits. Goldbach’s Conjecture, proposed in 1742, states that every even integer greater than 2 is the sum of two primes. 4 = 2+2, 6 = 3+3, 8 = 3+5, 100 = 3+97… It has been verified for every even number up to 4 × 10¹⁸. It has not been proved. It may be true. We do not know.What Prime Numbers Teach Students
We include number theory in our curriculum at CyberMath Academy for reasons that go beyond the mathematics itself. Number theory is an ideal setting for learning what mathematical thinking actually is. The problems are easy to state. Many require no tools beyond arithmetic and logic. And yet they lead directly to some of the deepest, most difficult, and most important mathematics in existence. Working through Euclid’s proof of the infinitude of primes teaches proof by contradiction. Working through RSA encryption teaches how abstract mathematics becomes applied technology. Working through open conjectures like Goldbach teaches intellectual humility — the recognition that mathematics contains questions no one has answered, and that the gap between “seems true” and “is proved” is everything. These are not lessons about number theory. They are lessons about how to think.
Number Theory at CyberMath Academy — Harvard Boston
In our Mathematics track at CyberMath Academy, we explore number theory as part of a broader curriculum that includes proof-based mathematics, combinatorics, probability, and the mathematical foundations of artificial intelligence. Students work through Euclid’s proof, the Fundamental Theorem of Arithmetic, modular arithmetic, and the conceptual basis of RSA encryption — not as topics to memorize, but as ideas to understand deeply enough to reconstruct, explain, and apply. Our instructors include an IMO Gold Medalist from MIT and active researchers from Google Brain, Harvard Medical School, and Stanford — people who work with the consequences of number theory every day, and who bring that perspective into the classroom. The program runs July 20–31, 2026 at Harvard Faculty Club, Boston, MA. Students aged 9–16 are welcome at all levels of prior mathematical preparation.“I came in thinking math was about formulas. I left understanding that it is about ideas. That is a completely different thing — and I am not sure I can go back.”
— CyberMath Academy student · Summer 2025