Real Numbers

What you will learn in this chapter
  • Write any composite number as a product of primes, and explain why there is only one way to do it
  • Find the HCF and LCM of two or three numbers by the prime factorisation method
  • Use HCF × LCM = product for two numbers, and know that it need not hold for three
  • Prove that 2\sqrt{2}, 3\sqrt{3}, 5\sqrt{5} are irrational by the method of contradiction
  • Prove that numbers like 5−35-\sqrt{3} and 323\sqrt{2} are irrational
prime numbercomposite numberFundamental Theorem of Arithmeticfactor treeprime factorisationHCFLCMcoprimeirrational numberproof by contradiction
What is in your syllabus

The chapter in the current NCERT reprint has two parts: the Fundamental Theorem of Arithmetic (Section 1.2, Exercise 1.1) and Revisiting Irrational Numbers (Section 1.3, Exercise 1.2). The CBSE 2026-27 curriculum lists the same two topics for Real Numbers. Euclid’s Division Algorithm and decimal expansions of rational numbers, found in older guides, are not in the CBSE 2026-27 syllabus, and this reprint has no section on them.

1 The Fundamental Theorem of Arithmetic

Every natural number greater than 1 is one of two kinds, and this whole section is about the difference:

Prime number

  • Has exactly two factors: 1 and itself
  • Cannot be broken into smaller factors
  • 2, 3, 5, 7, 11, 13, 23 …

Composite number

  • Has more than two factors
  • Can be broken into smaller factors
  • 4, 6, 12, 253 = 11 × 23 …

Powers: 232^3 means 2×2×22\times2\times2 (2 multiplied 3 times); 3 is the power of 2. A prime that appears once has power 1, e.g. 5=515=5^1.

If we multiply primes together, repeating them as often as we like, we build up composite numbers: 7×11×23=17717\times11\times23=1771, 22×3×7×11×23=212522^2\times3\times7\times11\times23=21252, and infinitely many more. The real question is the reverse: can every composite number be broken back down into primes? To find out, we break a large number down with a factor tree, splitting each composite number into two factors until only primes are left.

Figure 1: Factor tree of 32760. At every step one prime splits off, and the tree stops only when every branch ends in a prime.
Figure 1: Factor tree of 32760. At every step one prime splits off, and the tree stops only when every branch ends in a prime.

Try another: 123456789=32×3803×3607123456789=3^2\times3803\times3607 (3803 and 3607 are both prime numbers). Every number we try breaks down into primes in this way. This always happens, and it has been proved, so it is stated as a theorem (a result that has been proved true).

Learn by heartTheorem 1.1: Fundamental Theorem of Arithmetic (FTA)

“Every composite number can be expressed (factorised) as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.”

The theorem says two things. First, a factorisation into primes always exists. Second, it is unique (there is only one): 2×3×5×72\times3\times5\times7 and 3×5×7×23\times5\times7\times2 count as the same factorisation, since only the order differs. So if we always write the primes from smallest to largest (ascending order), there is exactly one way to write any composite number, such as 32760=2×2×2×3×3×5×7×1332760=2\times2\times2\times3\times3\times5\times7\times13. NCERT also states it as: “The prime factorisation of a natural number is unique, except for the order of its factors.”

Did you know?

An equivalent version of this theorem was probably first recorded as Proposition 14 of Book IX in Euclid’s Elements. The first correct proof was given by Carl Friedrich Gauss (1777-1855) in his Disquisitiones Arithmeticae. Gauss is often called the “Prince of Mathematicians” and is counted among the three greatest mathematicians of all time, along with Archimedes and Newton.

Portrait of Carl Friedrich Gauss painted in 1840 by Christian Albrecht Jensen
Figure 2: Carl Friedrich Gauss, who gave the first correct proof of the Fundamental Theorem of Arithmetic. Image: Christian Albrecht Jensen / Wikimedia Commons / Public Domain

