The greatest common divisor (GCD) of two or more integers is the largest positive integer that divides each of them without remainder. Also called the greatest common factor (GCF) or highest common factor (HCF).
Abbreviated from 'greatest common divisor,' with 'divisor' from Latin 'divisor' meaning 'one who divides.' The concept was formalized by Euclid around 300 BCE with his algorithm for finding the GCD.
The Euclidean algorithm for finding GCD is one of the oldest algorithms still in use today, over 2300 years old! It's remarkable that this ancient method is now implemented in computer processors and forms the foundation of modern cryptographic systems.
Complete word intelligence in one call. Free tier — 50 lookups/day.