For example, the Euclidean algorithm for gcd(36,22) is given below on the left, while the reversal of the steps is shown on the right. Numbers marked in this color are replaced in the following line by expressions marked in this color.

Euclidean Algorithm for gcd(36,22)		Reversal
36 = 22 * 1 + 14 22 = 14 * 1 + 8 14 = 8 * 1 + 6 8 = 6 * 1 + 2 6 = 2 * 3 + 0		2 = 8 − 1*6 2 = 8 − 1*(14 − 1*8)   = (−1)*14 + 2*8 2 = (−1)*14 + 2*(22 − 1*14)   = 2*22 + (−3)*14 2 = 2*22 + (−3)*(36 − 1*22)   = (−3)*36 + 5*22