What Is Number Theory? The Queen of Mathematics

Number theory is the study of integers — and the discovery that they're infinitely deep.

You might think whole numbers are simple. 1, 2, 3, 4, 5... What's to study? But mathematicians have been investigating integers for millennia and still can't answer basic questions. Is every even number greater than 2 the sum of two primes? We don't know. Are there infinitely many twin primes? We don't know. The simplest objects harbor the hardest problems.

Number theory asks elementary questions and gets profound answers.

That's the unlock. Gauss called number theory "the queen of mathematics" not because it rules over other branches, but because it pursues beauty for its own sake. The questions are easy to state: which numbers are prime? How do they distribute? What patterns exist in divisibility? The answers reveal structure so deep that centuries of work have only scratched the surface.

The Subject Matter

Number theory studies integers: {..., -3, -2, -1, 0, 1, 2, 3, ...}

And specifically:

• Divisibility: when does a divide b?
• Primes: numbers divisible only by 1 and themselves
• Factorization: expressing numbers as products of primes
• Congruences: relationships based on remainders
• Diophantine equations: integer solutions to polynomial equations

No fractions, no decimals, no continuous curves. Just whole numbers and what can be built from them.

Why "The Queen"?

Gauss meant that number theory is pursued for its own sake, not for applications.

Historically, number theory seemed useless. Pure abstraction. Mathematical recreation. Who cares which numbers are prime?

Then came cryptography. RSA encryption, which protects your bank transactions and private messages, relies entirely on the difficulty of factoring large numbers. Suddenly, "pure" number theory became the foundation of digital security.

The queen found a kingdom.

Ancient Questions, Modern Mysteries

Euclid (300 BCE): Proved there are infinitely many primes. His proof is still taught today.

Fermat (1637): Claimed x^n + y^n = z^n has no positive integer solutions for n > 2. Proved 358 years later by Andrew Wiles (1995).

Goldbach (1742): Conjectured every even number > 2 is the sum of two primes. Still unproven.

Riemann (1859): Hypothesized a pattern in prime distribution. The Riemann Hypothesis remains unsolved — a million-dollar Millennium Prize problem.

Simple questions. Centuries of effort. Deep structure waiting to be found.

Divisibility: The Starting Point

a divides b (written a | b) if b = ak for some integer k.

3 | 12 because 12 = 3 × 4 ✓ 5 | 12? 12 = 5 × ? No integer works. ✗

Divisibility is the fundamental relation in number theory. From it flow primes, factorization, GCD, LCM, and modular arithmetic.

Primes: The Atoms

A prime is a positive integer greater than 1 with exactly two divisors: 1 and itself.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...

Every integer > 1 is either prime or a product of primes. Primes are the multiplicative building blocks — the atoms from which all numbers are composed.

Their distribution is mysterious. They thin out as numbers grow larger, but they never stop appearing. Predicting the next prime is easy in principle (just check) but no formula generates them.

The Fundamental Theorem of Arithmetic

Every integer greater than 1 factors uniquely into primes (up to order).

60 = 2² × 3 × 5

This factorization is unique. No other primes, no other exponents. 60 = 2² × 3 × 5 and nothing else.

This theorem is the backbone of number theory. It means integers have a unique "prime fingerprint."

Modular Arithmetic: Clock Math

7 + 8 = 15. But on a 12-hour clock, 7 + 8 = 3.

Modular arithmetic "wraps around." We say 15 ≡ 3 (mod 12), meaning 15 and 3 leave the same remainder when divided by 12.

This isn't just a trick — it's a complete arithmetic system. You can add, subtract, multiply, and sometimes divide, all working with remainders.

Modular arithmetic powers modern cryptography and computer science.

Diophantine Equations

Equations where you seek integer solutions.

x² + y² = z² — Pythagorean triples: (3,4,5), (5,12,13), (8,15,17), ...

x² + y² = n — Which numbers are sums of two squares?

x^n + y^n = z^n for n > 2 — Fermat's Last Theorem: no solutions!

The restriction to integers makes these problems hard. With real numbers, most equations have solutions. With integers, existence is rare and precious.

The Riemann Hypothesis

The primes seem random, but they're not.

The Riemann Hypothesis predicts precisely how primes distribute among integers. It connects prime counting to complex analysis through the Riemann zeta function.

If true (and most mathematicians believe it is), we'd understand prime distribution far better. If false, much of number theory would need rethinking.

Posed in 1859. Still unsolved. One of mathematics' greatest open problems.

Applications: Beyond Pure Beauty

• Cryptography: RSA, elliptic curves, digital signatures
• Coding theory: Error-correcting codes use finite fields
• Hash functions: Primes create good hash distributions
• Random number generation: Linear congruential generators
• Computer algebra: Efficient computation relies on number-theoretic algorithms

The "useless" theory became essential infrastructure.

The Core Insight

Number theory studies the structure hidden in integers.

The questions are elementary: what makes a number prime? How do primes distribute? When do equations have integer solutions? But the answers involve the deepest mathematics known.

Simple objects, hard problems, beautiful theory. That's why Gauss called it the queen.

Part 1 of the Number Theory series.

Previous: Number Theory Explained Next: Prime Numbers: The Atoms of Arithmetic