Algebraic Number Theory, Lesson 7: The Euclidean Algorithm

In this seventh video of my series on algebraic number theory, I describe the Euclidean algorithm, which can be applied to arbitrary Euclidean domains, such as the ring of Gaussian integers, to compute the greatest common divisor (GCD) of any two elements of the ring, and finish with a simple example in which I compute the GCD of two given Gaussian integers.