Chinese Remainder Theorem

x ≡ r₁ (mod m₁) and x ≡ r₂ (mod m₂). The clock faces sweep — the unique solution mod m₁·m₂ lights up whenever both hands align. CRT guarantees a unique solution when gcd(m₁,m₂)=1.