Will any divisor of both $a,b>0$ also divide $\gcd(a,b)$?
Anyone have a proof of this if it is true, or counter in case of false? thanks,
Will any divisor of both $a,b>0$ also divide $\gcd(a,b)$?
Anyone have a proof of this if it is true, or counter in case of false? thanks,
Because the greatest common divisor of two integers is a linear combination of them. See the link kindly provided below.