By the end of this chapter you'll be able to…

  • 1State and use the Fundamental Theorem of Arithmetic to factorise any composite number
  • 2Find the HCF and LCM of two or three numbers by prime factorisation
  • 3Use the identity HCF(a,b) × LCM(a,b) = a × b — and know why it fails for three numbers
  • 4Prove that √2, √3 and √5 are irrational by contradiction
  • 5Extend those proofs to numbers like 3 + 2√5 and 7√5
  • 6Use uniqueness of factorisation to settle questions such as whether 6ⁿ can end in 0
💡
Why this chapter matters
Real Numbers is the foundation for everything that follows in Class 10 maths — polynomials use prime factorisation, quadratic equations use irrational roots, and the uniqueness of prime factorisation is what makes every HCF and LCM argument valid. It's also the chapter that quietly turns up in JEE Main number-theory problems.

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)

  1. Find the HCF and LCM of 196 and 38220 by prime factorisation.
  2. Show that is irrational.
  3. The HCF of two numbers is 27 and their LCM is 162. One number is 54 — find the other.
  4. Find the smallest number that leaves remainder 5 when divided by 12, 15 and 18.
  5. Explain why is composite.

Answers

  1. and . Common at lowest powers: , so HCF = 196 (196 divides 38220). LCM .
  2. Suppose is rational. Then , a rational number — contradicting the irrationality of .
  3. .
  4. LCM(12, 15, 18): , , , so LCM . Required number .
  5. Both terms are divisible by 5, so it equals — a product of two factors greater than 1.

Common mistakes

  1. 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.
  2. Using HCF × LCM = product for three numbers. It holds for two only.
  3. Dropping "no common factor" from an irrationality proof. Without it there is no contradiction at the end, and the proof scores almost nothing.
  4. 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

TopicTypical marks
HCF / LCM by prime factorisation, including word problems2–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 composite2–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

  1. Find the HCF and LCM of 12, 15 and 21. (HCF 3, LCM 420 — and note the product identity does not apply here.)
  2. Show that is irrational. (If then , which is rational — contradiction.)
  3. Prove is irrational. (Assume coprime; ⇒ 5 | p ⇒ p = 5k ⇒ ⇒ 5 | q. Both divisible by 5 — contradiction.)
  4. Two people jog a circular track in 18 and 12 minutes. When do they next meet at the start? (LCM(18, 12) = 36 minutes.)
  5. 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.

