Adjust the inputs below. Results update as you type.
A factor of n divides n with no remainder. Common factors of a set of numbers are factors shared by all of them. The GCF (also called GCD) is the largest. Efficient computation uses the Euclidean algorithm: GCF(a,b) = GCF(b, a mod b), recursing until remainder = 0. GCF is used to simplify fractions and find common denominators.
GCF / GCD
12