🧩
Every composite number can be broken down into prime factors — and there is only ONE way to do it (ignoring the order)!
🍕
🌟 Think of it this way
Every pizza order (composite number) is made of specific toppings (prime factors). No matter who assembles the pizza, the same toppings always appear — you can’t secretly swap mushrooms for olives. That’s the FTA: the prime “ingredients” of any number are always unique!
🔢
…can be written as a product of prime numbers. No exceptions!
🔒
The set of prime factors is always the same — only the order might differ.
🌳
Break the number into branches until every branch ends in a prime number.
🌳
A factor tree splits a number into two factors at each step, until every branch is a prime number (circle them!). Let’s see three examples.
2
30
2
15
3
5
60 = 2² × 3 × 5
Primes: 2, 2, 3, 5
2
18
2
9
3
3
36 = 2² × 3²
Primes: 2, 2, 3, 3
2
24
2
12
2
6
2
3
48 = 2⁴ × 3
Primes: 2, 2, 2, 2, 3
Purple circles = prime numbers (can’t be split further). Keep splitting the blue circles until ALL branches are prime. Once every branch is prime, collect them all — that’s your prime factorisation!
🔗
Once you have prime factorisations, finding HCF and LCM becomes a simple comparison of powers!
Rule: Take the smallest power of each common prime factor.
Rule: Take the largest power of all prime factors that appear.
HCF (a, b) × LCM (a, b) = a × b
This works for ANY two positive integers! Use it to check your answers.
12 = 2² × 3¹
18 = 2¹ × 3²
HCF = 2¹ × 3¹ = 2 × 3 = 6
LCM = 2² × 3² = 4 × 9 = 36
6 × 36 = 216 ✓ | 12 × 18 = 216 ✓ Match!
Common to all three: 2
Smallest power of 2: 2²
HCF = 4
Largest 2: 2³ = 8
Largest 3: 3¹ = 3
LCM = 8 × 3 = 24
A number ends in 0 if and only if it is divisible by 10 = 2 × 5. So we need to check whether 4ⁿ has 5 as a prime factor.
The FTA guarantees no “hidden” prime factors exist — if 5 doesn’t appear in the factorisation, 4ⁿ is not divisible by 5.
∞
Numbers that cannot be written as a fraction p/q (where p, q are integers, q ≠ 0) — they go on forever without repeating!
Can be written as p/q where q ≠ 0
Cannot be written as p/q — decimals never terminate or repeat!
We use a technique called Proof by Contradiction: assume the opposite of what we want to prove, show it leads to an impossible situation, so our assumption must be wrong!
Then √2 = a/b, where a and b are integers with no common factor (coprime), and b ≠ 0.
2 = a²/b² → a² = 2b²
So 2 divides a². By the Key Tool, 2 also divides a. Write a = 2c.
(2c)² = 2b² → 4c² = 2b² → b² = 2c²
So 2 divides b². By the Key Tool, 2 also divides b.
Both a and b are divisible by 2. But we said a and b have NO common factors. This is impossible!
Same technique — assume √3 = a/b (coprime, b ≠ 0).
Strategy: Assume it IS rational, then rearrange to show √3 must be rational — which we already know is false!
🧠
Quick reminders to recall when you’re in the exam hall.
🌳
Split until all branches are primes. Primes cannot be split further — they are the “atoms” of numbers.
🔵
Highest but smallest powers! Take only COMMON primes with their smallest exponents.
🟢
Lowest but largest powers! Take ALL primes with their largest exponents.
⭐
For TWO numbers: HCF × LCM = product of the numbers. Use this to verify!
💥
Assume the OPPOSITE → find a contradiction → conclude original statement is TRUE.
🔑
If prime p divides a², then p divides a. This is the engine behind all irrational proofs!
📝
Try these yourself first, then check the solutions!
✅ Verify: HCF × LCM = 13 × 182 = 2366
26 × 91 = 2366 ✓
✅ Verify: 6 × 3024 = 18144
336 × 54 = 18144 ✓
Sonia takes 18 minutes and Ravi takes 12 minutes to complete one round. They start together. After how many minutes will they meet again at the starting point?
LCM = 2² × 3² = 4 × 9 = 36
They meet again after 36 minutes ✓
Can you get all 5 right? 🏆
📋
Everything you need to know at a glance!
| Concept | Key Rule | Example |
|---|---|---|
| FTA | Every composite = unique product of primes | 60 = 2² × 3 × 5 |
| HCF | Smallest power of COMMON primes | HCF(12,18) = 6 |
| LCM | Largest power of ALL primes | LCM(12,18) = 36 |
| Golden Rule | HCF × LCM = a × b (two numbers only) | 6 × 36 = 216 = 12×18 ✓ |
| Irrational | Cannot write as p/q; non-terminating, non-repeating | √2, √3, √5, π |
| Key Theorem | If prime p divides a², then p divides a | 2|a² → 2|a |
| Proof method | Proof by contradiction — assume opposite, find impossibility | Used to prove √2, √3 irrational |
The Golden Rule HCF × LCM = a × b works only for TWO numbers. For three or more numbers, you cannot use this shortcut — you must find HCF and LCM separately using prime factorisation.
🔢 Real Numbers · Grade 10 Mathematics · Chapter 1
Made with ❤️ to make maths easy and fun for every student!