In problems, the uniqueness part is used to show which primes cannot appear in a number’s factorisation, as in Example 1:

Example 1 (NCERT)

Q. Consider the numbers 4n4^n, where nn is a natural number. Check whether there is any value of nn for which 4n4^n ends with the digit zero.

Solution: A number ending in 0 is divisible by 10, so it is divisible by 5, and its prime factorisation must contain the prime 5.
But 4n=(22)n=22n4^n=(2^2)^n=2^{2n}, so the only prime in the factorisation of 4n4^n is 2.
By the uniqueness in the Fundamental Theorem of Arithmetic, no other prime (in particular, not 5) can appear.
So there is no natural number nn for which 4n4^n ends with the digit zero.

Exam Tip

The same argument settles every “can ana^n end in 0?” question: a number ends in 0 only if its prime factorisation contains both 2 and 5. Look at the number being raised to the power: 6n=2n×3n6^n=2^n\times3^n has no 5, so it never ends in 0; 10n=2n×5n10^n=2^n\times5^n always does.

Worked example (Exercise 1.1, Q6 type): showing a number is composite

Q. Show that 7×11×13+137\times11\times13+13 and 7×6×5×4×3×2×1+57\times6\times5\times4\times3\times2\times1+5 are not prime.

Solution: Take out the common prime factor from both terms.
7×11×13+13=13×(7×11+1)=13×78=10147\times11\times13+13=13\times(7\times11+1)=13\times78=1014.
7×6×5×4×3×2×1+5=5×(7×6×4×3×2×1+1)=5×1009=50457\times6\times5\times4\times3\times2\times1+5=5\times(7\times6\times4\times3\times2\times1+1)=5\times1009=5045.
Each number has a factor other than 1 and itself (13 and 5), so both are composite.

2 HCF and LCM by Prime Factorisation

HCF is the Highest Common Factor and LCM the Lowest Common Multiple. The way you found them in earlier classes, by first breaking each number into primes, is called the prime factorisation method. It works because of the Fundamental Theorem of Arithmetic.

Rule
HCF = product of the smallest power of each common prime factor
LCM = product of the greatest power of each prime factor involved
Step 1: write every number as a product of powers of primes. Step 2: apply the two rules.
Figure 3: Prime factors of 6 and 20 in a Venn diagram. The shared factor (in the overlap) gives the HCF. Every factor shown, with the overlap counted once, gives the LCM.
Figure 3: Prime factors of 6 and 20 in a Venn diagram. The shared factor (in the overlap) gives the HCF. Every factor shown, with the overlap counted once, gives the LCM.
Example 2 (NCERT)

Q. Find the LCM and HCF of 6 and 20 by the prime factorisation method.

Solution: 6=21×316=2^1\times3^1 and 20=22×5120=2^2\times5^1.
Common prime: only 2, smallest power 212^1. So HCF(6,20)=21=2\text{HCF}(6,20)=2^1=2.
All primes involved: 2, 3, 5, greatest powers 22,31,512^2,3^1,5^1. So LCM(6,20)=22×31×51=60\text{LCM}(6,20)=2^2\times3^1\times5^1=60.

Notice that HCF(6,20)×LCM(6,20)=2×60=120=6×20\text{HCF}(6,20)\times\text{LCM}(6,20)=2\times60=120=6\times20. This is true for every pair of positive integers:

Product rule (for two numbers)
HCF(a,b)×LCM(a,b)=a×b\text{HCF}(a,b)\times\text{LCM}(a,b)=a\times b
for any two positive integers aa and bb. Once the HCF is known, LCM=a×bHCF\text{LCM}=\dfrac{a\times b}{\text{HCF}}.
Example 3 (NCERT)

Q. Find the HCF of 96 and 404 by the prime factorisation method. Hence, find their LCM.

