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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

In the first snapshot, 54≡4 (mod 10) and 54≡3 (mod 17).
Reference
[1] Wikipedia. "Chinese Remainder Theorem." (Aug 23, 2013) en.wikipedia.org/wiki/Chinese_remainder_theorem.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.