implementing the extended Euclidean algorithm
Hi, everyone!
I am implementing an extended Euclidean algorithm for first order indefinite equations.
I know how when there're just 2 variables but what if there're 3 or more?
1 Reply
would the greatest common divisor be:
gcd(x_n-1, gcd(x_n-2, gcd(..., gcd(x_1, x_0)))?
For example, the gcd of a, b, c is just gcd(gcd(a,b), c)?