In this video I show how to run the extended Euclidean algorithm to calculate a GCD and also find the integer values guaranteed to exist by Bezout's theorem.