Show that if a, b, and m are integers such that m >= 2 and a is congruent to b mod m then GCD(a, m) = GCD(b, m)
Follow Math Help Forum on Facebook and Google+
Recall the definition of GCD: iff (i) and and (ii) and Now, for some Let (i) and and (ii) Suppose and Then So and (i) and (ii)
View Tag Cloud