Adjust the inputs below. Results update as you type.
GCF (also called GCD) is the largest integer that divides all given numbers with no remainder. Euclidean algorithm: GCF(a,b) = GCF(b, a mod b) until remainder = 0. Example: GCF(48,18) → GCF(18,12) → GCF(12,6) → GCF(6,0) = 6. Used to simplify fractions (divide numerator and denominator by GCF) and solve word problems involving equal groups.
GCF / GCD
12