Solution: 96=25×396=2^5\times3 and 404=22×101404=2^2\times101.
Common prime: 2, smallest power 222^2. So HCF(96,404)=22=4\text{HCF}(96,404)=2^2=4.
LCM(96,404)=96×404HCF(96,404)=96×4044=9696\text{LCM}(96,404)=\dfrac{96\times404}{\text{HCF}(96,404)}=\dfrac{96\times404}{4}=9696.

Example 4 (NCERT): three numbers

Q. Find the HCF and LCM of 6, 72 and 120, using the prime factorisation method.

Solution: 6=2×36=2\times3, 72=23×3272=2^3\times3^2, 120=23×3×5120=2^3\times3\times5.
Common primes: 2 and 3, smallest powers 212^1 and 313^1. So HCF(6,72,120)=2×3=6\text{HCF}(6,72,120)=2\times3=6.
Greatest powers: 232^3, 323^2, 515^1. So LCM(6,72,120)=23×32×5=360\text{LCM}(6,72,120)=2^3\times3^2\times5=360.

Common Mistake

The product rule is stated for two numbers. Do not use it for three. In Example 4, 6×72×120=518406\times72\times120=51840, but HCF×LCM=6×360=2160\text{HCF}\times\text{LCM}=6\times360=2160. So for 6, 72 and 120, the product of the three numbers is not equal to the product of their HCF and LCM. For three numbers this equality does not hold in general, so find the HCF and LCM by prime factorisation.

Worked example (Exercise 1.1, Q7 type): when do they meet again?

Q. Sonia takes 18 minutes and Ravi 12 minutes to go once round a circular path. They start together from the same point, in the same direction. When are they next together at the starting point?

Solution: Sonia is back at the start after every multiple of 18 minutes and Ravi after every multiple of 12 minutes, so they are there together first after LCM(18, 12) minutes.
18=2×3218=2\times3^2 and 12=22×312=2^2\times3, so LCM(18,12)=22×32=36\text{LCM}(18,12)=2^2\times3^2=36.
They meet again at the starting point after 36 minutes.

3 Theorem 1.2: The Tool for the Irrationality Proofs

Before proving any number irrational, we need one fact about primes, which also comes from the Fundamental Theorem of Arithmetic.

Learn by heartTheorem 1.2

Let pp be a prime number. If pp divides a2a^2, then pp divides aa, where aa is a positive integer.

“pp divides aa” means aa is a multiple of pp (for example, 3 divides 12). It is written p∣ap\mid a. The arrow ⇒\Rightarrow means “so” or “implies”.

Why it is true is shown below. NCERT marks this proof with an asterisk: “Not from the examination point of view.”

a=p1p2⋯pna=p_1p_2\cdots p_nprime factorisation of aa (a prime may repeat)
a2=p12p22⋯pn2a^2=p_1^2p_2^2\cdots p_n^2squaring: the same primes, each twice
p∣a2⇒pp\mid a^2\Rightarrow p is one of p1,p2,…,pnp_1,p_2,\ldots,p_nby uniqueness, these are the only primes in a2a^2
p∣ap\mid app is one of the prime factors of aa itself

4 Revisiting Irrational Numbers

A number is rational if it can be written as a fraction pq\dfrac{p}{q} of two integers with q≠0q\ne0 (for example 34\dfrac{3}{4}, −5=−51-5=\dfrac{-5}{1}, 0.5=120.5=\dfrac{1}{2}). Here pp and qq are any integers, not the prime pp of Theorem 1.2. Rational and irrational numbers together make up the real numbers.

Learn by heartDefinition: irrational number

A number ss is called irrational if it cannot be written in the form pq\dfrac{p}{q}, where pp and qq are integers and q≠0q\ne0.

You already know several: 2\sqrt{2}, 3\sqrt{3}, 15\sqrt{15}, π\pi, −23-\dfrac{\sqrt{2}}{\sqrt{3}}, 0.10110111011110…0.10110111011110\ldots. In Class 9 you were told they are irrational; now we prove it. The proofs use two ideas:

Learn by heartCoprime numbers

