Question

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.

Answer 1

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?

Answer 2

is this the whole proof? or is there more

Answer 3

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

Answer 4

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

Answer 5

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

Answer 6

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