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.