Seeing the Chinese Remainder Theorem
Seeing the Chinese Remainder Theorem
Given the remainders and when a number is divided by relatively prime moduli and , the Chinese remainder theorem can be used to find the result of mod . Use the controls to select , , , and . The darkest square contains the solution, where the two sets of differently colored bands intersect.
r
1
r
2
x
m
1
m
2
x
m
1
m
2
r
1
r
2
m
1
m
2