Prove that the greatest common divisor of the integers a and b is the same as the greatest common divisor of the integers a-b and b.

Question

asnaseer · Answer

lets call the GCD of a and b d.
that would imply that we can write them as:$$a=pd$$$$b=qd$$where p and q are some other integers. agreed?

anonymous · Answer

is this the whole proof? or is there more

asnaseer · Answer

I just stated the first part and asked you if you agreed with the initial reasoning.

anonymous · Answer

yes i agreed can you finish the proof? i need more clarification

asnaseer · Answer

so, if you agree with that, then try and express a-b in terms of pd and qd. what do you get?

anonymous · Answer

I'm still learning this proof class and i don't understand how to start it let alone finish the proof