Euclidean Algorithm Explained in One Minute

A clear and concise explanation of the Euclidean Algorithm for finding the greatest common divisor (GCD) in just one minute.