UCLA Olga Radko Endowed Math Circle

11/17/2019 -- Intermediate 2B: The Euclidean Algorithm

The Euclidean Algorithm is a way to find the greatest common divisor of two numbers. Using what we've learned in algebra in the past weeks, we will investigate how this method works.