WOLFRAM|DEMONSTRATIONS PROJECT

Seeing the Chinese Remainder Theorem

​
modulus
m
1
4
5
6
7
8
9
10
modulus
m
2
6
7
8
9
11
12
13
14
16
17
18
19
21
remainder
r
1
0
1
2
3
4
remainder
r
2
0
1
2
3
4
5
6
7
8
9
10
Given the remainders
r
1
and
r
2
when a number
x
is divided by relatively prime moduli
m
1
and
m
2
, the Chinese remainder theorem can be used to find the result of
x
mod
m
1
m
2
. Use the controls to select
r
1
,
r
2
,
m
1
, and
m
2
. The darkest square contains the solution, where the two sets of differently colored bands intersect.