GCD as Linear Combination Finder

Enter two numbers (separated by a space) in the text box below.

When you click the "Apply" button, the calculations necessary to find the greatest common divisor (GCD) of these two numbers as a linear combination of the same, by using the Euclidean Algorithm and "back substitution", will be shown below.

That is to say, for a given $a$ and $b$, integer values of $x$ and $y$ will be found so that $\displaystyle{gcd(a,b) = x \cdot a + y \cdot b}$