Two integers are coprime if they have no common factor other than 1. Any fraction can be reduced to lowest terms ab\dfrac{a}{b} with aa and bb coprime.

Learn by heartProof by contradiction

To prove a statement, assume the opposite and show that this assumption leads to something impossible. The assumption must then be false, so the statement is true.

4.1 Theorem 1.3: 2\sqrt{2} is irrational

Assume, to the contrary, that 2\sqrt{2} is rationalstart of proof by contradiction
2=ab\sqrt{2}=\dfrac{a}{b}, with a,ba,b coprime positive integerscancel any common factor; since 2\sqrt{2} is positive, aa and bb can both be taken positive
b2=a ⇒ 2b2=a2b\sqrt{2}=a\ \Rightarrow\ 2b^2=a^2squaring both sides and rearranging
2∣a22\mid a^2, so 2∣a2\mid aTheorem 1.2 with p=2p=2
a=2ca=2c for some integer ccbecause 2 divides aa
2b2=4c2 ⇒ b2=2c22b^2=4c^2\ \Rightarrow\ b^2=2c^2substituting a=2ca=2c
2∣b22\mid b^2, so 2∣b2\mid bTheorem 1.2 again, p=2p=2
aa and bb have 2 as a common factor2∣a2\mid a and 2∣b2\mid b
This contradicts “aa and bb are coprime”clash with our starting assumption
So the assumption was wrong: 2\sqrt{2} is irrationalconclusion

4.2 The same method for 3\sqrt{3}, 5\sqrt{5} and any p\sqrt{p}

Theorem 1.2 works for every prime, so the proof above works for p\sqrt{p} whenever pp is prime. Only the number changes:

Step 1Assume p=ab\sqrt{p}=\dfrac{a}{b}, a,ba,b coprime, b≠0b\ne0
↓
Step 2Square: pb2=a2pb^2=a^2, so p∣a2p\mid a^2, so p∣ap\mid a (Theorem 1.2)
↓
Step 3Put a=pca=pc: pb2=p2c2pb^2=p^2c^2, so b2=pc2b^2=pc^2, so p∣bp\mid b
↓
Step 4pp divides both aa and bb: contradiction, so p\sqrt{p} is irrational
Example 5 (NCERT)

Q. Prove that 3\sqrt{3} is irrational.

Solution: Assume, to the contrary, that 3\sqrt{3} is rational, so 3=ab\sqrt{3}=\dfrac{a}{b} with a,ba,b coprime integers, b≠0b\ne0.
Then b3=ab\sqrt{3}=a, and squaring, 3b2=a23b^2=a^2. So 3 divides a2a^2, and by Theorem 1.2, 3 divides aa.
Write a=3ca=3c. Then 3b2=9c23b^2=9c^2, that is, b2=3c2b^2=3c^2. So 3 divides b2b^2, and hence 3 divides bb (Theorem 1.2).
Now 3 is a common factor of aa and bb, which contradicts that they are coprime.
So 3\sqrt{3} is irrational.

Exam Tip

Steps for proving 2\sqrt{2}, 3\sqrt{3} or 5\sqrt{5} irrational. Write every step, in this order: assume rational → coprime a,ba,b → square → Theorem 1.2 → substitute → Theorem 1.2 again → contradiction → conclusion.

5 Rational and Irrational Numbers Together

In Class 9 you were told two facts. NCERT proves them for particular numbers:

Fact NCERT example
Rational ± irrational is irrational 5−35-\sqrt{3} (Example 6)
Non-zero rational × or ÷ irrational is irrational 323\sqrt{2} (Example 7)
Example 6 (NCERT)

Q. Show that 5−35-\sqrt{3} is irrational.

