Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Chinese Remainder Theorem"

(merge back into one article, remove non-wikified and plain nonsensical content)
(theorem)
Line 26: Line 26:
  
 
[[Category:Number theory]]
 
[[Category:Number theory]]
 +
[[Category:Theorems]]

Revision as of 16:00, 25 December 2007

The Chinese Remainder Theorem is a number theoretic result.

History

When the ancient Chinese army was at its peak, it was said that the emperor developed a way to count the soldiers. Rather than count his hordes one man at a time, he developed a system. He would have his soldiers divide into groups of 3, and count the men who didn't have a group. He would then do groups of 5, etc. Eventually, using these remainders, he could calculate the size of his army using a technique we now call the Chinese Remainder Theorem.

Proof

If $a \equiv b \pmod{mn}$, then $a$ and $b$ clearly differ by a multiple of $mn$, so $a \equiv b \pmod{m}$ and $a \equiv b \pmod{n}$. This is the first part of the theorem. The converse follows because $a$ and $b$ must differ by a multiple of $m$ and $n$, and $\mbox{lcm}(m,n) = mn$. This is the second part of the theorem.

Applicability

Much like the Fundamental Theorem of Arithmetic, many people seem to take this theorem for granted before they consciously turn their attention to it. It ubiquity derives from the fact that many results can be easily proven mod (a power of a prime), and can then be generalized to mod $m$ using the Chinese Remainder Theorem. For intance, Fermat's Little Theorem may be generalized to the Fermat-Euler Theorem in this manner. Its application in problem-solving is similar.


General Case: the proof of the general case follows by repeatedly applying to above result (k-1) times.

Extended version of the theorem

Suppose one tried to divide a group of objects into $2$, $3$ and $4$ parts instead and found $1$, $1$ and $2$ fish left over, respectively. One can show this to be impossible, because any number giving remainder $1$ modulo $2$ must be odd and any number giving remainder $2$ modulo $4$ must be even. Thus, the number of objects must be odd and even simultaneously, which is absurd. Thus, there must be some restrictions on the numbers $a_1,\dots,a_n$ to ensure that at least one solution exists. It turns out (and this is the extended version of the theorem) that

The solution exists if and only if $a_i\equiv a_j\mod \gcd(m_i,m_j)$ for all $i,j$ where $\gcd$ stands for the greatest common divisor. Moreover, in the case when the problem is solvable, any two solutions differ by some common multiple of $m_1,\ldots,m_n$.


Discussion

  • Here is an AoPS thread in which the Chinese Remainder Theorem is discussed and implemented.
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Chinese_Remainder_Theorem&oldid=21598"