Algorithms Euclid GCD:Subtract, Then Mod, Then Extended Coefficients Replace repeated subtraction with remainder, then back-substitute for Bézout coefficients — gcd, lcm, and a modular inverse when gcd is 1. Read More →