Show that if a,b,c are integers; c>0; and
a [congruent] b(mod m), then gcd(a,c) = gcd(b,c)

Show that if a,b,c are integers; c>0; and
a [congruent] b(mod m), then gcd(a,c) = gcd(b,c)

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Heres what I was thinking ...

and its a = b (mod c) .. typoed it

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.