GCD and LCM: When to Simplify and When to Find a Common Denominator

The Greatest Common Divisor (GCD) of two numbers is the largest positive integer that divides both without a remainder. For example, GCD(12, 18) = 6, because 6 divides both 12 (result: 2) and 18 (result: 3), and no number larger than 6 has that property.

The GCD always appears when we want to divide things into equal groups with nothing left over. If you have 12 oranges and 18 bananas and want to make boxes with the same quantity of each fruit — no mixing, no leftovers — the maximum number of boxes is GCD(12, 18) = 6. Each box will contain 2 oranges and 3 bananas.

In mathematics, the GCD is essential for simplifying fractions. To reduce 18/24 to its simplest form, calculate GCD(18, 24) = 6. Divide numerator and denominator by 6: 18/6 = 3 and 24/6 = 4. The simplified fraction is 3/4. This process guarantees the irreducible form, where numerator and denominator share no factor other than 1.

The prime factorisation method decomposes each number into a product of prime factors and takes the common factors with the lowest exponent. For GCD(60, 84): 60 = 2² × 3 × 5 and 84 = 2² × 3 × 7. The common primes are 2² and 3. Therefore GCD(60, 84) = 4 × 3 = 12.

The Euclidean algorithm is more efficient for large numbers. It relies on the property that GCD(a, b) = GCD(b, remainder of a ÷ b). Apply it repeatedly until the remainder is zero: GCD(252, 105) → 252 = 2 × 105 + 42 → GCD(105, 42) → 105 = 2 × 42 + 21 → GCD(42, 21) → 42 = 2 × 21 + 0. When the remainder is zero, the last divisor is the GCD: GCD(252, 105) = 21.

For three or more numbers, calculate the GCD two at a time. GCD(a, b, c) = GCD(GCD(a, b), c). For example, GCD(12, 18, 30): GCD(12, 18) = 6; GCD(6, 30) = 6. Therefore GCD(12, 18, 30) = 6.

The Least Common Multiple (LCM) of two numbers is the smallest positive integer that is a multiple of both. LCM(4, 6) = 12, because 12 is the smallest number that appears in both the multiplication table of 4 (4, 8, 12, 16…) and the table of 6 (6, 12, 18…) at the same time.

The LCM is fundamental for adding or subtracting fractions with different denominators. To calculate 1/4 + 1/6, we need a common denominator. LCM(4, 6) = 12 is the smallest possible: 1/4 = 3/12 and 1/6 = 2/12. So 1/4 + 1/6 = 3/12 + 2/12 = 5/12. Using the LCM avoids working with unnecessarily large numbers.

In practical situations, the LCM solves synchronisation problems. If one bus comes every 8 minutes and another every 12 minutes, when will they next depart together? LCM(8, 12) = 24 minutes. This works for any repeating cycle: work shifts, metronome beats, electrical frequencies.

Using prime factorisation, the LCM is calculated by taking all primes present in any of the numbers, with the highest exponent. For LCM(60, 84): 60 = 2² × 3 × 5 and 84 = 2² × 3 × 7. The primes involved are 2, 3, 5 and 7. LCM(60, 84) = 2² × 3 × 5 × 7 = 4 × 3 × 5 × 7 = 420.

There is a direct formula using the GCD: LCM(a, b) = (a × b) ÷ GCD(a, b). For LCM(12, 18): GCD(12, 18) = 6. So LCM = (12 × 18) ÷ 6 = 216 ÷ 6 = 36. This relationship explains why GCD and LCM are complementary concepts.

To find the LCM of three or more numbers, use simultaneous decomposition: write all numbers side by side and divide by common primes, then by individual ones. LCM(4, 6, 9): divide by 2 (4→2, 6→3, 9→9), by 2 again (2→1, 3→3, 9→9), by 3 (1→1, 3→1, 9→3), by 3 again (1→1, 1→1, 3→1). LCM = 2 × 2 × 3 × 3 = 36.

The practical rule is: use the GCD when you want to divide or separate, and the LCM when you want to combine or synchronise. Dividing a sheet of paper into equal parts with none left over? GCD. Finding the moment when two cycles coincide again? LCM.

For fractions: GCD simplifies (reduces the fraction) and LCM creates the common denominator for addition and subtraction. To simplify 36/48, use GCD(36, 48) = 12: the simplified fraction is 3/4. To add 5/6 + 3/8, use LCM(6, 8) = 24: 5/6 = 20/24 and 3/8 = 9/24, sum = 29/24.

In resource-sharing problems, the GCD answers 'what is the largest equal group possible'. In periodic-meeting problems, the LCM answers 'when do they coincide again'. Identifying which question is being asked is the most important skill when solving these problems.