FractionDenominatorTerminates?
3/8Yes (0.375)
7/40Yes (0.175)
11/30No — the 3 spoils it
1/7No (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.

Key formulas & results

Everything you need to memorise, in one card. Screenshot this for revision.

Fundamental Theorem of Arithmetic
n = p₁^a · p₂^b · p₃^c · …
Every composite number has a unique prime factorisation. Uniqueness is the part that does the work.
HCF from prime factorisation
HCF = product of common primes, each at its LOWEST power
It must divide both numbers, so it can only use what both have.
LCM from prime factorisation
LCM = product of ALL primes present, each at its HIGHEST power
It must be divisible by both, so it carries the greedier demand for each prime.
HCF × LCM identity (two numbers)
HCF(a, b) × LCM(a, b) = a × b
Only true for TWO numbers. For 12, 15, 21 it gives 1260, not 3780.
Prime divisibility of squares
if a prime p divides a², then p divides a
The engine of every irrationality proof. It needs p to be prime.
⚠️

Common mistakes & fixes

These are the exact errors that cost students marks in board exams. Read them once, save yourself the trouble.

WATCH OUT
Taking the highest power of the common primes for the HCF
Lowest powers for HCF, highest for LCM. Recover it from meaning: the HCF has to divide both numbers, so it cannot use more of a prime than either one actually has.
WATCH OUT
Assuming any number containing √ is irrational
Only √n where n is not a perfect square is irrational. √4 = 2 and √(9/16) = 3/4 are rational.
WATCH OUT
Using HCF × LCM = a × b for three numbers
The identity is only for two numbers. For three or more, compute HCF and LCM via prime factorisation.
WATCH OUT
Stopping the proof of √5 irrational at '5 divides p² so 5 divides p'
You must go on to show 5 divides q too, contradicting the 'no common factor' assumption. Without that step the proof is incomplete.
WATCH OUT
Omitting 'where p and q have no common factor' when setting up an irrationality proof
That assumption is the thing the contradiction contradicts. Leave it out and the proof cannot land, however good the algebra is.
WATCH OUT
Proving a number composite by factorising it completely
Producing one factor other than 1 and itself is enough. In 7×11×13+13, take 13 out and you are done — no arithmetic needed.

Practice problems

Work through this chapter's problems as a readiness check — reveal each solution, mark yourself honestly, and get your gap report at the end.

Readiness check

Are you exam-ready for Real Numbers?

6 problems from this chapter. Try each one, reveal the worked solution, mark yourself honestly — get your gap report at the end.

6 questions~4 min worth ~6 marks in NIOS exams

5-minute revision

The whole chapter, distilled. Read this the night before the exam.

  • Fundamental Theorem of Arithmetic: every composite has a unique prime factorisation — and uniqueness is the useful half.
  • HCF = product of smallest powers of common primes. LCM = product of greatest powers of all primes.
  • HCF(a,b) × LCM(a,b) = a × b — only for TWO numbers. For three, go through the primes.
  • If a prime p divides a², then p divides a. This single fact powers every irrationality proof.
  • √p is irrational for any prime p — proof by contradiction, starting from 'no common factor'.
  • A rational plus, or times, a non-zero rational multiple of an irrational is still irrational (3 + 2√5, 7√5, 6 + √2).
  • To show a number is composite, display one factor other than 1 and itself — usually by taking out a common term.
  • A number ends in 0 only if its factorisation contains both 2 and 5; that is why 6ⁿ never does.

NIOS marks blueprint

Where the marks come from in this chapter — so you can plan your prep.

Typical chapter weightage: Real Numbers sits in Unit I (Number Systems), worth 6 marks total.

Question typeMarks eachTypical countWhat it tests
MCQ (1 mark)11HCF or LCM from given factorisations, or the HCF × LCM identity
Short Answer (2 marks)21HCF/LCM by prime factorisation, or a reasoning question such as why 6ⁿ cannot end in 0
Long Answer (3 marks)31Irrationality proof, or an HCF/LCM word problem
Prep strategy
  • Irrationality proofs are the most reliably tested 3-mark question in this unit. Learn the STRUCTURE once: assume rational with no common factor → square → the prime divides the numerator → substitute → the same prime divides the denominator → contradiction. Only the number changes between √2, √3 and √5.
  • Write the phrase 'where p and q have no common factor' every single time. It is the assumption the contradiction attacks, and proofs without it lose most of the marks.
  • HCF = SMALLEST powers of COMMON primes; LCM = LARGEST powers of ALL primes. If you blank, rebuild it from meaning rather than memory.
  • For 'can 2ⁿ/6ⁿ/12ⁿ end in digit d' and 'why is this expression composite', the answer is always the uniqueness of prime factorisation — say so explicitly, that is where the mark sits.
  • Note what is no longer examined: Euclid's division lemma and terminating/non-terminating decimal expansions were removed from this chapter. Old question papers and many solution sites still feature them heavily — do not spend time there.

Where this shows up in the real world

This chapter isn't just an exam topic — it lives in the world around you.

RSA encryption — prime factorisation is hard to reverse

Music and HCF/LCM — rhythmic cycles

Gear ratios and engineering

Exam strategy

Battle-tested tips from teachers and toppers for this chapter.

1
Irrationality proofs: the grader checks for THREE things — (1) the 'assume rational in lowest terms' set-up, (2) the contradiction step (showing both are even/share a factor), (3) the final 'contradiction' statement. Missing any one drops you 1 mark.
2
Use prime factorisation for every HCF and LCM question. Set the two factorisations out one under the other so the common primes line up — picking lowest and highest powers then becomes reading, not remembering.
3
For ‘can nᵏ end in digit d’ questions, name the Fundamental Theorem explicitly. The marks are for saying the factorisation is unique so the needed prime cannot appear — not for the arithmetic.
4
HCF and LCM word problems: read carefully whether the question asks for HCF (largest that divides both — 'measuring' problems, 'tiling' problems) or LCM (smallest that both divide — 'meeting again' problems, 'cycling' problems). The word 'maximum' usually signals HCF; 'minimum' usually signals LCM.

Going beyond the textbook

For olympiad aspirants and curious learners — topics that build on this chapter.

STRETCH
Explore why unique factorisation is not automatic. In ordinary integers, 6 = 2 × 3 and nothing else. But in the number system {a + b√-5}, 6 factorises two genuinely different ways: 2 × 3 and (1 + √-5)(1 - √-5). Unique factorisation fails there. That discovery is what forced mathematicians to invent ideal numbers, and it shows the Fundamental Theorem is a real theorem about the integers rather than an obvious fact about arithmetic.
STRETCH
Explore Cantor's proof that the real numbers are uncountable (1874): using diagonalisation, Cantor showed that you cannot list all real numbers even in an infinite list. Since the rationals ARE countable, the irrationals must form an 'uncountably infinite' set — so in a precise sense, irrational numbers are 'almost all' of the real line, and rational numbers are the exceptions (measure zero). This makes the chapter's irrationality proofs even more interesting: you're proving membership in the 'typical' set.
STRETCH
Investigate the Collatz Conjecture — one of the most famous unsolved problems in mathematics: take any positive integer; if even, divide by 2; if odd, multiply by 3 and add 1. Repeat. Does the sequence always reach 1? This has been verified for numbers up to 2⁶⁸, but no proof exists. The connection to this chapter: the problem involves fundamental properties of integers under division — the same number-theory mindset you're developing here.
STRETCH
Research Waring's Problem (1770): every positive integer can be expressed as the sum of at most 4 perfect squares (e.g., 7 = 4 + 1 + 1 + 1). Can every integer be expressed as the sum of at most k cubes, k fourth powers, etc.? This connects the chapter's study of primes and integer properties to the deep study of additive number theory.

Where else this chapter is tested

CBSE board isn't the only one — other exams test this chapter too.

Questions students ask

The real ones — pulled from the Q&A community and tutor sessions.

Verified by the tuition.in editorial team
Last reviewed on 30 July 2026. Written and reviewed by subject-matter experts — read about our process.
Editorial process →
Header Logo