A variation of Euclid's algorithm that finds the GCD of two integers and also determines the coefficients of Bezout's identity.
A variation of Euclid's algorithm that finds the GCD of two integers and also determines the coefficients of Bezout's identity.