Let a,b is an element of Z. prove that for all x is an element of Z we have gdc(a,b)= gcd(a,b-xa)

- Nov 3rd 2012, 03:00 PMAkinii tried working this question and i reached to a certain point. i really need help
Let a,b is an element of Z. prove that for all x is an element of Z we have gdc(a,b)= gcd(a,b-xa)

- Nov 3rd 2012, 03:01 PMAkiniRe: i tried working this question and i reached to a certain point. i really need hel
i meant gcd**

- Nov 4th 2012, 02:42 PMemakarovRe: i tried working this question and i reached to a certain point. i really need hel
The pairs (a, b) and (a, b - xa) have not only the same greatest common divisor, but the same set of common divisors.