Seeing the Chinese Remainder Theorem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send