Euclidean algorithm
Jump to navigation
Jump to search
 | The "Scots" that wis uised in this airticle wis written bi a body that haesna a guid grip on the leid. Please mak this airticle mair better gin ye can. (Dizember 2020) |
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, kent as the greatest common factor (GCF) or heichest common factor (HCF) an aw.
| This airticle is a stub. Ye can help Wikipaedia bi expandin it. |