Ask your own question, for FREE!
Mathematics 6 Online
OpenStudy (anonymous):

"Let n1, n2,...nr be a positive integers such that gcd(ni, nj)=1 for i not equal to j. Then the system of linear congruences; x= a1 (mod n1) x=a2 (mod n2) . . x=ar (mod nr) has a simultaneous solution, which is unique modulo the integer n1n2...nr" help please . verify what the theorem implies. . please. .

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!