gcd can be written as a linear combination?
We now present a theorem which proves that the greatest common divisor of two integers can be written as a linear combination of the two integers. [thm9] The greatest common divisor of two integers a and b, not both 0 is the least positive integer such that ma+nb=d for some integers m and n.