Euclidean Algorithm

The Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor of two integers, the largest number that divides both of them with no remainder, by repeatedly replacing the larger number with the remainder of dividing it by the smaller until a remainder of zero is reached. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements, around 300 BC, making it among the oldest algorithms still in common use today. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/