Examples based on Chinese Remainder Theorem
Steps to solve the system of congruences : Step 1: Take the congruence with the largest modulus x a n (mod m n ) then rearrange it as, x=m n k+a n where k is an integer. Step 2: Substitute x into the 2 nd largest modulus m n k+a n a n-1 (mod m n-1 ) then solve the congruence k h (mod m n - 1 ). Step 3: Rewrite the congruence as k= m n-1 d+h and substitute it in x. Step 4: Substitute the solve equation of x in the next largest modulus then solve the congruence. Step 5: Repeat the above steps until the solution arrives.