Chinese Remainder Theorem Calculator
Enter the remainders and the moduli, each separated by commas.
The remainders a, separated by commas.
The moduli m, separated by commas, each 2 or more.
Try
Result
You entered
Show the work
Compatibility of two congruences
Both congruences force to leave the same remainder mod , which is impossible unless divides .
Using
Result
No solution (the congruences contradict each other mod 2)