Number theory

(the study of the deep properties of whole numbers: primes, divisibility, and remainders)

What is number theory?

Where ordinary arithmetic is about carrying out operations on numbers, number theory studies the deeper patterns and properties whole numbers have — especially divisibility, primes, and remainders.

Perfect numbers: a simple pattern with a real example

A perfect number is a whole number that equals the sum of its own divisors, not counting itself. Take 6: its divisors (other than itself) are 1, 2, and 3, and 1 + 2 + 3 = 6 exactly. The next one is 28: its divisors are 1, 2, 4, 7, and 14, and 1+2+4+7+14 = 28. These aren't common — after 6 and 28, the next is 496 — but each one that has been found genuinely does satisfy the property exactly, which can be checked directly by adding up its divisors.

Twin primes and prime gaps

Twin primes are pairs of primes that differ by exactly 2, like (11, 13) or (17, 19). Mathematicians have found enormous numbers of twin prime pairs, and it's widely believed — but not yet proven — that infinitely many exist; this remains a genuinely open question, honestly labeled as unproven rather than settled fact.

Modular arithmetic in everyday life: check digits

Many everyday numbers include a "check digit," calculated using modular arithmetic (remainders after division), specifically to catch typing mistakes. Barcodes and ISBN book numbers both work this way: every digit is combined using a fixed weighted formula, and the final check digit is chosen so the whole result leaves a remainder of 0 when divided by a fixed number. If you mistype a single digit while entering an ISBN, the check digit will almost always fail to match — which is exactly why store scanners and library systems can catch typos immediately, without needing to look the number up anywhere first.

Why number theory matters

Beyond its own patterns, number theory turns out to be the foundation of modern digital security. Every time your browser connects securely to a website, it relies on the mathematical fact that multiplying two large prime numbers together is easy, but taking a large number and finding its two original prime factors back again is, with current methods, extremely hard — a genuine, hard mathematical problem, not just an inconvenience, and the reason encryption built on it is currently considered secure.