LCM and GCD in the Real World: Schedules, Gears, and Tiling a Floor
October 21, 2026
The greatest common divisor (GCD) of two numbers is the largest number that divides both. The least common multiple (LCM) is the smallest number that both divide into evenly. They are linked by a simple identity: GCD × LCM = the product of the two numbers. These concepts, taught as dry arithmetic exercises, solve practical questions about repeating events, dividing things into equal groups, and fitting shapes together.
Rule of thumb: when events repeat and you want to know when they coincide, use the LCM. When you want to split things into the largest possible equal pieces, use the GCD.
Skip the math and get your answer instantly:
Open the Fraction Calculator →Scheduling: LCM
Two buses leave a station on different routes, one every 12 minutes and the other every 18 minutes. If they leave together at 8:00, when do they next leave together? The answer is the LCM of 12 and 18. Prime factorization: 12 = 2² × 3 and 18 = 2 × 3². Take the highest power of each prime: 2² × 3² = 36. They leave together again after 36 minutes, at 8:36.
Another example: three lights flash every 4, 6, and 10 seconds. The LCM of 4, 6, and 10 is 60, so they flash together every minute. Maintenance tasks on 7-day, 30-day, and 90-day cycles coincide every 630 days (LCM of 7, 30, and 90).
| Cycle lengths | LCM | Meaning |
|---|---|---|
| 12 and 18 minutes | 36 minutes | Buses leave together every 36 minutes |
| 4, 6, and 10 seconds | 60 seconds | Lights flash together each minute |
| 7, 30, and 90 days | 630 days | Tasks line up every 630 days |
| 8 and 12 teeth (gears) | 24 teeth | Gears return to starting position after 24 teeth pass |
Tiling and Packing: GCD
You want to tile a 24 by 36 inch floor with identical squares and no cutting. The largest square that fits is the GCD of 24 and 36, which is 12 inches. Using Euclid's algorithm: 36 = 1 × 24 + 12; 24 = 2 × 12 + 0, so the GCD is 12. You need (24 ÷ 12) × (36 ÷ 12) = 2 × 3 = 6 tiles. If you wanted 6-inch tiles, you would need 24; 12 is the largest size that divides both dimensions.
Similarly, you can divide 48 apples and 36 oranges into identical gift baskets with no leftovers. The greatest number of baskets is GCD(48, 36) = 12, each with 4 apples and 3 oranges.
Gears and Rotating Parts
When two meshed gears with 8 and 12 teeth turn, the teeth that meet repeat after the LCM of 8 and 12, which is 24 teeth. The smaller gear makes 3 full rotations and the larger gear makes 2 before the same pair of teeth meet again. Designers prefer tooth counts with a GCD of 1, so the teeth wear evenly: gears with 8 and 13 teeth have an LCM of 104, so each tooth on one meets every tooth on the other before the pattern repeats.
Fractions and Common Denominators
The LCM of the denominators gives the least common denominator for adding fractions. To add 5/12 + 7/18, the LCM of 12 and 18 is 36: 15/36 + 14/36 = 29/36. The GCD simplifies fractions: 24/36 reduces by 12 to 2/3. These are among the most common uses of these ideas in school and everyday math.
Finding Them Quickly
For small numbers, list multiples or factors. For larger ones, use prime factorization (LCM takes the highest powers, GCD the lowest) or the Euclidean algorithm for GCD, then compute LCM = (a × b) ÷ GCD. For 84 and 126: GCD is 42, LCM is 84 × 126 ÷ 42 = 252.
Frequently Asked Questions
What is the LCM used for?
Finding when repeating events coincide and finding common denominators for fractions.
What is the GCD used for?
Simplifying fractions and splitting things into the largest equal groups or squares.
How are GCD and LCM related?
For two numbers a and b, GCD × LCM = a × b.
What is the LCM of 12 and 18?
36.
How do I find the GCD of large numbers?
Use the Euclidean algorithm: repeatedly divide and take remainders until the remainder is zero.