Ancient Mathematics, Modern Uses
Number theory was long prized as the "purest" mathematics — studied for its beauty, seemingly without application. Today it secures nearly every online transaction. This closing lesson connects the unit's ideas to the systems that rely on them.
Error detection and correction. Check digits (Lesson 6) use modular arithmetic to catch mistakes: an ISBN's last digit makes a weighted sum , so a single wrong or transposed digit breaks the congruence and is flagged. The same modular idea, extended, lets error-correcting codes not just detect but repair corrupted data in storage and transmission.
Hashing. A hash function maps keys to a fixed range, typically by reducing modulo a table size (often chosen prime, to spread values evenly). This gives hash tables their near-instant lookup — a direct application of "reduce mod ."
Cryptography. The crown jewel is public-key cryptography (RSA), which rests entirely on number theory:
- It uses two large primes whose product is public but whose factors are secret.
- Encryption and decryption are modular exponentiation — fast to compute.
- Security rests on factoring being hard: recovering the primes from their product is computationally infeasible for large numbers, even though multiplying them is easy.
- Fermat's/Euler's theorems (Lesson 6) guarantee that decryption undoes encryption.
The lesson is that the unit's abstract tools — divisibility, primes, gcd, coprimality, modular arithmetic, and inverses — are exactly the machinery of modern digital security and data integrity. What Euclid and Fermat studied for its elegance turns out to be indispensable, a striking example of pure mathematics becoming essential technology.
Common pitfall: thinking cryptographic security comes from a secret algorithm rather than a hard mathematical problem. RSA's method is completely public; its security rests on the number-theoretic fact that factoring a large number into its prime factors is computationally hard, while multiplying primes is easy. The secret is the prime factors, not the procedure — hiding the algorithm is neither necessary nor what protects the data.