Greatest common divisor
largest divisor of two integers or polynomials From Wikipedia, the free encyclopedia
The greatest common divisor (gcd) or highest common factor (HCF) of two integers x and y, usually written as , is the greatest (largest) number that divides both of the integers evenly.[1][2] GCDs are useful in simplifying fractions to the lowest terms.[3] Euclid came up with the idea of GCDs.
The GCD of any two positive integers can be defined as a recursive function:
In fact, this is the basis of Euclidean algorithm, which uses repeated long division in order to find the greatest common factor of two numbers.
The GCD of 20 and 12 is 4, since 4 times 5 equals 20 and 4 times 3 equals 12. And since 3 and 5 have no common factor, their GCD is 1.
As another example, the GCD of 81 and 21 is 3.
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
