GCF and LCM Guide: Greatest Common Factor and Least Common Multiple

GCF and LCM sound like abstract classroom terms, but they answer very concrete questions: what's the largest square tile that evenly covers a floor, or when will two events that repeat on different schedules land on the same day again. Both come from the same underlying idea, the prime factors that numbers share or don't share.

What GCF Actually Means

The greatest common factor (GCF) of two numbers is the largest number that divides both evenly. For 24 and 36, the factors of 24 are 1, 2, 3, 4, 6, 8, 12, 24, and the factors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36. The largest number appearing in both lists is 12, so GCF(24, 36) = 12. This method works fine for small numbers but becomes impractical for larger ones, which is where prime factorization and the Euclidean algorithm come in.

Finding GCF by Prime Factorization

Break each number into prime factors, then multiply the shared primes at their lowest shared power. For 48 and 180: 48 = 2^4 x 3, and 180 = 2^2 x 3^2 x 5. The shared primes are 2 and 3. Take the lower power of each: 2^2 and 3^1. GCF = 2^2 x 3 = 4 x 3 = 12.

The Euclidean Algorithm: Faster for Big Numbers

For larger numbers, repeated division is much quicker than factoring. The Euclidean algorithm says GCF(a, b) = GCF(b, a mod b), repeated until the remainder is 0. For GCF(1071, 462): 1071 mod 462 = 147 (since 462 x 2 = 924, and 1071 - 924 = 147). Next, GCF(462, 147): 462 mod 147 = 21 (147 x 3 = 441, remainder 21). Next, GCF(147, 21): 147 mod 21 = 0. Once the remainder hits 0, the last nonzero remainder, 21, is the GCF. This took three steps instead of factoring two four-digit numbers by hand.

What LCM Actually Means

The least common multiple (LCM) is the smallest number that both numbers divide into evenly. For 4 and 6, multiples of 4 are 4, 8, 12, 16, 20, 24, and multiples of 6 are 6, 12, 18, 24. The smallest shared value is 12, so LCM(4, 6) = 12.

The Fast Way: LCM From GCF

Once you have the GCF, there's a shortcut formula: LCM(a, b) = (a x b) / GCF(a, b). For 24 and 36, we already found GCF = 12, so LCM = (24 x 36) / 12 = 864 / 12 = 72. This is almost always faster than listing multiples, especially for larger numbers where listing multiples by hand would take a while.

Where This Shows Up Outside a Classroom

GCF is exactly what you need to simplify fractions: to reduce 42/56, find GCF(42, 56) = 14, then divide both by 14 to get 3/4. It's also the tool for a tiling problem: if you have a rectangular space 84 inches by 60 inches and want the largest possible square tiles with no cutting, the tile size is GCF(84, 60) = 12 inches. LCM answers scheduling questions: if one delivery truck arrives every 4 days and another every 6 days, they'll both arrive on the same day every LCM(4, 6) = 12 days.

Three or More Numbers at Once

Both operations extend to more than two numbers by applying the pairwise method repeatedly. For GCF(12, 18, 30): first GCF(12, 18) = 6, then GCF(6, 30) = 6, so the answer is 6. For LCM(4, 6, 10): LCM(4, 6) = 12, then LCM(12, 10) = 60, so LCM(4, 6, 10) = 60. Chaining the pairwise calculation works because both GCF and LCM are associative operations.

Skip the Manual Factoring

Finding GCF and LCM by hand for numbers with several digits is where mistakes creep in, especially with the Euclidean algorithm's repeated division steps. The GCF and LCM calculator on this site handles two or more numbers instantly and shows the working, so you can check homework, simplify fractions, or solve a scheduling problem without redoing long division by hand.