Proof: Let n = n1 x n2 x… x n k. Let us define mi = n/ni for i = 1, 2, …,k. Thus m i = n 1 x n 2 x… x n i-1 xni+1 x… x n k . We now define ci = m i (mi-1 mod n i ) for i = 1, 2, …,k. We know mi-1 mod n i exists since gcd(mi , ni ) = 1. Finally we define :
x ≡ (a 1 c 1 + a2 c2 + … + a k c k ) (mod n )
To prove that x satisfies every congruence we argue as follows. We know that
cj≡ mj ≡ 0 (mod ni) for j ≠ i and ci ≡ 1 (mod ni) otherwise. Thus
x ≡ a i c i (mod ni)
≡ a i m i (mi-1 mod ni) (mod ni)
≡ ai (mod ni)
For all i = 1, 2, …,k. ![]()
Problem 2: Find all solutions to the equations x ≡ 4 (mod 5) and x ≡ 5 (mod 11).
Solution: a1 = 4, n1= m2 = 5, a2 = 5 and n2 = m1= 11. n = 55.
We know 11-1 ≡ 1 (mod 5) and 5-1 ≡ 9 (mod
11). Thus we have:
c1 = 11 ( 1 mod 5 ) = 11 and c 2 = 5 ( 9 mod 11 ) = 45
Thus x = 4 x 11 + 5 x 45 (mod 55) = 44 + 225 (mod 55) = 269 (mod 55) = 49 (mod 55).
So the general solution to the given system of congruence is 49 + 55k where
k is an arbitrary integer.![]()