System of

Linear
Congruences
 Theorem 6.1
The Chinese Remainder Theorem
The linear system of congruence x Ξ α1 (mod m1 ),
Where the moduli are pairwise relatively prime and
1 ≤ i ≤ k, has a unique solution modulo m1m2…mk.
 Proof:

Let M = m1m2…mk and Mi = M/mi, 1 ≤ i ≤ k.

Since the moduli are pairwise relatively prime, (M i,
mi) = 1 for every i. Also, Mi Ξ 0 (mod mj) whenever
i ≠ j.
 Since (Mi, mi) = 1, by Corollary 4.6, the
congruence Miyi Ξ 1 (mod mi) has a unique
solution yi.

Let x= α1M1y1 + α2M2y2 + …+ αkMkyk.

Let
Example:

Find a number that leaves a remainder of

1
when divided by 3, a remainder of 2 when
divided by 5, and a remainder of 3 when divided
by 7.