HCF / GCD Calculator

Compute the Highest Common Factor (HCF) or Greatest Common Divisor (GCD) of two or more numbers.

\text{GCD}(a, b) = \text{GCD}(b, a \bmod b) \text{ (Euclidean Algorithm)}

Result

Step-by-Step Calculation & Explanation

The Greatest Common Divisor (GCD), also called the Highest Common Factor (HCF), is the largest positive integer that divides each of the integers. The Euclidean algorithm is a highly efficient method for computing the GCD of two numbers by repeatedly dividing the larger number by the smaller one and taking the remainder.