The Extended Euclidean Algorithm to Find GCD

In this video, I will explain the extended euclidean algorithm to find the GCD of two positive numbers. The GCD is the greatest common divisor. This is the extension of the Euclidean Algorithm because it involves a formula GCD(a,b) = ax + by where after you find the gcd, you have to find Bezout's coefficients such that the equation is satisfied. The extended Euclidean Algorithm has lots of applications in science and engineering. Students typically learn this in Discrete Math classes.