gcd(a,b) computed by repeated division: gcd(a,b) = gcd(b, a mod b), terminating at gcd(x,0) = x. Basis of Bezout's identity and of modular inverse computation.
gcd(a,b) computed by repeated division: gcd(a,b) = gcd(b, a mod b), terminating at gcd(x,0) = x. Basis of Bezout's identity and of modular inverse computation.