Extended Euclidean Algorithm

Revisiting An Old Friend

The steps for deriving gcd(1180, 482) = 2, and its linear combination of a*x + b*y = gcd, where it presents itself as (1180*-29) + (482*71) = 2.

The left hand side is the Euclidean Algorithm, and the right hand side (where the linear combination is derived) is the Extended Euclidean Algorithm.