Chinese remainder theorem. Apply the same and find X for the given set of congruent equations using CRT. a) X = 1(mod 5) X = 2(mod 7) X = 3(mod 9) X = 4(mod 11

Chinese Reminder Theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime.

For example: …