Abstract Algebra | 3. The Euclidean Algorithm

In this video, we give an algorithm to compute greatest common divisors called the Euclidean Algorithm. We prove why the algorithm works and then use it in some examples. We also use the steps in the Euclidean Algorithm to express the gcd of two integers a and b as an integer linear combination of a and b.