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

prove: if gcd(m1, m2) =1 then x=a (mod m1m2) iff x=a(mod m1) and x=a(mod m2)

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!