Using the Euclidean Algorithm to solve gcd(a,b) = ax + by.

Working through an example to write the greatest common divisor of two integers as a linear combination of those two integers.