Introduction to the Euclidean Algorithm

A detailed tutorial on the Euclidean algorithm. Step by step tutorial including several examples of the Euclidean algorithm for reference.

The Euclidean algorithm, sometimes referred to as Euclid’s algorithm, is the most efficient way of determining the greatest common factor of two numbers. The greatest common factor of two numbers is the largest number that divides them both evenly. The Euclidean algorithm is used in a series of steps – it follows a pattern that helps to find numbers and their factors with accuracy.