Greatest common divisor
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. GCDs are useful in simplifying fractions to the lowest terms. Euclid came up with the idea of GCDs.