Number Theory Explained
Integers have deep structure. Explore primes, GCD via Euclid, and congruences that underpin cryptography.
📚 Fundamentals
- Prime factorization: fundamental theorem of arithmetic
- Euclidean algorithm: efficient GCD computation
- Modular arithmetic: congruences and inverses