1

CHAPTER

REAL NUMBERS
Chapter Objectives
This chapter will help you to understand :
¾¾ Euclid's division lemma and fundamental theorem of arithmetic : Euclid's division lemma, Euclid's division algorithm,
Steps to find HCF, Prime factorisation, HCF and LCM.
¾¾ Rational and irrational numbers : Rational and Irrational numbers.

TOPIC-1 TOPIC - 1
Euclid's Division Lemma
Euclid's Division Lemma and Fundamental Theorem
of Arithmetic P. 01
and Fundamental Theorem
TOPIC - 2
of Arithmetic Rational and Irrational
Numbers P. 09

Quick Review
™™ Euclid's Division Lemma : For any two positive
integers a and b, there exists unique integer q and TIPS…
satisfying a = bq + r , where 0 ≤ r < b Every even positive integer can be written as 2n and
™™ Euclid's Division Algorithm : It is an algorithm that
every odd positive integer can be written as (2n + 1)
is used to find the HCF of any two positive integers.
for any whole number n.
™™ Steps to Find HCF : To find the HCF of any two
positive integers, let c and d where c > d, by using Any positive integer can be written as 3n,
Euclid's division algorithm, we need to follow the (3n + 1), (3n + 2) for any whole number n.
following steps : Euclid's division lemma and algorithm is same as
• Step 1 : Apply Euclid's’s division lemma, to c and division algorithm.
d. So, we find whole numbers, q and r such that
c = dq + r, 0 ≤ r < d. Euclid's division lemma can be used for all integers
• Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0, except zero (0).
apply the division lemma to d and r. Greatest number that will divide x, y, z leaving the
• Step 3 : Continue the process till the remainder remainder p, q, r respectively = HCF of (x – p), (y –
is zero. The divisor at this stage will be the q), (z – r).
required HCF.
Greatest number that will divide x, y, z leaving the
™™ Fundamental Theorem of Arithmetic : Every composite
number can be expressed (factorised) as a product of same remainder in each case = HCF of |x – y|, |y –
primes and this factorisation is unique apart from the z|, |z – x|
order in which the prime factor occurs. Least number which when divided by x, y, z leaves
™™ Prime Factorisation : In general, a composite the remainder p, q, r respectively such that (x – p)
number x has a factorisation x = p1a p2 b p3c ... where = (y – q) = (z – r) = k, then the required number =
p1 , p2 , p3 ... are primes and written in ascending order LCM of (x, y, z) – k

p1 < p2 < p3 < ...

™™ HCF : HCF of any two positive integers is the largest number that is factor of both the two positive integers.
™ ™ LCM : LCM of any two positive integers is the least number that is multiple of both the two positive
integers.
2| OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

Know the Links

☞ https://www.aplustopper.com/Euclid's-division- TRICKS…
algorithm/ In Euclid's division lemma a = bq + r , b is the divisor
☞ http://www.solving-math-problems.com/Euclid'ss- and its value is taken according to given question.
division-lemma-for-real-numbers.html
☞ https://en.wikipedia.org/wiki/Prime_number
In Euclid's division lemma a = bq + r , the remainder
r is 0 ≤ r < b. It means r is always positive and less
than the divisor.
In Euclid's division lemma a = bq + r , if the remain-
der r is negative r < 0, then add the divisor to the
remainder to make it positive.
LCM of numerator
LCM of fractions =
HCF of denominator

HCF of numerator
HCF of fractions =
LCM of denominator

Multiple Choice Questions (1 mark each)

Q. 1. For some integer m, every even integer is of the form Q. 4. If the HCF of 65 and 117 is expressible in the form
(a) m. (b) m + 1. 65m – 117, then the value of m is
(c) 2m. (d) 2m + 1. (a) 4. (b) 2.
 [NCERT Exemp. Ex. 1.1, Q. 1, Page 2] (c) 1. (d) 3.
Sol. Correct option : (c)  [NCERT Exemp. Ex. 1.1, Q. 4, Page 3]
Explanation : According to Euclid's division lemma, Sol. Correct option : (b)
a = bm + r, where 0 ≤ r < b.
Explanation : By the Euclid's division algorithm,
If b = 2, then a = 2m or a = 2m + 1
HCF of (65, 117) = 13
Since a = 2m is divisible by 2, then 2m is an even
Since 65m – 117 = 13 ⇒ m = 2
integer.
Q. 2. For some integer q, every odd integer is of the form Q. 5. The largest number which divides 70 and 125,
leaving remainders 5 and 8, respectively, is
(a) q. (b) q + 1.
(a) 13. (b) 65.
(c) 2q. (d) 2q + 1.
 [NCERT Exemp. Ex. 1.1, Q. 2, Page 2] (c) 875. (d) 1,750.
Sol. Correct option : (d)  [NCERT Exemp. Ex. 1.1, Q. 5, Page 3]
Explanation : According to Euclid's division lemma, Sol. Correct option : (a)
a = bq + r, where 0 ≤ r < b. Explanation : Required largest number = HCF of
If b = 2, then a = 2q or a = 2q + 1 (70 – 5) and (125 – 8) = HCF of 65 and 117 = 13
Since a = 2q + 1 is not divisible by 2, then 2q + 1 is Q. 6. If two positive integers a and b are written as
an odd integer. a = x3y2 and b = xy3; x, y are prime numbers, then
Q. 3. n2 – 1 is divisible by 8, if n is HCF (a, b) is
(a) an integer. (b) a natural number. (a) xy. (b) xy2.
3 3
(c) an odd integer. (d) an even integer. (c) x y . (d) x2y2.
 [NCERT Exemp. Ex. 1.1, Q. 3, Page 3]  [NCERT Exemp. Ex. 1.1, Q. 6, Page 3]
Sol. Correct option : (c) Sol. Correct option : (b)
3 2
Explanation : Any odd integer can be written as Explanation : Since a = x y = x × x × x × y × y and
2m + 1. 3
b = xy = x × y × y × y ,
Put n = 2m + 1 in n2 – 1 Thus, HCF of a and b = x × y × y = xy
2

n 2 − 1 = ( n + 1)( n − 1) = ( 2m + 2 )( 2m ) = 4m ( m + 1) Q. 7. If two positive integers p and q can be expressed

The product of two consecutive numbers is as p = ab2 and q = a3b; a, b being prime numbers,
divisible by 2. Thus, m(m + 1) is divisible by 2. Let then LCM (p, q) is
m(m + 1) = 2k (a) ab. (b) a2b2.
n − 1 = ( n + 1)( n − 1) = ( 2m + 2 )( 2m ) 3 2
(c) a b . (d) a3b3.
= 4m ( m + 1) = 4 × 2k = 8k  [NCERT Exemp. Ex. 1.1, Q. 7, Page 3]
Thus, if n is an odd integer then n2 – 1 is divisible by 8. Sol. Correct option : (c)
 REAL NUMBERS |3
Explanation : Since p = ab 2 = a × b × b (c) 504. (d) 2,520.
and            q = a 3b = a × a × a × b  [NCERT Exemp. Ex. 1.1, Q. 9, Page 3]
3 2
Thus, LCM of p and q = a × a × a × b × b = a b Sol. Correct option : (d)
Q. 8. The least number that is divisible by all the Explanation : Required number
numbers from 1 to 10 (both inclusive) is = LCM (1, 2, 3, 4, 5, 6, 8, 9, 10)
(a) 10. (b) 100. = 1 × 2 × 2 × 2 × 3 × 3 × 5 × 7 = 2,520

Very Short Answer Type Questions (2 marks each)

