Seeing the Chinese Remainder Theorem
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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.
Contributed by: Sreenath Are (September 2013)
Open content licensed under CC BY-NC-SA
Snapshots
Details
In the first snapshot, and .
Reference
[1] Wikipedia. "Chinese Remainder Theorem." (Aug 23, 2013) en.wikipedia.org/wiki/Chinese_remainder_theorem.
Permanent Citation