Thread: GCD divisibility problem

Back again haha. Thanks for all the great help.

I have to prove that, for a positive integer n and any integer a, gcd(a, a+n) divides n; hence gcd(a, a+1)=1.

Not even sure where to begin.

Originally Posted by glowplug19

Back again haha. Thanks for all the great help.

I have to prove that, for a positive integer n and any integer a, gcd(a, a+n) divides n; hence gcd(a, a+1)=1.

Not even sure where to begin.

Hi glowplug19.

divides both and hence it divides