Modular Arithmetic · Difficulty 5/10 · ~40 min
Modular Arithmetic
- Compute with congruences fluently
- Find cycles in powers mod n
- Solve linear congruences
Modular arithmetic is clock arithmetic made rigorous: only the remainder matters. It turns questions about astronomically large numbers — the units digit of , the remainder of — into small, cyclic, finite computations. It is the engine room of contest number theory.