Solution: Assume, to the contrary, that 5−35-\sqrt{3} is rational, so 5−3=ab5-\sqrt{3}=\dfrac{a}{b} with a,ba,b coprime, b≠0b\ne0.
Rearranging, 3=5−ab=5b−ab\sqrt{3}=5-\dfrac{a}{b}=\dfrac{5b-a}{b}.
Since aa and bb are integers, 5b−ab\dfrac{5b-a}{b} is rational, so 3\sqrt{3} would be rational.
This contradicts the fact that 3\sqrt{3} is irrational. So 5−35-\sqrt{3} is irrational.

Example 7 (NCERT)

Q. Show that 323\sqrt{2} is irrational.

Solution: Assume, to the contrary, that 323\sqrt{2} is rational, so 32=ab3\sqrt{2}=\dfrac{a}{b} with a,ba,b coprime, b≠0b\ne0.
Rearranging, 2=a3b\sqrt{2}=\dfrac{a}{3b}. Since 3, aa and bb are integers, a3b\dfrac{a}{3b} is rational, so 2\sqrt{2} would be rational.
This contradicts the fact that 2\sqrt{2} is irrational. So 323\sqrt{2} is irrational.

Common Mistake

These rules need one rational and one irrational number. Two irrationals can give a rational answer: 2+(−2)=0\sqrt{2}+(-\sqrt{2})=0 and 2×2=2\sqrt{2}\times\sqrt{2}=2. Also, the rational number must be non-zero when multiplying: 0×2=00\times\sqrt{2}=0 is rational.

6 Extra: HCF and LCM of Three Numbers

For interest: NCERT’s Note to the Reader

From NCERT’s “Note to the Reader”: for three positive integers p,q,rp,q,r (here pp need not be prime), HCF × LCM need not equal the product p×q×rp\times q\times r, but these formulas hold:

LCM(p,q,r)=p×q×r×HCF(p,q,r)HCF(p,q)×HCF(q,r)×HCF(p,r)\text{LCM}(p,q,r)=\dfrac{p\times q\times r\times\text{HCF}(p,q,r)}{\text{HCF}(p,q)\times\text{HCF}(q,r)\times\text{HCF}(p,r)}
HCF(p,q,r)=p×q×r×LCM(p,q,r)LCM(p,q)×LCM(q,r)×LCM(p,r)\text{HCF}(p,q,r)=\dfrac{p\times q\times r\times\text{LCM}(p,q,r)}{\text{LCM}(p,q)\times\text{LCM}(q,r)\times\text{LCM}(p,r)}

Check with 6, 72, 120: HCF(6, 72) =6=6, HCF(72, 120) =24=24, HCF(6, 120) =6=6, so LCM=51840×66×24×6=360\text{LCM}=\dfrac{51840\times6}{6\times24\times6}=360, matching Example 4.

Quick Revision: read this the night before the exam
  • FTA: every composite number is a product of primes, uniquely apart from order
  • A number ends in 0 only if its prime factors include both 2 and 5; so 4n4^n, 6n6^n never end in 0
  • HCF = smallest powers of common primes; LCM = greatest powers of all primes
  • HCF(a,b)×LCM(a,b)=a×b\text{HCF}(a,b)\times\text{LCM}(a,b)=a\times b for two numbers; for three numbers it does not hold in general (6, 72, 120)
  • Theorem 1.2: pp prime and p∣a2⇒p∣ap\mid a^2\Rightarrow p\mid a
  • p\sqrt{p} is irrational for every prime pp: assume p=ab\sqrt{p}=\dfrac{a}{b} with a,ba,b coprime, square, Theorem 1.2 twice, contradiction
  • rational ± irrational = irrational; non-zero rational × or ÷ irrational = irrational
Practice Questions
  1. 1 markExpress 84 as a product of its prime factors.
  2. 2 marksFind HCF(96, 120) by prime factorisation, and hence their LCM.
  3. 2 marksCan 15n15^n end with the digit 0 for any natural number nn? Give a reason.
  4. 3 marksProve that 7\sqrt{7} is irrational.
  5. 3 marksProve that 2+32+\sqrt{3} is irrational.
Read this chapter in:English Mediumहिंदी माध्यम