The GCF in simple words
A factor is a number that divides another number exactly, with nothing left over. 3 is a factor of 12 because 12 ÷ 3 = 4.
The greatest common factor (GCF) is the biggest number that is a factor of all your numbers. It is also called the greatest common divisor (GCD) or highest common factor (HCF).
Example: the factors of 12 are 1, 2, 3, 4, 6 and 12. The factors of 18 are 1, 2, 3, 6, 9 and 18. The numbers in both lists are 1, 2, 3 and 6. The biggest is 6, so the GCF of 12 and 18 is 6.
The GCF helps you make fractions simpler. Divide the top and bottom of 12/18 by 6 and you get 2/3.
Euclid’s algorithm and shared prime factors
The greatest common factor (GCF), greatest common divisor (GCD), and highest common factor (HCF) name the same value. Euclid’s algorithm repeatedly replaces a pair with its divisor and remainder until the remainder is zero. The final non-zero divisor is the GCF.
For more than two inputs, find the GCF of the first pair and combine that result with each remaining input. In prime factorization, the same answer comes from keeping only shared primes, each at its lowest exponent.
Example: reducing 48 : 180
180 = 3 × 48 + 36; 48 = 1 × 36 + 12; 36 = 3 × 12 + 0. The GCF is 12. Dividing both terms by 12 reduces 48 : 180 to 4 : 15. The common positive factors are 1, 2, 3, 4, 6 and 12.
Input conventions
This page accepts 2–100 non-zero integers, each within ±10¹², and uses their absolute values. Negative signs do not change the positive GCF. Decimals and invalid tokens are rejected rather than omitted.
The optional LCM is reported only when it fits safe integer precision. That limit does not prevent a valid GCF from being shown.