GCF and LCM Guide 2026: Methods, Examples and Uses

Prime Factorization Method

Numbers: 48 = 2^4 x 3; 180 = 2^2 x 3^2 x 5.

• GCF: Take lowest powers of shared primes: 2^2 x 3 = 12.
• LCM: Take highest powers of all primes: 2^4 x 3^2 x 5 = 720.

Check: 12 x 720 = 8,640 = 48 x 180. Correct.

The prime-factorization method scales to any number of inputs. For 48 = 2^4 x 3, 180 = 2^2 x 3^2 x 5, 240 = 2^4 x 3 x 5: GCF takes lowest powers of shared primes, 2^2 x 3 = 12; LCM takes highest powers of all primes, 2^4 x 3^2 x 5 = 720. Lowest-for-GCF, highest-for-LCM - one rule, three numbers or thirty.

Fraction reduction gets a shortcut: when the denominator is a multiple of the numerator, the GCF is the numerator itself. 240/720 reduces by GCF(240, 720) = 240 straight to 1/3. Checking divisibility first - does the top divide the bottom? - skips the factorization entirely on the easy cases.

The Euclidean algorithm also unlocks modular inverses, the backbone of RSA encryption: find x such that 7x ≡ 1 (mod 40). Since GCF(7,40) = 1, an inverse exists — extended Euclid gives x = 23, because 7 × 23 = 161 = 4 × 40 + 1. Every HTTPS connection you make runs this exact arithmetic to exchange keys. GCF isn't just classroom math; it's the reason your bank login is secure.

Euclidean Algorithm (GCF)

Divide and take remainders until zero:

GCF(48, 180): 180 / 48 = 3 remainder 36. 48 / 36 = 1 remainder 12. 36 / 12 = 3 remainder 0. GCF = 12.

Fast even for huge numbers - this 2,300-year-old algorithm is still how computers do it.

Euclid's algorithm shrugs at large numbers. GCF(1071, 462): 1071 = 2 x 462 + 147; 462 = 3 x 147 + 21; 147 = 7 x 21 + 0, so the GCF is 21. Three divisions solved what prime factorization would have made tedious. The remainders shrink fast - the algorithm runs in logarithmic time, which is why it is still unbeaten after 2,300 years.

The logic is one line: any common divisor of (a, b) also divides the remainder r = a - qb, so GCF(a,b) = GCF(b,r), with strictly smaller numbers each step. Calculators and computer algebra systems reduce fractions with Euclid, not factor trees - the "simplify" button on your calculator is running this ancient algorithm.

LCM Shortcut

LCM(48, 180): (48 x 180) / 12 = 8,640 / 12 = 720.

Scheduling: Bus A every 12 min, Bus B every 18 min, both leave at 8:00. Together again at LCM(12,18) = 36 min: 8:36.

Three-number LCMs chain the two-number formula. LCM(4, 6, 8): first LCM(4,6) = 24/2 = 12, then LCM(12,8) = 96/4 = 24. Pair them left to right - no prime factorization needed. The chaining works for any count, which is how scheduling software finds common cycles across many repeating events.

Multi-fraction addition needs one shared denominator. For 1/4 + 1/6 + 1/8: LCM(4,6,8) = 24, giving 6/24 + 4/24 + 3/24 = 13/24. The LCM is the smallest denominator that keeps every numerator an integer - any common multiple works, but the least one keeps the arithmetic smallest.

Everyday Uses

• Fractions: 5/12 + 7/18: LCM(12,18) = 36. 15/36 + 14/36 = 29/36.
• Simplifying: 48/180: divide by GCF 12 = 4/15.
• Gears: Two gears with 12 and 18 teeth realign every LCM = 36 rotations of the small... precisely every 36 tooth-passings.
• Baking: Scaling recipes to common pan sizes.

Floor tiling is a GCF problem in disguise. A 48-by-72-inch floor tiled with the largest possible square tiles and no cuts: GCF(48,72) = 24-inch tiles, needing 2 x 3 = 6 tiles total. GCF maximizes the tile size; using the LCM here would answer a question nobody asked. Match the tool to the goal: biggest fitting piece is always GCF.

Coinciding schedules are pure LCM. A dentist visit every 6 months and car service every 4 months, both done today, coincide again in LCM(6,4) = 12 months. Traffic-light cycles, machine maintenance windows, and planetary alignments ("when do they line up again") all reduce to least common multiples.

Frequently Asked Questions