27. Modular arithmetic and number theory

Work with congruences, modular inverses, the Chinese remainder theorem, Fermat’s little theorem, and Euler’s theorem. Applications include calendars, checksums, public-key cryptography, and fast computation.