Suppose that are two integers with gcd(m, n) = 1. When I saw the question before, I read this as gcd(a,b)=1. Presumably that what is meant?
Prove that there exist integers
such that
Originally Posted by Chandru1
I am not getting it. I can only think of the group Z/bZ ....
As an illustration, here's what happens when a=5 and b=7. The equation has the solution m=6, and the equation has the solution n=4. Then the number will be congruent to 1 (mod 5) and also (mod 7), and therefore also (mod 35).