You already know what HCF means:
The Highest Common Factor of two numbers is the largest number that divides both.
In CL-02, you found HCF using Euclid's Division Algorithm — repeated division without factorisation.
Now you will learn a second method that reads the HCF directly from the prime factorisations.
| Method | Approach |
|---|---|
| Previous | Repeated Division |
| Current | Prime Factorisation |
The rule is elegant:
Take the common primes with the lowest exponents.
In this section, you will:
The first step in finding HCF by prime factorisation is identifying which primes the two numbers share.
Common Mistake: Students often include primes that appear in only one number.
Let's make sure you can sort primes into two categories:
Here are two numbers that have been factorised:
Your turn 🤔
List all the prime factors of and all the prime factors of .
Let me show you how to identify common primes.
A 'common prime' is a prime that appears in BOTH factorisations — not just one.
Let's check each prime systematically to see if they meet our definition of a 'common prime'.
Prime 2:
Prime 3:
Prime 7:
Prime 13:
So the common primes are 2 and 3. The non-common primes are 7 (only in 126) and 13 (only in 156).
For HCF, we will only use the common primes. Non-common primes are excluded because the HCF must divide both numbers — and a prime absent from one number cannot divide that number.
You know which primes are common between two numbers. The next step is the exponent rule:
Watch out! This is where students most often make errors—especially by accidentally using the highest exponent (which gives LCM, not HCF).
Here's what we have:
The common primes are 2 and 3.
| Common Prime | Exponent in | Exponent in |
|---|---|---|
| 2 | ||
| 3 |
We are tracking the exponents for each shared prime factor to prepare for the exponent rule.
Using the common primes and the HCF rule (lowest exponents), compute:
HCF(126, 156)
The HCF rule says: for each common prime, take the LOWEST (smallest) exponent.
Let's apply this to our common primes:
Prime 2:
Prime 3:
HCF =
So, the Highest Common Factor of and is .
Because the HCF must divide BOTH numbers.
If we took instead of , the HCF would contain as a factor. But only has one factor of (). So does not divide . The HCF would be wrong.
Similarly, if we took instead of , the HCF would contain as a factor.
But only has one factor of (). So does not divide .
The lowest exponent is the safe choice — it guarantees the HCF divides both numbers.
Now that we've calculated the HCF as , let's verify it actually works. Remember, an HCF must divide both numbers perfectly.
Quick check: Does 6 divide 126?
Yes! ✓
Does 6 divide 156?
Yes! ✓
Correct! Since 6 divides both numbers perfectly, we have successfully found the HCF.
You've learned the pieces — now it's time to combine them:
This is the complete skill as tested on the board exam.
Find HCF(612, 1314) using the prime factorisation method.
Show your complete working:
Let me walk through the complete procedure for HCF(612, 1314).
Step 1: Factorise 612.
612 is even: . 306 is even: .
153 is odd. Digit sum: , divisible by 3. . 51: digit sum , divisible by 3. . 17 is prime. Done.
Combining everything together, we get:
Verify: . ✓ Correct.
1314 is even:
657 is odd. Digit sum: , which is divisible by 3.
219: digit sum , divisible by 3.
73 is prime (not divisible by 2, 3, 5, 7; and , so we only need to check up to 8).
So, the complete factorisation is:
Verify: . ✓ Correct.
612: prime factors are 2, 3, 17.
1314: prime factors are 2, 3, 73.
Common Primes: 2 (in both) and 3 (in both).
Step 4: Apply lowest exponents.
For 2: exponents are 2 (in 612) and 1 (in 1314). Min = 1.
For 3: exponents are 2 (in 612) and 2 (in 1314). Min = 2.
Note: when both exponents are equal (like in both), the min is that same value.
Verify: (exact). (exact). Both divide evenly. ✓ Correct.
⚠️ Common pitfall: Don't stop too early!
When factorising large numbers, it is very easy to mistake certain numbers for prime numbers and stop your work there.
The Truth about 51 and 219:
Both of these can be further broken down into smaller prime factors.
If you stopped your factorisation at or , the exponential form would be wrong and the HCF would be incorrect.
Being able to execute the procedure is important, but understanding WHY it works prevents errors under pressure.
If you forget whether to use lowest or highest exponents, you can reason it out from the definition of HCF.
Let me show you a student's work and see if you can spot what went wrong.
A student computes HCF(36, 48) as follows:
The student writes:
The student calculated:
Let me show you how to spot and fix this error.
Red flag #1: The 'HCF' is bigger than both numbers.
. But the HCF must DIVIDE both numbers. Can divide ? No — is bigger than .
A number cannot be divided by something bigger than itself (with a whole-number result). So cannot possibly be a factor of , let alone a common factor of both.
Red flag #2: Direct check fails.
Not a whole number. So is not a factor of at all.
The error: The student used the HIGHEST exponents ( and ) instead of the LOWEST.
Using the highest exponents gives a number that is TOO BIG to divide both original numbers.
Let's apply the rule properly for the numbers 36 and 48.
First, we look at their prime factorisations:
For HCF, use LOWEST exponents of common primes:
Both divisions are exact. Also, notice that and . This makes perfect sense!
The conceptual key: The HCF must FIT INTO both numbers.
A big number cannot fit into a small number. So the HCF must be small — which is why we take the LOWEST exponents.
The LCM, on the other hand, must be big enough for both numbers to fit into it — which is why LCM uses HIGHEST exponents.