Q. 1. Use Euclid's division algorithm to find the HCF of Hence, any positive integer can be of the form of
135 and 225. [NCERT Ex. 1.1, Q. 1(i), Page 7] 4q, 4q + 1, 4q +2, 4q + 3. [1]
Sol. Since 225 > 135, we use the Euclid's division lemma Q. 5. “The product of two consecutive positive integers
in 225 and 135. is divisible by 2”. Is this statement true or false?
Thus, we get Give reasons.[NCERT Exemp. Ex. 1.2, Q. 2, Page 4]
225 = 135 × 1 + 90 [½] Sol. True.
Since remainder 90 ≠ 0, we use the Euclid's division Since, in product of two consecutive positive integers
lemma in 135 and 90. p = n(n + 1), one of n or (n + 1) is an even number. [1]
Thus, we get Hence, the product of two consecutive positive
135 = 90 × 1 + 45 [½] integers is divisible by 2. [1]
Since remainder 45 ≠ 0, we use the Euclid's division Q. 6. A positive integer is of the form 3q + 1, q being a
lemma in 90 and 45. natural number. Can you write its square in any
Thus, we get form other than 3m + 1, i.e., 3m or 3m + 2 for some
90 = 45 × 2 + 0 [½] integer m? Justify your answer.
Since the remainder is zero, the divisor at this  [NCERT Exemp. Ex. 1.2, Q. 5, Page 4]
stage is HCF. Sol. No.
Therefore, the HCF of 135 and 225 is 45.
Q. 2. Use Euclid's division algorithm to find the HCF of
[½]
( )
Since ( 3q + 1) = 9q 2 + 6q + 1 = 3 3q 2 + 2q + 1 = 3m + 1 .
2

 [1]
196 and 38,220. [NCERT Ex. 1.1, Q. 1 (ii), Page 7]
Hence, it can be only in the form of 3m + 1 not in
Sol. Since 38220 > 196, we use the Euclid's division the form of 3m or 3m + 2. [1]
lemma in 38,220 and 196.
Q. 7. Express 140 as a product of its prime factors.
Thus, we get
 [NCERT Ex. 1.2, Q. 1 (i), Page 11]
38, 220 = 196 × 195 + 0 [1]
Sol. By the fundamental theorem of arithmetic, we get
Since the remainder is zero, the divisor at this stage
is HCF. 140 = 2 × 2 × 5 × 7 = 22 × 51 × 71 [2]
Therefore, the HCF of 196 and 38220 is 196. [1] Q. 8. Express 156 as a product of its prime factors.
Q. 3. Use Euclid's’s division algorithm to find the HCF  [NCERT Ex. 1.2, Q. 1 (ii), Page 11]
of 867 and 255. [NCERT Ex. 1.1, Q. 1 (iii), Page 7] Sol. By the fundamental theorem of arithmetic, we get
Sol. Since 867 > 255, we use the Euclid's division lemma 156 = 2 × 2 × 3 × 13 = 22 × 31 × 131 [2]
in 867 and 255. Q. 9. Express 3825 as a product of its prime factors.
Thus, we get  [NCERT Ex. 1.2, Q. 1 (iii), Page 11]
867 = 255 × 3 + 102 [½] Sol. By the fundamental theorem of arithmetic, we get
Since remainder 102 ≠ 0, we use the Euclid's 3825 = 3 × 3 × 5 × 5 × 17 = 32 × 52 × 17 [2]
division lemma in 255 and 102. Q. 10. Express 5005 as a product of its prime factors.
Thus, we get  [NCERT Ex. 1.2, Q. 1 (iv), Page 11]
255 = 102 × 2 + 51 [½] Sol. By the fundamental theorem of arithmetic, we get
Since remainder 51 ≠ 0, we use the Euclid's division
5005 = 5 × 7 × 11 × 13 [2]
lemma in 102 and 51.
Q. 11. Express 7429 as a product of its prime factors.
Thus, we get
 [NCERT Ex. 1.2, Q. 1 (v), Page 11]
102 = 51 × 2 + 0 [½]
Since the remainder is zero, the divisor at this stage Sol. By the fundamental theorem of arithmetic, we get
is HCF. 7429 = 17 × 19 × 23 [2]
Therefore, the HCF of 867 and 255 is 51. [½] Q. 12. Explain why 7 × 11 × 13 + 13 and 7 × 6 × 5 × 4 ×
Q. 4. Write whether every positive integer can be of the 3 × 2 × 1 + 5 are composite numbers.
form 4q + 2, where q is an integer. Justify your  [NCERT Ex. 1.2, Q. 6, Page 11]
answer. [NCERT Exemp. Ex. 1.2, Q. 1, Page 4] Sol. Since 7 × 11 × 13 + 13 = 13 × (7 × 11 + 1)
Sol. No. = 13 × 78
According to Euclid's division lemma, any positive = 13 × 13 × 6
integer can be of the form of a = bq + r where
= 1014 [1]
0≤r<b [1]
In this case, b = 4, then r = 0, 1, 2, 3. It has factor other than 1 and itself. Thus,
7 × 11 × 13 + 13 is a prime number. [1]
4| OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

Q. 13. The numbers 525 and 3,000 are both divisible only Q. 15. Can two numbers have 18 as their HCF and 380 as
by 3, 5, 15, 25 and 75. What is HCF (525, 3,000)? their LCM? Give reasons.
Justify your answer.  [NCERT Exemp. Ex. 1.2, Q. 8, Page 4]
 [NCERT Exemp. Ex. 1.2, Q. 6, Page 4] Sol. No.
Sol. The HCF of 525 and 3,000 is 75.
Since LCM of any two positive integers is always
Given that 525 and 3,000 are both divisible only by divisible by HCF of the same two positive integers,
3, 5, 15, 25 and 75. [1] here 380 is not divisible by 18. [1]
Since 75 is the highest factor that divides both 525
Hence, two numbers cannot have 18 as their HCF
and 3,000.
and 380 as their LCM simultaneously. [1]
Hence, the HCF of 525 and 3,000 is 75. [1]
Q. 14. Explain why 3 × 5 × 7 + 7 is a composite number. Q. 16. What is the HCF of the smallest prime number and
the smallest composite number?
 [NCERT Exemp. Ex. 1.2, Q. 7, Page 4]
Sol. 3 × 5 × 7 + 7 = 7 × ( 3 × 5 + 1) = 7 × 16 = 112 [1]  [CBSE Board, All India Region, 2018]
Since, it has more than two factors other than 1 and Sol. Since, the smallest prime number is 2 and the
itself. [1] smallest composite number is 4. Hence, the HCF
Hence, the given number is a composite number. of 2 and 4 is 2. [2]

Short Answer Type Questions (3 marks each)

Q. 1. Show that any positive odd integer is of the form 3m + 1]. [NCERT Ex. 1.1, Q. 4, Page 7]
6q + 1, or 6q + 3, or 6q + 5, where q is some integer. Sol. According to Euclid's division lemma, any positive
 [NCERT Ex. 1.1, Q. 2, Page 7] integer can be of the form of a = bq + r where
Sol. According to Euclid's division lemma, any positive 0≤r<b
integer can be of the form of According to the problem, b = 3, then r = 0, 1, 2.
a = bq + r where 0 ≤ r < b [1] So, a = 3q, 3q + 1, 3q +2, where q is a whole number.
In this case, b = 6, then r = 0, 1, 2, 3, 4, 5. Now, (3q)2 = 9q2 =3(3q2) = 3m, Here, m = 3q2,
Thus, any positive integer can be of the form of which is an integer
6q, 6q + 1, 6q +2, 6q + 3, 6q + 4, 6q + 5. [1]
Since 6q + 1, 6q + 3 and 6q + 5 are not divisible by Again, (3q + 1)2 = 9q2 + 6q + 1 = 3 (3q2 + 2q) + 1 =
2, these are odd integers. 3m + 1
Thus, any positive odd integer of the form 6q + 1, Here, m = (3q2 + 2q), which is an integer
or 6q + 3, or 6q + 5, where q is some integer. [1]
Further, (3q + 2)2 = 9q2 + 12q + 4 = (9q2 + 12q + 3)
Hence Proved
Q. 2. An army contingent of 616 members is to march +1
behind an army band of 32 members in a parade. = 3(3q2 + 4q + 1) + 1
The two groups are to march in the same number = 3m + 1
of columns. What is the maximum number of Here, m = (3q2 + 4q + 1), which in an integer.
columns in which they can march? Hence, the square of any positive integer is of the
 [NCERT Ex. 1.1, Q. 3, Page 7] form of either 3m or (3m + 1) for some integer m.
