You now know how to find HCF using common primes with lowest exponents.
LCM is the complement: ALL primes with HIGHEST exponents.
Notice the symmetry in the questions we ask:
| Concept | The Core Question |
|---|---|
| HCF | What is the largest number that fits into both? |
| LCM | What is the smallest number that both fit into? |
The prime factorisation method makes this symmetry visible.
In this section, you will:
You now know how to find HCF using common primes with lowest exponents.
LCM is the complement:
| Concept | The Key Question |
|---|---|
| HCF | What is the largest number that fits into both? |
| LCM | What is the smallest number that both fit into? |
These two questions have symmetric answers, and the prime factorisation method makes this symmetry visible.
The most common error in this cluster is confusing the HCF and LCM rules. Before computing LCM, let's make sure you can clearly distinguish the two rules and explain why they differ.
You have learned two rules:
State the two key differences between the HCF and LCM rules.
For each difference, explain WHY the rules differ.
Hint: Think about what HCF and LCM must satisfy.
Let me explain the two rules side by side and WHY they differ.
To understand the logic, we have to look at what each one is trying to achieve. One looks for what is shared, and the other looks for the total combination.
HCF rule: Common primes, lowest exponents.
LCM rule: All primes, highest exponents.
HCF uses only COMMON primes.
Why? Because the HCF must DIVIDE both numbers.
If a prime (say ) is absent from one number (say ), then the HCF cannot contain — otherwise it would not divide .
LCM uses ALL primes.
Why? Because both numbers must DIVIDE the LCM.
If a prime (say ) appears in one number (say ), then the LCM must contain — otherwise would not divide the LCM.
HCF uses LOWEST exponents.
Why? The HCF must divide both numbers. If one number has and the other has , the HCF can have at most . Taking would mean the HCF does not divide the first number.
LCM uses HIGHEST exponents.
Why? Both numbers must divide the LCM. If one number has and the other has , the LCM must have at least . Taking only would mean the second number does not divide the LCM.
Memory aid for HCF:
Memory aid for LCM:
Remember the key steps for finding the LCM:
To find the LCM, we need to include every prime factor at its maximum power.
List all distinct primes, show the exponent comparison, and compute the final answer.
For LCM, you need ALL primes from both numbers — not just the common ones.
Let me show the systematic approach:
→ primes: {2, 3, 7}
→ primes: {2, 3, 13}
Combine: {2, 3, 7, 13} — four distinct primes total.
Now that we have our master list of primes (2, 3, 7, and 13), we need to decide how many of each to include. To ensure the LCM is large enough for both numbers to divide into it, we apply our second golden rule: Always pick the highest exponent for every prime.
Let's look at the full comparison table for our two numbers:
| Prime | In 126 | In 156 | Max Exponent |
|---|---|---|---|
| 2 | 1 | 2 | 2 |
| 3 | 2 | 1 | 2 |
| 7 | 1 | 0 | 1 |
| 13 | 0 | 1 | 1 |
Note: When a prime is absent from a number (like 7 is missing from 156), its exponent is effectively 0. Since the maximum of 1 and 0 is 1, we still include that prime in our LCM.
Step 3: Multiply.
Does 126 divide 3276?
Result: Yes, it divides exactly!
Now, let's check the second number:
Does 156 divide 3276?
Conclusion: Both exact. ✓ Correct.
If you had missed the non-common primes (7 and 13) and computed only , check: does 126 divide 36?
No (). The LCM must be both numbers.
You've been working with HCF and LCM using prime factorisation. Now here's something really useful:
For any two numbers and , there's a beautiful relationship:
This gives you a way to check both answers at once. If the product doesn't match, at least one of your answers is wrong.
For the numbers 612 and 1314, a student has computed:
Verify these answers using the product property:
Show the computation on both sides.
The product property says: for any two positive integers and ,
This is a powerful verification tool. Let me show you how to use it.
To make this big multiplication easier, we can use the distributive property to break it down into parts.
Break it down:
Final Result:
Now, let's calculate the product of our original two numbers:
Break it down:
Both sides = 804168. Match! ✓
This confirms that HCF = 18 and LCM = 44676 are both correct.
Then at least one of your answers is wrong — go back and check your factorisations and your min/max choices.
Important caveat: This property works for TWO numbers only.
For three or more numbers, does NOT equal the product of the numbers.
Since the product rule doesn't work, you verify three-number problems using the definitions themselves:
We're going to factorise two numbers, find their HCF, find their LCM, and verify our answers.
This is the full exam procedure — exactly what you'll need to do in your assessments.
Find and
Show all your working:
Factorise 504:
The Result:
Check: ✓
Now, let's apply the same logic to our second number, 540.
Since 135 is odd, we move to the next prime: 3.
The Prime Factorisation of 540:
Check: ✓
Now that we have the prime factorisations for both numbers, let's put them side-by-side to find our HCF and LCM.
Comparison table:
| Prime | 504 | 540 | Min (HCF) | Max (LCM) |
|---|---|---|---|---|
| 2 | 3 | 2 | 2 | 3 |
| 3 | 2 | 3 | 2 | 3 |
| 5 | 0 | 1 | — | 1 |
| 7 | 1 | 0 | — | 1 |
To find the HCF, we only look at the common primes and take their lowest (minimum) exponents.
HCF: Common primes are 2 and 3 (both present).
LCM: All primes: 2, 3, 5, 7.
Verification:
Match! ✓ Both answers confirmed.
Notice the pattern in how we picked our primes:
Now, look at the results we got:
This makes sense because the HCF is a factor (it divides into them), while the LCM is a multiple (they divide into it).
Finally, always remember this powerful rule for any two numbers and :
This property is your best friend for verifying your work or finding one value if you know the other three.