Chinese remainder theorem ```Name: hasinoff Status: N/A Age: N/A Location: N/A Country: N/A Date: Around 1995 ``` Question: What is the Chinese remainder theorem as it applies to solving equations involving the modulus operator? Replies: Any introductory text on number theory should have this. I quote from Elementary Introduction to Number Theory by C. T. Long, D. C. Heath & Co., 1965. "The Chinese Remainder Theorem: if (Mi,Mj) = 1 for i != j, then the system x == C1 (mod M1), x == C2 (mod M2), . . . , x == Cr (mod Mr) is solvable and the solution is unique modulo M where M = M1 * M2 * ... * Mr. . . . Such problems were studied in antiquity, particularly by ancient Chinese mathematicians, so the solution to the problem is called the Chinese remainder theorem. (above: I have used == for "is congruent to" and ! = for "not equal to") hawley Click here to return to the Mathematics Archives

NEWTON is an electronic community for Science, Math, and Computer Science K-12 Educators, sponsored and operated by Argonne National Laboratory's Educational Programs, Andrew Skipor, Ph.D., Head of Educational Programs.

For assistance with NEWTON contact a System Operator (help@newton.dep.anl.gov), or at Argonne's Educational Programs