Sol. Required maximum number of columns = HCF of  Hence Proved
616 and 32
Q. 4. Use Euclid's division lemma to show that the cube
Since 616 > 32, we use the Euclid's division lemma of any positive integer is of the form 9m, 9m + 1 or
in 616 and 32. 9m + 8. [NCERT Ex. 1.1, Q. 5, Page 7]
Thus, we get Sol. According to Euclid's division lemma, any positive
616 = 32 × 19 + 8 [1] integer can be of the form of a = bq + r where
Since remainder 8 ≠ 0, we use the Euclid's division 0≤r<b [1]
lemma in 32 and 8. In this case, b = 3, then r = 0, 1, 2.
Thus, we get Thus, any positive integer can be of the form
32 = 8 × 4 + 0 [1] 3q, 3q + 1, 3q +2. [½]
Since the remainder is zero, the divisor at this stage
is HCF.
Now, ( 3q ) = 27 q 3 = 9 3q 3 = 9m
3
( )
( 3q + 1) = 27q3 + 27q 2 + 9q + 1
3

Therefore, the HCF of 616 and 32 is 8.

Thus, the maximum number of columns in which
    
( )
= 9 3q 3 + 3q 2 + q + 1 = 9m + 1
[½]
they can march is 8. [1]
( 3q + 2 )
3
Q. 3. Use Euclid's division lemma to show that the = 27 q + 27 q + 9q + 8
3 2

square of any positive integer is either of the form

