You already know how to compute HCF.
The new challenge is modelling:
In this section, we work through three textbook examples that test this modelling skill:
The computation is straightforward — the hard part is the translation from words to mathematics.
Let's look at a classic real-world problem that involves HCF.
Two milk tankers contain 504 litres and 735 litres of milk respectively.
You need to find the maximum capacity of a container that can measure the milk from either tanker an exact number of times — with no milk left over in either case.
Let me show you how to model this problem. Modeling is essentially translating the words of the problem into a mathematical plan.
What does 'measure the milk an exact number of times' mean?
In word problems, this phrase is a very important clue. It tells us something specific about the relationship between the measuring container and the tanker.
Think of it like using a measuring cup to empty a big bucket—we want it to be a perfect fit without any leftover liquid.
It means the container fills up completely, is emptied into something, fills up again, is emptied again, ... and at the end, the tanker is completely emptygoal.
Key takeaway: In mathematical terms, 'exact number of times' means there is zero remainder.
Let's turn the milk measurement into a mathematical plan. If our container has a capacity of litres and we are emptying a tanker with litres, here is how the remaining volume changes:
For a measurement to be exact, the tanker must be emptied completely with zero remainder. Mathematically, this means:
This shows that is perfectly divisible by .
We have two tankers to consider. The same logic we used for the first tanker applies to the second one containing litres.
Since a single container must work for both tankers, we can conclude: is a common factor of both and .
To save time and be most efficient, we need the MAXIMUM possible capacity for our container .
In mathematics, the largest number that divides two or more numbers exactly is the Highest Common Factor (HCF).
Isn't it amazing how a real-world problem like "measuring milk" boils down to finding a simple HCF?
To find the HCF, let's first break down 504 into its prime building blocks using the factor tree or division method:
Writing with exponents:
We have three 2s, two 3s, and one 7.
Next, we perform the prime factorisation for 735:
To find the HCF, we identify the prime numbers that appear in both lists and select the lowest power for each:
Note: Even though 2 and 5 are factors, they are not common to both numbers.
By multiplying these common factors with their lowest powers, we find the maximum capacity required:
HCF answer
The maximum capacity of the container is 21 litres.
This 21-litre container is the largest size that can measure the milk in both tankers an exact number of times.
We calculated the HCF as 21. In the context of our problem, this represents the maximum capacity of the container.
Note: Using this size ensures there is no milk left over and no partial fillings required. It is "just right!"
To see the HCF in action, let's look at how many times the -litre container is used for each tanker:
To ensure you get full marks in your exam:
This one uses slightly different language — instead of saying 'divide equally,' it talks about 'same number of columns.'
But the underlying structure is the same as what you've seen before.
Let's see if you can crack it!
An army contingent of 612 members is to march behind a band of 48 members in a parade.
What is the maximum number of columns in which they can march?
Solve completely:
Let's visualize the "same number of columns" requirement:
To march together, the width (number of columns) must be identical for both groups.
Let represent the number of columns.
Key Constraint: Since we cannot have a fraction of a person! To have full rows, must be a factor of (it must divide perfectly).
Applying the same logic to the band:
Since must divide both numbers, is a common factor of and . Because the problem asks for the maximum number of columns possible, we need to find the largest such value:
Maximum columns = answer
To find the maximum number of columns in which both groups can march, we need to calculate the Highest Common Factor (HCF) of 612 and 48.
Let's break down 612 into its prime building blocks:
Prime Factorisation:
Now, let's look at the band members. We divide 48 by 2 repeatedly until we are left with a single 3:
Prime Factorisation:
To ensure the result divides into both numbers, we follow this rule:
Rule: For HCF, take the lowest power of each common prime factor.
Calculation:
Result: The maximum number of columns is 12.
We found that the . In the context of the parade, this represents the maximum number of columns both groups can march in while remaining perfectly aligned.
Formation Breakdown:
The Result: Because is a common factor, both groups finish with a whole number of rows, creating a perfect rectangular formation for the parade.
It can be tempting to use LCM in word problems, but let's see why it doesn't work here:
Does "2448 columns" make sense? No. You cannot arrange band members into columns! You can never have more columns than the total number of people.