Real Numbers
Real numbers are the rationals and the irrationals together. This chapter takes what you already know about numbers and makes two things precise: that every composite number breaks into primes in exactly one way, and that some numbers cannot be written as fractions at all.
What CBSE examines here (2026-27). Only two things: the Fundamental Theorem of Arithmetic (and the HCF/LCM work that rests on it), and proofs of irrationality for √2, √3 and √5. Euclid's division lemma and decimal expansions of rationals are no longer part of this chapter — see the appendix at the end if you want them as background.
Unit I (Number Systems) carries 6 marks in the 80-mark paper, and Real Numbers is the whole unit.
1. The Fundamental Theorem of Arithmetic
Every composite number can be written as a product of primes, and that factorisation is unique apart from the order in which you write the primes.
The second half is the part that does the work. Uniqueness is what lets you argue about a number by arguing about its primes — if a prime is not in the factorisation, it is not a factor, and no amount of rewriting will produce it.
HCF and LCM from the primes
Once both numbers are factorised:
- HCF — take each prime the two numbers share, at the lowest power present.
- LCM — take every prime that appears in either, at the highest power present.
The reason is worth holding on to. The HCF has to divide both numbers, so it can only use what both actually have. The LCM has to be divisible by both, so it must carry enough of every prime to cover the greedier of the two.
Worked example — 96 and 404.
The only shared prime is 2, and the lower power is :
Check: , and . ✓
The identity — and its one restriction
This holds for two numbers only. For three it fails, and examiners like that trap: for 12, 15 and 21 the HCF is 3 and the LCM is 420, so , while . With three numbers, go through the primes.
Worked example — given HCF(306, 657) = 9, find the LCM.
Using uniqueness to rule things out
Can ever end in 0? To end in 0 a number must be divisible by , so it needs a factor of 5. But , which contains only 2s and 3s. Because prime factorisation is unique, there is no hidden 5 anywhere. So never ends in 0 — for any .
Notice this argument settles all at once. Checking 6, 36 and 216 would only show it has not happened yet.
Why is composite? Take out the common 13: it equals . Displaying one factor other than 1 and itself is all "composite" requires — you never need the full factorisation.
2. Irrational Numbers
A number is irrational if it cannot be written as with integers and .
The proof that is irrational
Every proof in this section is the same argument with a different number, so learn the shape once.
Suppose where and are integers with no common factor — cancel first if they have one. Then , so 5 divides .
Here is the step that needs the Fundamental Theorem: since 5 is prime, if it divides it must appear in the factorisation of itself. So write . Substituting, , that is — and by the same reasoning 5 divides .
Now 5 divides both and , contradicting the "no common factor" we arranged at the start. The only assumption made was that is rational, so that is what is false.
The identical argument proves , , or for any prime .
Building on it
Once is known irrational, numbers like do not need the argument again. Assume , then rearrange until the surd is alone:
The right side is one integer over another, so it is rational — which contradicts what we just proved. Any expression of the form (rational) + (non-zero rational) × falls the same way.
Key results to memorise
- Every composite number has a unique prime factorisation.
- HCF = common primes at lowest powers; LCM = all primes at highest powers.
- — two numbers only.
- If a prime divides , then divides . (This is the engine of every irrationality proof.)
Practice (try before checking)
- Find the HCF and LCM of 196 and 38220 by prime factorisation.
- Show that is irrational.
- The HCF of two numbers is 27 and their LCM is 162. One number is 54 — find the other.
- Find the smallest number that leaves remainder 5 when divided by 12, 15 and 18.
- Explain why is composite.
Answers
- and . Common at lowest powers: , so HCF = 196 (196 divides 38220). LCM .
- Suppose is rational. Then , a rational number — contradicting the irrationality of .
- .
- LCM(12, 15, 18): , , , so LCM . Required number .
- Both terms are divisible by 5, so it equals — a product of two factors greater than 1.
Common mistakes
- Swapping the HCF and LCM rules. Take lowest powers for HCF, highest for LCM. Recover it from meaning rather than memory: the HCF must divide both, so it cannot use more than both have.
- Using HCF × LCM = product for three numbers. It holds for two only.
- Dropping "no common factor" from an irrationality proof. Without it there is no contradiction at the end, and the proof scores almost nothing.
- Proving a number composite by full factorisation. One factor other than 1 and itself is enough — look for the common term before multiplying anything out.
CBSE exam focus
| Topic | Typical marks |
|---|---|
| HCF / LCM by prime factorisation, including word problems | 2–3 |
| The HCF × LCM identity (finding the fourth quantity) | 1–2 |
| Proof of irrationality (√2, √3, √5, or a combination like ) | 3 |
| Reasoning questions — why cannot end in 0, why an expression is composite | 2–3 |
The irrationality proof is the most reliably repeated item in this chapter. It is worth being able to write it out cleanly from memory.
Quick self-test
- Find the HCF and LCM of 12, 15 and 21. (HCF 3, LCM 420 — and note the product identity does not apply here.)
- Show that is irrational. (If then , which is rational — contradiction.)
- Prove is irrational. (Assume coprime; ⇒ 5 | p ⇒ p = 5k ⇒ ⇒ 5 | q. Both divisible by 5 — contradiction.)
- Two people jog a circular track in 18 and 12 minutes. When do they next meet at the start? (LCM(18, 12) = 36 minutes.)
- Express 7429 as a product of primes. (17 × 19 × 23.)
Appendix — beyond the current syllabus
Not examinable in CBSE 2026-27. Both topics below were removed from this chapter when the syllabus was rationalised. They are kept here because they are genuinely useful — Euclid's algorithm is standard in computer science, and decimal expansions explain something you see constantly — but do not spend board-exam preparation time on them, and do not use Euclid's lemma as your method in an answer that asks for the HCF.
Euclid's division lemma and algorithm
Given positive integers and , there are unique integers and with
To find the HCF, apply it repeatedly, each time replacing the pair by (divisor, remainder). The last non-zero remainder is the HCF.
HCF(135, 225): ; ; . So the HCF is 45 — the same answer prime factorisation gives.
It also drives "show that every odd integer is of the form when squared" style arguments: any odd integer is or , and squaring either gives .
Decimal expansions of rational numbers
A rational in lowest terms has a terminating decimal expansion exactly when ; otherwise the expansion is non-terminating recurring.
| Fraction | Denominator | Terminates? |
|---|---|---|
| 3/8 | Yes (0.375) | |
| 7/40 | Yes (0.175) | |
| 11/30 | No — the 3 spoils it | |
| 1/7 | No (0.142857…) |
Simplify the fraction before checking the denominator: 77/210 looks bad until it reduces to 11/30.
Once Real Numbers is solid, Polynomials carries the same idea into algebra — factorising expressions instead of integers, and reading the zeroes of a polynomial off its coefficients.
