Find the Greatest Common Divisor (GCD), also known as the Highest Common Factor (HCF), of two or more whole numbers.
The Greatest Common Divisor is the largest positive whole number that divides all the given numbers without leaving a remainder.
Instead of listing every factor, the calculator uses the Euclidean algorithm. It repeatedly divides and uses the remainder until the remainder becomes zero.
If the GCD of a set of numbers is 1, those numbers are collectively coprime.
