Euclidean algorithm

Frae Wikipedia
Lowp tae: navigation, rake

In mathematics, the Euclidean algorithm[a], or Euclid's algorithm, is a method for computin the greatest common divisor (GCD) o twa (uisually positive) integers, an aa kent as the greatest common factor (GCF) or heichest common factor (HCF).