Chinese Remainder
Solve systems of congruences x ≡ r (mod m); moduli need not be coprime.
About this tool
Solve a system of congruences x ≡ ri (mod mi). Moduli need not be pairwise coprime; inconsistent systems are reported.
One pair per line: residue and modulus (e.g. 2 3 means x ≡ 2 (mod 3)).