Chinese Remainder Theorem
When solving a linear congruence with a large moduli it is sometimes useful to reduce the linear congruence to a system of linear congruences with smaller moduli.
Proposition (Chinese Remainder Theorem) Suppose
...,
are pairwise relatively prime positive integers. Then the system of congruences
has a unique solution modulo
![]()
Proof. Let
We know that
for
because
whenever
Therefore, for each
there are integers
and
such that
and using these
we can construct a solution to the system as
![]()
To verify this is a solution, check the
congruence equation, namely,
![]()
If
is a solution to the system of congruences, then
Hence,
for each
and since no two of the
have a common factor,
that is
Thus,
Example (Chinese Remainder Theorem) Solve the linear system of congruences
Solution. Since
and
we find integers
and
such that
We find
and
since
Therefore, we use
![]()
![]()
Therefore,
is the solution to the systems of congruence equations.
Example (Chinese Remainder Theorem) Solve the linear system of congruences
Solution. We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_44.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_44.gif)
So the solution is
Example (Chinese Remainder Theorem) Solve the linear system of congruences
Solution. We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_49.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_49.gif)
So the solution is
Example (Chinese Remainder Theorem) Solve the linear system of congruences
Solution. We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_54.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_54.gif)
So the solution is
Example (Chinese Remainder Theorem) Solve the linear system of congruences
Solution. We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_59.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_59.gif)
So the solution is
Proposition (Chinese Remainder Theorem) Suppose
...,
are relatively prime positive integers and that
for each
Then the system of congruences
has a unique solution modulo
![]()
Proof. Since
for each
we know that each congruence in the system has a solution, we first choose integers
such that
Let
and since no two of the
have a common factor, we see that
Thus there is integer
such that
We now show that the number
defined by
is a solution of the original system of congruences. First note that
divides each
when
Thus for each
we have,
![]()
Hence,
is s solution of each congruence.
If
is a solution to the system of congruences, then
Hence,
for each
and since no two of the
have a common factor,
that is
Thus,
Example (Chinese Remainder Theorem) Solve the linear systems of congruences
Solution. We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_97.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_97.gif)
The solution is
Linear Congruence Reduction. Let
be the unique factorization of
Then the linear congruence
has the same set of solutions as the system of simultaneous congruences
![chinese remainder theorem _gr_103.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_103.gif)
As consequence of the fundamental theorem of arithmetic,
if and only if
for each
This follows easily since, for some integer
![]()
for each
Hence,
if and only if all of the congruences
![chinese remainder theorem _gr_111.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_111.gif)
also hold. It follows that
![]()
has the same set of solutions as the system of simultaneous congruences
.
Example (Chinese Remainder Theorem) Solve the linear congruence
![]()
Solution. Since
this congruence may be replaced by the system
![chinese remainder theorem _gr_117.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_117.gif)
We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_119.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_119.gif)
The solution is
Example (Linear Congruence Reduction) Solve the congruence
Solution. Since
this congruence may be replaced by the system
![chinese remainder theorem _gr_124.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_124.gif)
We find
and we use a table to construct the solution.
![chinese remainder theorem _gr_126.gif]](pages/chinese-remainder-theorem/Images/chinese-remainder-theorem_gr_126.gif)
The solution is
Chinese Remainder Theorem
Published by Library of Math -- Online math organized by subject into topics.
Written by Smith, David A.
http://www.libraryofmath.com/chinese-remainder-theorem.html