3m or 3m + 1 for some integer m. [Hints : Let x    
( )
= 9 3q 3 + 3q 2 + q + 8 = 9m + 8
be any positive integer then it is of the form 3q, Thus, the cube of any positive integer is of the
3q + 1 or 3q + 2. Now square each of these and form 9m, 9m + 1 or 9m + 8 where m is any
show that they can be rewritten in the form 3m or positive integer. Hence Proved. [1]
 REAL NUMBERS |5
Q. 5. Show that the square of any positive integer is Hence, the square of any positive integer can be of the
either of the form 4q or 4q + 1 for some integer q. form 5q or 5q + 1 or 5q + 4 but it cannot be of the form
 [NCERT Exemp. Ex. 1.3, Q. 1, Page 6] of 5q + 2 or 5q + 3 where q is any positive integer.
Sol. According to Euclid's division lemma, any  Hence Proved
positive integer can be of the form of a = bq + r Q. 8. Show that the square of any positive integer
where 0 ≤ r < b [1] cannot be of the form 6m + 2 or 6m + 5 for any
In this case, b = 4, then r = 0, 1, 2, 3. integer m. [NCERT Exemp. Ex. 1.3, Q. 4, Page 6]
Thus, any positive integer can be of the form of Sol. According to Euclid's division lemma, any positive
4q, 4q + 1, 4q +2, 4q + 3. integer can be of the form of a = bq + r where
Now, ( 4q ) = 16q = 4 4q = 4m
2 2 2
( ) 0≤r<b
In this case, b = 6, then r = 0, 1, 2, 3, 4, 5.
[1]

(4 q + 1) = 16 q + 8q + 1 = 4 (4 q + 2q) + 1 = 4m + 1
2 2 2
Thus, any positive integer can be of the form of 6q,
6q + 1, 6q +2, 6q + 3, 6q + 4, 6q + 5.
(4 q + 2 ) = 16 q 2 + 16 q + 4 = 4 ( 4 q + 4 q + 1) = 4 m
2 2

Now, ( 6q ) = 36q 2 = 6 6q 2 = 6m
2
( )
(4 q + 3) = 16 q 2 + 24 q + 9 = 4 ( 4 q + 6 q + 2 ) + 1 = 4 m + 1
2 2

Thus, the square of any positive integer can be of the

( 6q + 1)
2
(
= 36q + 12q + 1 = 6 6q 2 + 2q + 1
2
)
form 4q or 4q + 1 where q is any positive integer. = 6m + 1
Hence Proved ( 6q + 2 )
2
( )
= 36q 2 + 24q + 4 = 6 6q 2 + 4q + 4
Q. 6. Show that cube of any positive integer is of the
= 6m + 4
form 4m, 4m + 1 or 4m + 3, for some integer m.
 [NCERT Exemp. Ex. 1.3, Q. 2, Page 6] ( 6q + 3)
2
( )
= 36q 2 + 36q + 9 = 6 6q 2 + 6q + 1 + 3
Sol. According to Euclid's division lemma, any positive
= 6m + 3
integer can be of the form of a = bq + r where
0≤r<b [1] ( 6q + 4 )
2
(
= 36q 2 + 48q + 16 = 6 6q 2 + 8q + 2 + 4 )
In this case, b = 4, then r = 0, 1, 2, 3.
= 6m + 4
Hence, any positive integer can be of the form of
4q, 4q + 1, 4q + 2, 4q + 3. ( 6q + 5 )
2
(
= 36q 2 + 60q + 25 = 6 6q 2 + 10q + 4 + 1 )
Now, ( 4q ) = 64q 3 = 4 16q 3 = 4m
3
( )     
= 6m + 1
[2]
Hence, the square of any positive integer can be of
( 4q + 1)
3
= 64q 3 + 48q 2 + 12q + 1 the form 6m, 6m + 1 or 6m + 3 or 6m + 4 but it
(
= 4 16q 3 + 12q 2 + 3q + 1 = 4m + 1 ) cannot be of the form of 6m + 2 or 6m + 5 where m
is any positive integer.  Hence Proved
( 4q + 2 )
3 3 2
= 64q + 96q + 24q + 8 Q. 9. Show that the square of any odd integer is of the
(
= 4 16q 3 + 48q 2 + 6q + 2 = 4m ) form 4q + 1, for some integer q.
 [NCERT Exemp. Ex. 1.3, Q. 5, Page 6]
( 4q + 3)
3 3 2
= 64q + 144q + 108q + 27 Sol. According to Euclid's division lemma, any positive
(
= 4 16q 3 + 36q 2 + 27 q + 6 + 3 = 4m + 3 [2] ) integer can be of the form of a = bq + r where
[1]
0≤r<b
Hence, the cube of any positive integer is of the In this case, b = 2, then r = 0, 1.
form 4m, 4m + 1 or 4m + 3, for some integer m.
Thus, any positive integer can be of the form of
Hence Proved 2q, 2q + 1.
Q. 7. Show that the square of any positive integer Since 2q +1 is not divisible by 2, 2q + 1 is an odd
cannot be of the form 5q + 2 or 5q + 3 for any integer.
integer q. [NCERT Exemp. Ex. 1.3, Q. 3, Page 6]
Sol. According to Euclid's division lemma, any positive
( )
Now, ( 2q + 1) = 4q 2 + 4q + 1 = 4 q 2 + q + 1 = 4m + 1[1]
2

Hence, the square of any odd integer is of the form

integer can be of the form of a = bq + r where
4m + 1, where m is any positive integer. [1]
0≤r<b [1]
In this case, b = 5, then r = 0, 1, 2, 3, 4. Q. 10. If n is an odd integer, then show that n2 – 1 is
divisible by 8.
Thus, any positive integer can be of the form of
5q, 5q + 1, 5q +2, 5q + 3, 5q + 4.  [NCERT Exemp. Ex. 1.3, Q. 6, Page 6]
Sol. Since n is an odd integer, on putting n = 2m+ 1, in
Now, ( 5q ) = 25q 2 = 5 5q 2 = 5m
2
( ) n2 – 1. [½]
( 5q + 1)
2
= 25q 2 + 10q + 1 = 5 5q 2 + 2q + 1 ( ) (n2 = 1) = (n + 1) (n – 1)
= 5m + 1 = (2m + 1 + 1) (2m + 1 – 1)
= (2m + 2) (2m) = 4m(m + 1) [1]
( 5q + 2 )
2
= 25q 2 + 20q + 4 = 5 5q 2 + 4q + 4 ( ) Now, m and (m + 1) are two consecutive numbers.
= 5m + 4 Their product will always be divisible by 2.
Let m ( m + 1) = 2k
( 5q + 3 )
2
= 25q 2 + 30q + 9 = 5 5q 2 + 6q + 1 + 4( ) [½]

= 5m + 4 (n 2
)
− 1 = ( n + 1)( n − 1) = ( 2m + 2 )( 2m + 1 − 1)
[1]
( 5q + 4 )
2 2
= 25q + 40q + 16 = 5 5q + 8q + 3 + 1 ( 2
) = 4m ( m + 1) = 4 × 2k = 8k
            = 5m + 1  [2] Hence, n2 – 1 is divisible by 8. Hence Proved.
6| OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

Q. 11. Prove that if x and y are both odd positive integers, And, product of given numbers = 26 × 91 = 2366
then x2 + y2 is even but not divisible by 4. Thus, LCM × HCF = Product of the two numbers.
 [NCERT Exemp. Ex. 1.3, Q. 7, Page 6]  Hence Proved. [1]
Sol. Since x and y are both odd positive integers, then Q. 15. Find the LCM and HCF of 510 and 92 and verify
on putting, x = 2m + 1 and y = 2n + 1. [1] that LCM × HCF = Product of the two numbers.
Now,  [NCERT Ex. 1.2, Q. 2 (ii), Page 6]
x 2 + y 2 = ( 2m + 1) + ( 2n + 1)
2 2
Sol. Prime factorisation of 510 = 2 × 3 × 5 × 17
2 2 Prime factorisation of 92 = 2 × 2 × 23 [1]
= 4m + 4 m + 1 + 4 n + 4 n + 1
Thus, HCF = 2 and LCM = 2 × 2 × 3 × 5 × 17 × 23
( )
= 4 m2 + m + n2 + n + 2 = 23460
= 4k + 2 [2] Now, HCF × LCM = 2 × 23460 = 46920 [1]
Since 4k + 2 is an even number but it is not divisible And, product of given numbers = 510 × 92 = 46,920
by 4. Thus, LCM × HCF = Product of the two numbers. [1]
Hence, x2 + y2 is even but not divisible by 4.  Hence Proved.
 Hence Proved. Q. 16. Find the LCM and HCF of 336 and 54 and verify
Q. 12. Use Euclid's division algorithm to find the HCF of that LCM × HCF = Product of the two numbers.
441, 567 and 693.  [NCERT Ex. 1.2, Q. 2 (iii), Page 11]
 [NCERT Exemp. Ex. 1.3, Q. 8, Page 6] Sol. Prime factorisation of 336 = 2 × 2 × 2 × 2 × 3 × 7
Sol. Since 693 > 567, on using, the Euclid's division Prime factorisation of 54 = 2 × 3 × 3 × 3 [1]
lemma in 693 and 567. Thus, HCF =2 × 3 = 6 and LCM =24 ×33 × 7 = 3,024
we get, Now, HCF × LCM = 6 × 3024 = 18144 [1]
693 = 567 × 1 + 126 And, product of given numbers = 336 × 54 = 18144
567 = 126 × 4 + 63 Thus, LCM × HCF = Product of the two numbers. [1]
126 = 63 × 2 + 0 [2] Hence Proved.
Now, since the remainder is zero then, the divisor Q. 17. Find the LCM and HCF of 12, 15 and 21 by applying
will be HCF. the prime factorisation method.
Therefore, the HCF of 693 and 567 is 63.  [NCERT Ex. 1.2, Q. 3 (i), Page 11]
Now, we use the Euclid's division lemma in 441 and Sol. Prime factorisation of 12 =2 × 2 × 3 [½]
63. Prime factorisation of 15 = 3 × 5 [½]
441 = 63 × 7 + 0 [1] Prime factorisation of 21 = 3 × 7 [½]
Hence, HCF of (693, 567 and 441) = 63 Thus, HCF = 3 and [½]
Q. 13. Using Euclid's division algorithm, find the largest LCM = 2 × 2 × 3 × 5 × 7 = 420 [1]
number that divides 1251, 9377 and 15628 leaving Hence Proved
remainders 1, 2 and 3, respectively. Q. 18. Find the LCM and HCF of 17, 23 and 29 by applying
 [NCERT Exemp. Ex. 1.3, Q. 9, Page 6] the prime factorisation method.
Sol. If the largest number that divides a, b and c leaving  [NCERT Ex. 1.2, Q. 3 (ii), Page 11]
remainders p, q and r respectively, then the largest Sol. Prime factorisation of 17 = 1 × 17 [½]
number is HCF of (a – p), (b – q) and (c – r). [1] Prime factorisation of 23 = 1 × 23 [½]
Since 1251 – 1 = 1250, 9377 – 2 = 9375 and 15,628 – Prime factorisation of 29 = 1 × 29 [½]
3 = 15,625, we have to find HCF of 1250, 9375 and Thus, HCF = 1 and [½]
15625. LCM =17 × 23 × 29 = 11339 [1]
On using Euclid's division lemma in 15625 and Q. 19. Find the LCM and HCF of 8, 9 and 25 by applying
9375, we get the prime factorisation method.
15625 = 9375 × 1 + 6250  [NCERT Ex. 1.2, Q. 3 (iii), Page 11]
⇒ 9375 = 6250 × 1 + 3125 [1] Sol. Prime factorisation of 8 = 2 × 2 × 2 [½]
⇒ 6250 = 3125 × 2 + 0 Prime factorisation of 9 = 3 × 3 [½]
Thus, HCF (15625 and 9375) = 3125 Prime factorisation of 25 = 5 × 5 [½]
And now, on using Euclid's division lemma in 3125 Thus, HCF = 1 and [½]
and 1250, we get LCM = 23 × 32 × 52 = 1800 [1]
3125 = 1250 × 2 + 625 [1] Q. 20. Given that HCF (306, 657) = 9, find LCM (306, 657).
⇒ 1250 = 625 × 2 + 0  [NCERT Ex. 1.2, Q. 4, Page 11]
HCF of 1250, 9375 and 12625 is 625. Sol. HCF × LCM = Product of numbers [1]
Hence, the required largest number is 625. ⇒ 9 × LCM = 306 × 657
Q. 14. Find the LCM and HCF of 26 and 91 and verify that
306 × 657
LCM × HCF = Product of the two numbers. ∴ LCM = = 22338 [2]
 [NCERT Ex. 1.2, Q. 2 (i), Page 11] 9
Sol. Prime factorisation of 26 =2 × 13 Thus, LCM (306, 657) = 22338
Prime factorisation of 91 = 7 × 13 [1] Q. 21. On a morning walk, three persons step off
Thus, HCF = 13 and LCM = 2 × 7 × 13 = 182 together and their steps measure 40 cm, 42 cm and
Now, HCF × LCM = 13 × 182 = 2366 [1] 45 cm, respectively. What is the minimum distance
 REAL NUMBERS |7
each should walk so that each can cover the same Since it does not contain the factors of 10 as 2 × 5,
distance in complete steps? thus 6n cannot end with the digit 0 for any natural
 [NCERT Exemp. Ex. 1.3, Q. 12, Page 6] number n [1]
Sol. Here, required minimum distance will be LCM of Q. 24. There is a circular path around a sports field.
40, 42 and 45. [1] Sonia takes 18 minutes to drive one round of the
For the same, we have field, while Ravi takes 12 minutes for the same.
Suppose they both start at the same point and at
Prime factorisation of 40 = 23 × 5 the same time, and go in the same direction. After
Prime factorisation of 42 = 2 × 3 × 7 [1] how many minutes will they meet again at the
Prime factorisation of 45 = 3 × 5 2 starting point? [NCERT Ex. 1.2, Q. 7, Page 11]
Sol. Since Sonia takes 18 minutes to complete one
Therefore, LCM = 23 × 32 × 5 × 7 = 2,520 [1] round of circular path and Ravi takes 12 minutes to
Hence, the minimum distance that each should complete one round of circular path, the required
walk is 2520 cm. minutes that they will meet again at the starting
Q. 22. Find the HCF and LCM of 404 and 96 and verify point is LCM of (18, 12) [1]
that HCF × LCM = Product of two given numbers. Prime factorisation of 18 = 2 × 3 × 3
 [CBSE Board Exam, 2018] Prime factorisation of 12 = 2 × 2 × 3 [1]
Sol. Here, Prime factorisation of 404 = 2 × 2 × 101 Thus, LCM =2 × 2 × 3 × 3 = 36
And, Prime factorisation of 96 = 2 × 2 × 2 × 2 × 2 × 3 [1] Therefore, after 36 minutes will they meet again at
Therefore, HCF = 2 × 2 = 4 and the starting point. [1]
LCM = 25 × 3 × 101 = 9696 [1] Q. 25. Show that 12n cannot end with the digit 0 or 5 for
Since, HCF × LCM = 4 × 9696 = 38784 any natural number n.
And, product of given numbers = 404 × 96 = 38784  [NCERT Exemp. Ex. 1.3, Q. 11, Page 6]
Thus, LCM × HCF = Product of the two numbers. Sol. If a number ends with digit 0 or 5, then the number
 Hence Proved. [1] Now, ( 6q ) =by216
is divisible
3
( 36q3 ) =is6mdivisible by 5, then
5. qIf3 =a 6number
Q. 23. Check whether 6n can end with the digit 0 for any the prime 3factorisation must contain 5 as one of the
( 6q + 1) = 216q 2 + 108q 2 + 18q + 1
factor. [1]
natural number n. [NCERT Ex. 1.2, Q. 5, Page 11]
= 6 ( 36q 2 + 18q 2 + 3q ) + 1 n= 6m + 1
Now the prime factorisation of 12 = ( 2 × 2 × 3)
n
Sol. If a number ends with digit 0, then the prime
factorisation of the number must contain the ( 6q + 2 ) = 216q 2 + 216q 2 + 72q + 8 = 22n × 3n
3
[1]
factors of 10 as 2 × 5. [1]
Now the prime factorisation of
Since it does ( 36qcontain
= 6not 2 the
+ 36q 2 + + 1) + 5,
12qfactor 2 =implies
6m + 2 that
12n cannot3 end with the digit 0 or 5 for any natural
6n = ( 2 × 3) = 2n × 3n
n
[1] ( 6q + 3n.) = 216q 2 + 324q 2 + 162q +Hence
number 27 Proved. [1]
( )
= 6 36q 2 + 54q 2 + 27 q + 4 + 3 = 6m + 3

Long Answer Type Questions ( 6q + 4 )

3 2 2
= 216q + 432q + 288q (5
+ 64
marks each)
( )
= 6 36q 2 + 72q 2 + 48q + 10 + 4 = 6m + 4
Q. 1. Show that the cube of a positive integer of the
( 6q + 5 )
3 2 2
= 216q + 540q + 450q + 125
form of 6q + r, q is an integer and r = 0, 1, 2, 3, 4, 5
is also of the form of 6m + r. ( )
= 6 36q 2 + 90q 2 + 75q + 20 + 5 = 6m + 5 [3]
 [NCERT Exemp. Ex. 1.4, Q. 1, Page 7] Hence, the cube of a positive integer of the form 6q
Sol. According to Euclid's division lemma, any positive + r, q is an integer and r = 0, 1, 2, 3, 4, 5 is also of the
integer can be of the form of a = bq + r where form of 6m + r.
0≤r<b [1] Q. 2. Prove that one and only one out of n, n+2, n+4 is
In this case, b = 6, then r = 0, 1, 2, 3, 4, 5. divisible by 3, where n is any positive integer.
Thus, any positive integer can be of the form of 6q,  [NCERT Exemp. Ex. 1.4, Q. 2, Page 7]
6q + 1, 6q +2, 6q + 3, 6q + 4, 6q + 5. [1] Sol. Any positive integer is in the form of 3q, 3q + 1,
Now, ( 6q ) = 216q = 6 ( 36q ) = 6m
3 3 3
3q + 2. [1]
If n = 3q, then out of 3q , ( 3q + 2 ) , ( 3q + 4 ) only n
( 6q + 1)
3
= 216q 2 + 108q 2 + 18q + 1
= 3q is divisible by 3.
( )
= 6 36q 2 + 18q 2 + 3q + 1 = 6m + 1 If n = 3q + 1, then out of (3q + 1), (3q + 3) = 3(q +
1), (3q + 5) only (n + 2) = 3(q + 1) is divisible by 3.
( 6q + 2 )
3 2 2
= 216q + 216q + 72q + 8
If n = 3q + 2, then out of (3q + 2), (3q + 4), (3q +
( )
= 6 36q 2 + 36q 2 + 12q + 1 + 2 = 6m + 2 6) = 3(q + 2) only (n + 4) = 3(q + 2) is divisible by 3. [3]
Thus, one and only one out of n, n+2, n+4 is
( 6q + 3)
3 2 2
= 216q + 324q + 162q + 27 divisible by 3. Hence Proved. [1]
( )
= 6 36q 2 + 54q 2 + 27 q + 4 + 3 = 6m + 3 Q. 3. Prove that one of any three consecutive positive
integers must be divisible by 3.
( 6q + 4 )
3
= 216q 2 + 432q 2 + 288q + 64  [NCERT Exemp. Ex. 1.4, Q. 3, Page 7]
( )
= 6 36q 2 + 72q 2 + 48q + 10 + 4 = 6m + 4 Sol. Let the three consecutive positive integers are
n, ( n + 1) , ( n + 2 )
( 6q + 5 )
3 2 2
= 216q + 540q + 450q + 125 .

( )
= 6 36q 2 + 90q 2 + 75q + 20 + 5 = 6m + 5
8| OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

Any positive integer is in the form of If n = 5q + 3, then out of (5q + 3), (5q + 7), (5q + 11),
3q, 3q + 1, 3q + 2. [1] (5q + 15) = 5(q + 3), (5q + 19) only ( n + 12 ) = 5 ( q + 3)
is divisible by 5. [3]
If n = 3q, then out of 3q , ( 3q + 1) , ( 3q + 2 ) only n = 3q
If n = 5q + 4, then out of (5q + 4), (5q + 8), (5q +
is divisible by 3.
12), (5q + 16), (5q + 20) only (5q + 20) = 5(q + 4) is
If n = 3q + 1, then out of (3q + 1), (3q + 2), (3q + 3)
divisible by 5.
only ( n + 2 ) = 3 ( q + 1) is divisible by 3. Thus, one and only one out of n, n+4, n+8, n+12
If n = 3q + 2, then out of (3q + 2), (3q + 3), (3q + 4), and n + 16 is divisible by 5.
Hence Proved.
only ( n + 1) = 3 ( q + 1) is divisible by 3. [3]
Q. 6. “The product of three consecutive positive
Thus, one of any three consecutive positive integers
integers is divisible by 6”. Is this statement true or
must be divisible by 3. Hence Proved.
false”? Justify your answer.
 [1]
 [NCERT Exemp. Ex. 1.2, Q. 3, Page 4]
Q. 4. For any positive integer n prove that n3 – n is
Sol. True.
divisible by 6.
Let the product three consecutive positive integers
 [NCERT Exemp. Ex. 1.4, Q. 4, Page 7]
is p = n ( n + 1)( n + 2 ) .
( )
Sol. n3 − n = n n 2 − 1 = n ( n + 1)( n − 1) = ( n − 1) n ( n + 1) .
Any positive integer is in the form of 3q, 3q + 1 and
Any positive integer is in the form of 3q + 2. [1]
3q, 3q + 1, 3q + 2. [1] If n = 3q, then p = 3q ( 3q + 1)( 3q + 2 ) is divisible by 3.
If n = 3q, then ( n − 1) n ( n + 1) = ( 3q − 1)( 3q )( 3q + 1) is If n = 3q + 1, then p = (3q + 1)(3q + 2)(3q + 3) = 3(3q
divisible by 3. + 1)(3q + 2)(q + 1) is divisible by 3.
If n = 3q + 1, then ( n − 1) n ( n + 1) = 3q ( 3q + 1)( 3q + 2 ) If n = 3q + 2, then p = (3q + 2)(3q + 3)(3q + 4)
is divisible by 3. = 3(3q + 2)(q + 1)(3q + 4) is divisible by 3.
If n = 3q + 2, then (n – 1) n(n + 1) = (3q + 1) (3q + Thus, the product of three consecutive positive
2) (3q + 3) is divisible by 3. integers is divisible by 3. [2]
Thus, the product of three consecutive positive Again, any positive integer is in the form of 2m and
integers is divisible by 3. [2] 2m + 1
Again, any positive integer is in the form of 2m, 2m + 1 If n = 2m, then p = 2m ( 2m + 1)( 2m + 2 ) is divisible
If n = 2m, then (n – 1)n(n + 1) = (2m – 1)(2m)(2m by 2.
+ 1) is divisible by 2. If n = 2m + 1, then p = (2m + 1)(2m + 2)(2m + 3)
If n = 2m + 1, then (n – 1)n(n + 1) = (2m)(2m + 1) = 2(2m + 1)(m + 1)(2m + 3) is divisible by 2.
(2m + 2) is divisible by 2. Thus, the product of three consecutive positive
Thus, the product of three consecutive positive integers is also divisible by 2.
integers is also divisible by 2. Therefore, the product of three consecutive positive
Therefore, n3 – n is divisible by 2 × 3 = 6 . integers is divisible by 2 × 3 = 6 . [2]
 Hence Proved. [2] Q. 7. Write whether the square of any positive integer
Q. 5. Show that one and only one out of n, n+4, n+8, can be of the form 3m + 2, where m is a natural
n+12 and n+16 is divisible by 5, where n is any number. Justify your answer.
positive integer.  [NCERT Exemp. Ex. 1.2, Q. 4, Page 4]
 [NCERT Exemp. Ex. 1.4, Q. 5, Page 7] Sol. No.
Sol. According to Euclid's division lemma, any positive According to Euclid's division lemma, any positive
integer can be of the form of a = bq + r where integer can be of the form of a = bq + r where
0≤r<b [1] 0≤r<b [1]
In this case, b = 5, then r = 0, 1, 2, 3, 4. In this case, b = 3, then r = 0, 1, 2.
Thus, any positive integer can be of the form of 5q, Thus, any positive integer can be of the form of
5q + 1, 5q +2, 5q + 3, 5q + 4. [1] 3q, 3q + 1, 3q +2. [1]
If n = 5q, then out of 5q , ( 5q + 4 ) , ( 5q + 8 ) , ( 5q + 12 ) , ( )
Now, ( 3q ) = 9q 2 = 3 3q 2 = 3m
2

(5q + 16) only n = 5q is divisible by 5.

( 3q + 1) = 9q + 6q + 1 = 3 ( 3q + 2q ) + 1 = 3m + 1
2 2 2
If n = 5q + 1, then out of (5q + 1), (5q + 5) = 5(q +
1), (5q + 9), (5q + 13), (5q + 17) only ( n + 4 ) = 5 ( q + 1) + 12q + 4 = 3 ( 3q + 4q + 1) + 1 = 3m + 1 [3]
 ( 3q + 2 ) = 9q
2 2 2

is divisible by 5.
Thus, the square of any positive integer can be
If n = 5q + 2, then out of (5q + 2), (5q + 6), (5q + 10)
of the form 3m or 3m + 1, where m is a natural
= 5(q + 2), (5q + 14), (5q + 17) only ( n + 8 ) = 5 ( q + 2 )
number. It cannot be of the form of 3m + 2.
is divisible by 5.
 REAL NUMBERS |9

TOPIC-2
Rational and Irrational Numbers

Quick Review TIPS…

If p is a prime number and let p divides a2, then p
™™ Rational Number : A rational number that can be divides a where a is a positive integer.
p
represented in the form of , where q ≠ 0 . The sum and the difference of a rational and an ir-
p q
™™ In this case , when the numerator p is divided by q, rational number is an irrational number.
q
The product and quotient of a non-zero rational
then its decimal expansion is terminating or non- and irrational number is irrational.
terminating and recurring decimal.
™™ Hence, the rational number is a terminating or non- The product and quotient of two irrational number
terminating and recurring decimal number. may or may not be irrational.
™™ Irrational Number : A number that cannot be
p
represented in the form of , where q ≠ 0 .
q TRICKS…
p p
™™ In this case , when the numerator p is divided by q, To check that a rational number is terminating
q q
then its decimal expansion is non-terminating and or non-terminating, do the prime factorisation of
non-recurring decimal. the denominator q. If the prime factorisation of the
™™ Hence, the irrational number is a non-terminating denominator q is in the form of 2m5n, then it is a ter-
and recurring decimal number. minating decimal otherwise it is a non-terminating
decimal.
Know the Links
☞ https://en.wikipedia.org/wiki/Irrational_number
☞ https://www.emathhelp.net/notes/pre-algebra/irrational-numbers/
☞ http://examples.yourdictionary.com/examples-of-irrational-numbers.html

Multiple Choice Questions (1 mark each)

Q. 1. The product of a non-zero rational and an (a) one decimal place. (b) two decimal places.
irrational number is (c) three decimal places. (d) four decimal places.
(a) always irrational. (b) always rational.  [NCERT Exemp. Ex. 1.1, Q. 10, Page 3]
(c) rational or irrational. (d) one. Sol. Correct option : (d)
 [NCERT Exemp. Ex. 1.1, Q. 8, Page 3] Explanation :
Sol. Correct option : (a) 14587 14587 14587 24
Explanation : The product of a non-zero rational = = ×
1250 2 × 54 2 × 54 2 4
with and an irrational number is always irrational.
14587 × ( 2 )
3
Q. 2. The decimal expansion of the rational number 116,696
= 4
= = 11.6696
14587 will terminate after 10 10000
1250 Thus, the given rational number terminates after
four decimal places.

Very Short Answer Type Questions (2 marks each)

Q. 1. Without actually performing the long division, Sol. Prime factorisation of 3125 = 55. [1]
13 13
state whether the rational number will Since the denominator is in the form of 5m, is
3125 3125
a terminating decimal. [1]
have a terminating decimal expansion or a non-
Q. 2. Without actually performing the long divi-
terminating repeating decimal expansion.
17
 [NCERT Ex. 1.4, Q. 1(i), Page 17] sion, state whether the rational number will
8
10 | OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

have a terminating decimal expansion or a non- Q. 8. Without actually performing the long division,
terminating repeating decimal expansion. 6
state whether the rational number will have
 [NCERT Ex. 1.4, Q. 1(ii), Page 17] 15
a terminating decimal expansion or a non-
Sol. Prime factorisation of 8 = 23. [1]
terminating repeating decimal expansion.
m 17
Since the denominator is in the form of 2 , is a  [NCERT Ex. 1.4, Q. 1(viii), Page 17]
terminating decimal. 8 [1]
6 2
Sol. = [1]
Q. 3. Without actually performing the long division, 15 5
state whether the rational number 64 will Since the denominator is in the form of 2m5n,
455 6
have a terminating decimal expansion or a non- therefore is a terminating decimal. [1]
terminating repeating decimal expansion. 15
Q. 9. Without actually performing the long division,
 [NCERT Ex. 1.4, Q. 1(iii), Page 17] 35
state whether the rational number will
Sol. Prime factorisation of 455 = 5 × 7 × 13 [1] 50
64 have a terminating decimal expansion or a non-
Since the denominator of is not in the form of
455 terminating repeating decimal expansion.
64  [NCERT Ex. 1.4, Q. 1(ix), Page 17]
2m5n therefore, is a non-terminating decimal. Sol. Prime factorisation of 50 = 2 × 52 [1]
 455
m n 35
[1] Since the denominator is in the form of 2 5 , is
50
Q. 4. Without actually performing the long division, a terminating decimal. [1]
15 Q. 10. Without actually performing the long division,
state whether the rational number will
1600 77
state whether the rational number will
have a terminating decimal expansion or a non- 210
have a terminating decimal expansion or a non-
terminating repeating decimal expansion. terminating repeating decimal expansion.
 [NCERT Ex. 1.4, Q. 1(iv), Page 17]  [NCERT Ex. 1.4, Q. 1(x), Page 17]
Sol. Prime factorisation of 1600 = 26 × 52 . [1] 77 11
Since the denominator is in the form of 2m5n, Sol. =
210 30
15 Prime factorisation of 30 = 2 × 3 × 5 [1]
therefore is a terminating decimal. [1]
1600 Since the denominator is not in the form of 2m5n,
Q. 5. Without actually performing the long division, 77
therefore is a non-terminating decimal. [1]
29 210
state whether the rational number will 13
343 Q. 11. Write down the decimal expansion of .
3125
have a terminating decimal expansion or a non-  [NCERT Ex. 1.4, Q. 2(i), Page 18]
terminating repeating decimal expansion.
13 13 13 × 25 416
 [NCERT Ex. 1.4, Q. 1(v), Page 17] Sol. = = = = 0.00416 [2]
3125 55 55 × 25 100000
Sol. Prime factorisation of 343 = 7 × 7 × 7 [1]
29 17
Since the denominator of is in not the form of Q. 12. Write down the decimal expansion of
343 8 .
29  [NCERT Ex. 1.4, Q. 2(ii), Page 18]
2m5n, therefore, is a non-terminating decimal.
 343 [1] 17 17 17 × 53 2125
Sol. = = = = 2.125 [2]
Q. 6. Without actually performing the long division, 8 23 23 × 53 1000
23 15
state whether the rational number 3 2 will Q. 13. Write down the decimal expansions of .
25 1600
have a terminating decimal expansion or a non-  [NCERT Ex. 1.4, Q. 2(iv), Page 18]
terminating repeating decimal expansion.
15 15 15 × 54 9375
 [NCERT Ex. 1.4, Q. 1(vi), Page 17] Sol. = 4 = 4 = = 0.009375
Sol. Since the denominator is in the form of 2m5n, 1600 2 × 100 2 × 100 × 54 1000000
23 [2]

therefore 3 2 is a terminating decimal. [2]
25 23
Q. 7. Without actually performing the long division, Q. 14. Write down the decimal expansion of 3 2 .
25
129
state whether the rational number 2 7 5 will  [NCERT Ex. 1.4, Q. 2(vi), Page 18]
257
have a terminating decimal expansion or a non- 23 23 × 5 115
Sol. = 3 2 = = 0.115 [2]
terminating repeating decimal expansion. 253 2
2 × 5 × 5 1000
6
 [NCERT Ex. 1.4, Q. 1(vii), Page 17] Q. 15. Write down the decimal expansion of .
15
129
Sol. Since the denominator of is not in the form
2 7 7
 [NCERT Ex. 1.4, Q. 2(viii), Page 18]
255
6 2 2× 2 4
129 Sol. = = = = 0.4 [2]
of 2m5n, is a non-terminating decimal. [2] 15 5 5 × 2 10
2257 75
 REAL NUMBERS | 11
35 p
Q. 16. Write down the decimal expansion of . rational or not. If it is rational, and of the form,
50 q
what can you say about the prime factors of q?
 [NCERT Ex. 1.4, Q. 2(ix), Page 18]  [NCERT Ex. 1.4, Q. 3(iii), Page 17]
35 7 Sol. The given decimal expansion of the real number is
Sol. = = 0. 7 [2]
50 10 non-terminating and recurring decimal. Thus, it is a
Q. 17. The real number has decimal expansion as rational number and it can be written in the form of
p
43.123456789. In this case, decide whether it is and the denominator q is in the form of 2m5n. [2]
p q
rational or not. If it is rational, and of the form,
what can you say about the prime factors of q? q Q. 20. Without actually performing the long division,
 [NCERT Ex. 1.4, Q. 3(i), Page 17] 987
find if will have terminating or non-
Sol. The given decimal expansion of the real number is 10500
terminating decimal. Thus, it is a rational number
terminating (repeating) decimal expansion. Give
p
and it can be written in the form of and the reasons for your answer.
denominator q is in the form of 2m5n. q [2]  [NCERT Exemp. Ex. 1.2, Q. 9, Page 4]
Q. 18. The real number has decimal expansion as Sol. Prime factorisation of 10,500 = 22 × 3 × 53 × 7 [1]
0.120120012000120000..... In this case, decide Since the denominator is in not the form of 2m5n,
whether it is rational or not. If it is rational, and 987
p therefore is a non-terminating decimal. [1]
of the form, what can you say about the prime 10,500
q
Q. 21. A rational number in its decimal expansion is
factors of q? 327.7081. What can you say about the prime factors
 [NCERT Ex. 1.4, Q. 3(ii), Page 17, Page 17] p
of q, when this number is expressed in the form ?
Sol. The given decimal expansion of the real number q
Give reasons.
is non-terminating and non-recurring decimal.  [NCERT Exemp. Ex. 1.2, Q. 10, Page 4]
Thus, it is a not a rational number and it cannot be Sol. The given decimal expansion of a real number is a
p
written in the form of and the denominator q is terminating decimal. Thus, it is a rational number
q
p
not in the form of 2m5n. [2] and it can be written in the form of and the
q
Q. 19. The real number has decimal expansion as
43.123456789 . In this case, decide whether it is denominator q will have prime factors in the form
of the form of 2m5n. [2]

Short Answer Type Questions (3 marks each)

Q. 1. Prove that 3 + 2 5 is an irrational number. 1

Thus, is an irrational number.
 [NCERT Ex. 1.3, Q. 2, Page 14] 2
Sol. We prove this by using the method of contradiction. Q. 3. Prove that 7 5 is an irrational number.
 [NCERT Ex. 1.3, Q. 3(ii), Page 14]
Assume that 3 + 2 5 is a rational number.
p Sol. We prove this by using the method of contradiction.
Then, 3 + 2 5 = where HCF (p, q) = 1 [1]
q Assume that 7 5 is a rational number.
p p 1  p − 3q  p
Now,3 + 2 5 = ⇒ 2 5 = − 3 ⇒ 5 =   ...(i) Then, 7 5 = where HCF (p, q) = 1 [1]
 q q 2  q  [1] q
p p
Since LHS of equation (i) is an irrational number Now, 7 5 = ⇒ 5 = ...(i)
whereas RHS of equation (i) is a rational number, [1] q 7 q
the equation (i) contradicts our assumption. Since LHS of equation (i) is an irrational number
whereas RHS of equation (i) is a rational number,
Thus, 3 + 2 5 is an irrational number. [1] the equation (i) contradicts our assumption.
1
Q. 2. Prove that is an irrational number. Thus, 7 5 is an irrational number. [1]
 2 [NCERT Ex. 1.3, Q. 3(i), Page 14] Q. 4. Prove that 6 + 2 is an irrational number.
Sol. We prove this by using the method of contradiction.  [NCERT Ex. 1.3, Q. 3(iii), Page 14]
1 Sol. We prove this by using the method of contradiction.
Assume that is a rational number.
2 Assume that 6 + 2 is a rational number.
1 p p
Then, = where HCF (p, q) = 1 [1] Then, 6 + 2 = where HCF (p, q) = 1 [1]
2 q q
p p p − 6q
1 p q Now, 6 + 2 = ⇒ 2 = − 6 ⇒ 2 = ...(i)
Now, =⇒ 2 = ...(i)  q q q [1]
 2 q p [1] Since LHS of equation (i) is an irrational number
Since LHS of equation (i) is an irrational number whereas RHS of equation (i) is a rational number,
whereas RHS of equation (i) is a rational number, the equation (i) contradicts our assumption.
the equation (i) contradicts our assumption. [1]
Thus, 6 + 2 is an irrational number. [1]
12 | OSWAAL NCERT SOLUTIONS – Textbook + Exemplar – MATHEMATICS : Class-X

Q. 5. Prove that 3 + 5 is irrational. are primes. [NCERT Exemp. Ex. 1.3, Q. 14, Page 7]
 [NCERT Exemp. Ex. 1.3, Q. 10, Page 6] Sol. We prove this by using the method of contradiction.
Sol. We prove this by using the method of contradiction. Assume that p + q is a rational number.
Assume that 3 + 5 is a rational number. a
Then, p + q = where HCF (a, b) = 1 [1]
p b
Then, 3 + 5 = where HCF (p, q) = 1 [1] a
q Now, p + q =
p b
Now, 3 + 5 = Squaring both sides, we get
q
a2 a2
( )
2
Squaring both sides, we get p + q = 2 ⇒ p + q + 2 pq = 2
b b
p2 p2
( )
2
3 + 5 = 2 ⇒ 3 + 5 + 2 15 = 2 a2 1  a2 
q q ⇒ 2 pq = 2 − p − q ⇒ pq =  2 − p − q   (i)
 b 2  b 
p2 p 2 − 8q 2
⇒ 2 15 = −8 ⇒ 15 = ...(i) [1]
q2 2q 2
 Since LHS of equation (i) is an irrational number
[1] whereas RHS of equation (i) is a rational number,
Since LHS of equation (i) is an irrational number the equation (i) contradicts our assumption. [1]
whereas RHS of equation (i) is a rational number,
Hence, p + q is an irrational number.
the equation (i) contradicts our assumption. [1]
Thus, 3 + 5 is an irrational number. Q. 8. Given that 2 is an irrational number, then prove
Q. 6. Write the denominator of the rational number ( )
that 5 + 3 2 is an irrational number.
257  [CBSE Board, All India Region, 2018]
in the form of 2m × 5n, where m and n are Sol. We prove this by using the method of contradiction.
5000
non-negative integers. Hence, write its decimal ( )
Assume that 5 + 3 2 is an rational number.
expansion, without actual division.
 [NCERT Exemp. Ex. 1.3, Q. 13, Page 7] (a
b
)
Then, 5 + 3 2 = where HCF (a, b) = 1 [1]

Sol. The denominator of the rational number 257 is Now,

5000 [1]
5000. (5 + 3 2 ) = ba ⇒ 3 2=
a
b
−5
(i)
Thus, 5000 = 2 × 2 × 2 × 5 × 5 × 5 × 5 = 23 × 54 [1]
 1  a − 5b  [1]
⇒ 2= 
3  b 
257 257 257 × 2 514
Now, = 3 4 = 3 4 = = 0.0514 [1] Since LHS of equation (i) is an irrational number
5000 2 × 5 2 × 5 × 2 10000 whereas RHS of equation (i) is a rational number,
Q. 7. Prove that p + q is an irrational, where p and q the equation (i) contradicts our assumption. [1]
( )
Thus, 5 + 3 2 is an irrational number.

Long Answer Type Question (5 marks)

5 is irrational.
Q. 9. Prove that Since a2 is a multiple of 5, so a is also a multiple of 5.
 [NCERT Ex. 1.3, Q. 1, Page 14] Let a = 5m
( 5m )
2
Sol. We prove this by using the method of contradiction. = 5b 2 ⇒ 25m 2 = 5b 2 ⇒ b 2 = 5m 2 [1]
2
Assume that 5 is a rational number. Since b is a multiple of 5, so b is also a multiple of 5.
a Let b = 5n
Then, 5 = where HCF (a, b) = 1  ...(i)
b Thus, HCF of (a, b) = 5 ...(ii)
 [1]
[1]
a From (i) and (ii), we get that our assumption was
5= ⇒ a = 5b ⇒ a 2 = 5b 2 [1]
b wrong. Therefore, 5 is not a rational number, it is
an irrational number. [1]

Some Commonly Made Errors

¾¾ Students do not care about the comparison of remainder and divisors.
¾¾ Students forget that the remainder is always positive and less than the divisor.
¾¾ If LCM is not divisible by HCF, then HCF and LCM are not the same set of two numbers. For example : HCF =
16 and LCM = 360 cannot be the HCF and LCM of any two numbers as LCM = 360 is not divisible by HCF = 16.
 REAL NUMBERS | 13
p
¾¾ If the prime factorisation of the denominator q of is not in the form of 2m5n, then it does mean that it is not a
q
rational number. After this, we need to check the repetition of the digits after the decimal. If there is a repetition
of digits after decimal point, then it is non-terminating and recurring, and hence it is a rational number.

EXPERT ADVICE
☞☞ An algorithm is a series of well-defined steps which gives a procedure for solving various types of problems.
☞☞ A lemma is proven statements that is used for proving another statement.
☞☞ If N = aq1 and N = bq2 , then N is the LCM of (a, b)
☞☞ If a = Nq1 and b = Nq2 , then N is the HCF of (a, b)
p
☞☞ To know that the digits after decimal point in the division of is a recurring decimal, we need to do the long divi-
q
p.
sion method in
q

OSWAAL LEARNING TOOLS

For Suggested Online Videos

Visit : https://www.youtube.com/watch?v=CElJ2AttNNc Or Scan the Code

https://www.youtube.com/watch?v=vbPUS-0Wbv4 Or Scan the Code

https://www.mathcelebrity.com/euclidalgo.php Or Scan the Code

https://youtu.be/wZW5XzmAvk0?t=287 Or Scan the Code

  