Example

Enter two positive integers in the two slots of the first row below. The extended Euclidean algorithm determines a linear combination of these two integers that equals the gcd.

At each step we record the numbers x and y as the pair x[i]=(x,y) and q as q[i] that occur in Step 2 of the algorithm.