๐ข Number Theory Without the Misery
๐ข Number Theory Without the Misery
Every time you shop online, your browser and the shop agree on a secret code that nobody else on the network can read. What protects it is whole numbers, and a few facts about how they divide. This book shows the patterns hiding in plain numbers, from catching typos to locking your bank login.
WHAT'S INSIDE:
โ Divisibility tricks โ why adding the digits tells you if a huge number splits by 3 or 9
๐งฑ Primes โ the numbers that won't split, and an argument over 2,000 years old that proves they never run out
๐งพ Prime factorization โ every number's unique recipe
๐ซ The Euclidean algorithm โ finding the biggest shared piece without factoring, like the largest tile that fits a floor
๐ Modular arithmetic โ clock math, where you only keep the remainder
๐ณ Check digits โ how a card reader can spot a mistyped number before it ever asks the bank
๐ Fermat's little theorem โ powers that loop back, and a shortcut for huge powers
๐ RSA in miniature โ how two primes multiplied together can hide a secret message
โ ๏ธ A "5 Common Mistakes" chapter โ including calling 1 a prime
๐งฎ A Formulas & Quick Reference appendix, with a worked example
โ๏ธ 10 fully worked examples with every step shown
โ 11 practice problems with complete answers at the back
WHO THIS IS FOR:
Anyone who thought number theory was a club for people who enjoy suffering over proofs. Anyone curious how plain whole numbers keep card numbers and online shopping safe.
No prior knowledge of number theory required. 22 pages.