Welcome! Today we're tackling LCM from Prime Factorisations: The Highest-Power Rule — the perfect companion to what you just learned about HCF.
You just learned that HCF uses the intersection of primes at minimum powers.
LCM is the other side of the coin — it uses the union of primes at maximum powers.
⚠️ Getting these two mixed up is the single most common error in this topic — and it costs full marks.
| Rule | Primes | Powers |
|---|---|---|
| HCF | Intersection (common only) | Minimum |
| LCM | Union (all primes) | Maximum |
By the end of this section, you'll be able to:
🔍 Quick Check
You just learned that HCF uses the intersection of primes at minimum powers.
Now let's see if you can figure out how LCM works — it's the other side of the coin.
The biggest conceptual difference between HCF and LCM is which primes get included.
Here's what we know:
You already computed HCF = 18 using only the shared primes (2 and 3).
Now you need to compute LCM.
For LCM(504, 990), which primes should be included?
Explain why.
LCM means the Least Common Multiple — the smallest number that both 504 and 990 divide into evenly.
In other words, LCM is the smallest number that has both 504 and 990 as factors.
If a number is divisible by both 504 and 990, it must be a multiple of their LCM.
For 504 to divide into the LCM, the LCM must contain at least all the prime factors of 504. Since , the LCM needs at least min, at least min, and at least min.
For 990 to divide into the LCM, the LCM must contain at least all the prime factors of 990. Since , the LCM needs at least , at least , at least min, and at least min.
Putting these together: the LCM needs 2, 3, 5, 7, and 11 — every prime from either number.
The LCM Rule: Include ALL primes that appear in EITHER factorisation — not just the shared ones.
This is the key contrast with HCF:
You know to include all primes when finding the LCM. Now — what power of each prime should you use?
| Primes to include | Power to use | |
|---|---|---|
| HCF | Intersection (shared primes only) | Minimum power |
| LCM | Union (all primes from either) | Maximum power |
Let's see why the maximum power rule makes sense.
Here's the situation:
For , you need to include the prime .
The LCM must be divisible by both and .
Think about this 🤔
Should the LCM include or ?
And — what goes wrong if you pick the smaller power?
The LCM must be a multiple of both 504 and 990. Let's see what that demands for the prime 2.
For 504 to divide the LCM, the LCM needs at least (three factors of 2)3 twos.
For 990 to divide the LCM, the LCM needs at least (one factor of 2).
The stricter requirement is (from 504).
If you only used , the LCM would have too few 2s for 504 to divide it. would leave a remainder.
So you take the maximum: .
Use .
The same logic applies to every prime: the number with the bigger power sets the requirement, and the LCM must meet that requirement.
The maximum power is always sufficient and always necessary.
You understand both principles:
Let's compute the full LCM and make the contrast with HCF crystal clear — keeping these rules straight under pressure is what earns marks.
Given Information:
You already computed:
Your Task 📝
Compute .
Then:
Let's compute LCM(504, 990) step by step.
First, list all primes from either factorisation: 2, 3, 5, 7, 11.
Remember:
Take the highest power of each prime:
LCM = =
LCM
The clean contrast:
Sanity checks:
If your HCF came out bigger than the smaller number, or your LCM came out smaller than the bigger number, you swapped the rules.
You've seen how HCF uses the intersection of primes at minimum powers. Now let's look at the other side of the coin.
There's a beautiful relationship that connects:
It serves as both a verification tool and a shortcut for finding missing values.
The Product Property states:
For any two positive integers and :
Given Information:
For the numbers 504 and 990:
| Property | Value |
|---|---|
| HCF | 18 |
| LCM | 27,720 |
Your Task 🧮
Verify the product property for 504 and 990.
Then explain in one or two sentences WHY this works — what happens to the exponents of each prime when you multiply HCF and LCM?
Let's verify: . And . They match! ✓verified
But why does this ALWAYS work? Look at what happens prime by prime.
For each prime , if its powers in and are and :
When you multiply:
And that's exactly — the contribution from key result!
Take prime 2. In 504 it has exponent 3. In 990 it has exponent 1.
Same thing!
For any prime, . This is a basic algebra fact.
Think about it: if you have two numbers, the smaller one plus the larger one is just... their sum! No matter which is which.
So for every prime, the exponent in HCF × LCM equals the exponent in .
Since all exponents match for every prime, the products must be equal.
This property is incredibly useful:
⚠️ One critical warning: this property works ONLY for exactly two numbers.
For three or more numbers, HCF × LCM does NOTWRONG! equal the product.
Always use prime factorisations directly when dealing with three or more numbers.