Extended Euclidean Algorithm Calculator

Find the GCD of two integers and Bezout coefficients x, y such that a*x + b*y = gcd(a, b).
Shows each division step of the Extended Euclidean Algorithm.