Introduction

Welcome to the final lesson of Finding the Lowest Common Multiple! Over the previous four lessons, we built a complete toolkit: we generated common multiples, identified the LCM by listing, computed it through prime factorisation, and applied it to real-world word problems. Now it is time for the capstone skill that ties this course — and the broader learning path — together. In this lesson, we answer the question learners encounter most often in practice: "Does this problem need the HCF or the LCM?" By the end, you will be able to look at any word problem involving two or more numbers, decide which tool fits, explain why, and carry out the calculation with confidence.

Two Tools, One Pair of Numbers

You may recall from earlier in the learning path that the Highest Common Factor (HCF) and the Lowest Common Multiple (LCM) both operate on the same set of numbers, yet they answer very different questions. The HCF asks: "What is the largest number that divides evenly into all of the given values?" The LCM asks: "What is the smallest number that all of the given values divide into?"

Here is a quick side-by-side look using 1212 and 1818:

  • HCF(12,18)=6\text{HCF}(12, 18) = 6 — because 66 is the greatest number that fits evenly into both.
Dividing Down vs. Building Up

A helpful way to remember the difference is to think about direction. The HCF divides down: we start with the quantities we have and look for the biggest piece that fits inside all of them. The LCM builds up: we start with the quantities we have and look for the smallest total that contains each of them as a factor.

This leads to two distinct families of real-world problems:

DirectionOperationTypical situationCore question
Dividing downHCFEqual grouping, fair sharing, cutting into largest equal pieces"What is the biggest equal part?"
Building upLCMCoinciding cycles, aligning schedules, matching pack sizes"When or where do these first line up?"

If a problem asks us to split or partition quantities into the largest possible equal groups, we reach for the HCF. If it asks us to find the earliest point where repeating events or group sizes meet, we reach for the LCM.

Visual metaphor showing HCF as splitting a block into equal pieces versus LCM as building up rows of blocks until they align
Worked Example: An HCF Problem

A florist has 3636 red roses and 4848 white roses. She wants to make identical bouquets using all the flowers, with no roses left over. What is the greatest number of bouquets she can make?

Step 1 — Analyse the structure. We are dividing two fixed totals into equal groups that are as large as possible. Nothing is being repeated or built up; we are splitting down. This is an equal-grouping problem, so we need the HCF.

Step 2 — Calculate.

36=22×32,48=24×336 = 2^2 \times 3^2, \quad 48 = 2^4 \times 3
Worked Example: An LCM Problem

Two neon signs flash outside a shop. Sign A flashes every 3636 seconds and Sign B flashes every 4848 seconds. They just flashed at the same moment. How many seconds until they next flash together?

Step 1 — Analyse the structure. Two events repeat on fixed cycles, and we want the earliest moment they coincide again. This is a coinciding-cycles problem, so we need the LCM.

Step 2 — Calculate.

36=22×32,48=24×336 = 2^2 \times 3^2, \quad 48 = 2^4 \times 3
Signal Words and Structural Clues

When reading a word problem, certain phrases tend to signal one operation over the other. The table below collects the most common clues side by side so you can compare them at a glance.

HCF cluesLCM clues
Typical phrases"largest equal pieces," "greatest number of groups," "maximum size of each share""first time both," "how often do they coincide," "smallest number that works for all"
Problem setupStarts with fixed totals and asks us to divide them as evenly and largely as possibleInvolves repeating intervals or group sizes and asks when or where they first align
Key giveawayNothing is left over after the splitWe are looking for the smallest common target, not breaking things apart

A good habit before solving any problem is to pause and ask yourself: "Am I splitting existing quantities into equal parts, or am I finding where repeating cycles meet?" Answering that one question almost always points you to the right tool.

A Quick Decision Checklist

To bring everything together, here is a simple three-step process you can follow whenever you face a word problem involving two or more numbers:

  1. Read and restate the question in your own words. What exactly is being asked for?
  2. Classify the structure. Are we dividing down into equal parts (HCF) or building up to a shared target (LCM)?
  3. Justify, then calculate. State which operation you chose and why before doing the arithmetic. This keeps your reasoning transparent and helps catch mistakes early.
Flowchart showing the three-step decision process: restate, classify into HCF or LCM, then justify and calculate

Following this checklist turns a potentially confusing decision into a routine one. With practice, the classify step becomes almost instant — and the justify step ensures you can always explain your reasoning to someone else.

Conclusion and Next Steps

In this lesson, we learned how to tell HCF and LCM problems apart by focusing on the structure of the question rather than the numbers involved. Problems that ask us to split quantities into the largest equal groups call for the HCF, while problems about coinciding cycles or the smallest shared amount call for the LCM. We also put together a reliable three-step checklist — restate, classify, then justify before calculating — that works for any problem you will encounter.

Now it is time to put this decision-making skill to the test! In the upcoming practice tasks, you will sort problems into HCF or LCM categories, fill in reasoning for partially worked solutions, and tackle full workplace scenarios on your own. This is your chance to show that you can not only compute HCF and LCM but also choose the right one every time — let's finish the course strong!

Sign up
Join the 1M+ learners on CodeSignal
Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal