Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
If a ≡ b (mod n1) and a ≡ b (mod n2), must it be true that a ≡ b (mod n1n2)? What if gcd(n1, n2) = 1? In each case either give a proof or counterexample.

If a ≡ b (mod n1) and a ≡ b (mod n2), must it be true that a ≡ b (mod n1n2)? What if gcd(n1, n2) = 1? In each case either give a proof or counterexample.

Elements Of Modern Algebra
Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 3TFE: Label each of the following statements as either true or false. a2b2(modn) and implies ab(modn) or...
See similar textbooks
icon
Related questions
Question

If a ≡ b (mod n1) and a ≡ b (mod n2), must it be true that a ≡ b (mod n1n2)? What if gcd(n1, n2) = 1? In each case either give a proof or counterexample.

Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer