How gcd calculator works
The greatest common divisor (GCD), also called the greatest common factor (GCF) or highest common factor (HCF), is the largest positive integer that divides all the given numbers without a remainder. For example, the GCD of 24 and 36 is 12, because 12 is the largest number that divides both.
This calculator uses the Euclidean algorithm, which repeatedly divides the larger number by the smaller and takes the remainder until the remainder is zero. The last non-zero remainder is the GCD. For multiple numbers, it reduces them pairwise.
Enter two or more integers (comma-separated). The calculator finds the GCD of all of them. Only integers are accepted; decimal numbers are rejected.