Real Numbers

Objective Section (1 mark each)

Multiple Choice Questions ⇒ HCF (12, 21, 15) = 31 = 3

⇒ LCM (12, 21, 15) = 22 × 31 × 51 × 71 = 420
Q. 1. The total number of factors of a prime
\ Option (c) is correct.  Ans.
number is : [CBSE Delhi Set 1, 2020]
(a) 1 (b) 0 Q. 3. The sum of exponents of prime factors in
(c) 2 (d) 3 the prime-factorisation of 196 is 
Ans. As we know that prime numbers are the [CBSE OD, Set 1, 2020]
numbers with only two factors, 1 and the (a) 3 (b) 4
number itself. (c) 5 (d) 2
\ Total number of factors of a prime number Ans. Prime factors of 196 = 22 × 72
will be 2.
So, sum of exponents = 2 + 2 = 4
\ Option (c) is correct. Ans.
Q. 2. The HCF and the LCM of 12, 21, 15 \ Option (b) is correct. Ans.
respectively are [CBSE Delhi Set 1, 2020] Q. 4. Euclid‘s division Lemma states that for
(a) 3, 140 (b) 12, 420 two positive integers a and b, there exists
(c) 3, 420 (d) 420, 3 unique integer q and r satisfying a = bq + r,
Ans. 2 12 and [CBSE OD, Set 1, 2020]
3 21 3 15
2 6 7 7 5 5 (a) 0 < r < b (b) 0 < r ≤ b
3 3 1 1 (c) 0 ≤ r < b (d) 0 ≤ r ≤ b
1 Ans. Euclid‘s division Lemma states that
for two positive integers a and b, there
\ Prime factors of 12, 21 and 15 are exist unique integers q and r satisfying
12 = 2 × 2 × 3 = 22 × 31 a = bq + r, and 0 ≤ r < b.
21 = 3 × 7 = 31 × 71 \ Option (c) is correct.  Ans.
15 = 3 × 5 = 31 × 51

Very Short Answer Type Questions (1 mark each)

Q.  1. If HCF (336, 54) = 6, find LCM (336, 54). 3 = 1­·­732 .....
 [CBSE OD, Set 1, 2019]
So, a rational number between 2 and
Ans. Given, HCF (336, 54) = 6 3 is 1·5.
We know, Q. 3. Two positive integers a and b can be
HCF × LCM = one number × other number written as a = x3y2 and b = xy3. x, y are
prime numbers. Find LCM (a, b).
⇒ 6 × LCM = 336 × 54  [CBSE Delhi, Set 3, 2019]
336 × 54
⇒ LCM = Ans. Given, a = x3y2 and b = xy3
6
= 336 × 9 ⇒ L.C.M (a, b) = Product of the greatest
= 3024 power of each prime factors
Q. 2. Find a rational number between 2 = x3y3
and 3. [CBSE Delhi, Set 1, 2019]
Q. 4. What is the HCF of smallest prime
Ans. As 2 = 1·414 .... number and the smallest composite
number ? [CBSE, 2018]
Ans. Smallest prime number = 2 Prime factorisation of 2 is 1 × 2
Smallest composite number = 4 Prime factorisation of 4 is 1 × 22
∴ HCF (2, 4) = 2

Short Answer Type Questions-I (2 marks each)

Q. 1. Write the smallest number which is Q. 4. Given that 2 is irrational, prove that
divisible by both 306 and 657. (5 + 3 2 ) is an irrational number. 
 [CBSE OD, Set 1, 2019]  [CBSE 2018]
Ans. Smallest number which is divisible by 306 Ans. Given, 2 is irrational number.
and 657 is,
Let 2 = m
LCM (657, 306)
657 = 3 × 3 × 73 Suppose, 5 + 3 2 is a rational number.
a
306 = 3 × 3 × 2 × 17 So, 5+3 2 = (a ≠ b, b ≠ 0)
b
LCM = 3 × 3 × 73 × 2 × 17 a
3 2 = −5
= 22338 b
Q. 2. Find the HCF of 1260 and 7344 using 3 2 = − 5b
a
Euclid‘s algorithm. b
 [CBSE Delhi, Set 1, 2019] a − 5b
or 2=
Ans. Two numbers are 1260 and 7344 3b
a − 5b
Since 7344 > 1260, we apply the Euclid So, =m
3b
division lemma to 7344 and 1260, we get
But a − 5b is rational number, so m is
7344 = 1260 × 5 + 1044 3b
Also, 1260 = 1044 × 1 + 216 rational number which contradicts the
1044 = 216 × 4 + 180
fact that m = 2 is irrational number.
216 = 180 × 1 + 36
So, our supposition is wrong.
180 = 36 × 5 + 0
Now, remainder is 0, hence our procedure Hence, 5 + 3 2 is also irrational.
stops here.  Hence Proved.
Q. 5. Express 23150 as product of its prime
\ H.C.F. of 7344 and 1260 is 36.
factors. Is it unique ?
Q.  3. Show that every positive odd integer is  [CBSE Term 1, 2016]
of the form (4q + 1) or (4q + 3), where q is
some integer. [CBSE Delhi, Set 1, 2019] Ans. Prime factors of 23150 = 2 × 5 × 5 × 463
Ans. Let ‘a’ be any positive odd integer. As per the fundamental theorem of
Arithmetic every number has a unique
We apply the division algorithm with a
factorisation.
and b = 4
2 23150
a = bq + r, where 0 ≤ r < b
or a = 4q + r, 5 11575
the possible remainders are 0, 1, 2, 3 5 2315
Then when r = 0, ⇒ a = 4q 463 463
r = 1, ⇒ a = 4q + 1 1
r = 2, ⇒ a = 4q + 2
Q.  6. State whether the real number 52.0521 is
and when r = 3, ⇒ a = 4q + 3 rational or not. If it is rational express it
Since a is odd, a cannot be 4q or 4q + 2 p
in the form , where p, q are co-prime,
(Since both are divisible by 2) q
integers and q ≠ 0. What can you say
Therefore, any odd integer is of the form
about prime factorisation of q ?
4q + 1 or 4q + 3. Hence Proved.
 [CBSE Term 1, 2016]
Ans. 52.0521
520521 written in the form of p , so a is rational,
⇒ 52.0521
= q 3b
10000
and so 7 is rational.
Yes, it is rational number.
But this contradicts the fact that 7 is
where q = 10000 = 24 × 54 irrational. So, we conclude that 3 7 is
The given decimal expression is a irrational.  Hence Proved.
terminating decimal as the factors of q Q.  8. Explain why (17 × 5 × 11 × 3 × 2 + 2 × 11)
consist only 2 and 5. is a composite number?
Q.  7. Show that 3 7 is an irrational number.  [CBSE Term 1, 2015]
 [CBSE Term 1, 2015] Ans. 17 × 5 × 11 × 3 × 2 + 2 × 11
Ans. Let us assume, to the contrary, that 3 7 is = 17 × 5 × 3 × 22 + 22
rational.
= 22 (17 × 5 × 3 + 1)
That is, we can find co-prime a and
a = 22 (255 + 1) = 2 × 11 × 256 ...(i)
b (b ≠ 0) such that 3 7 =
b Equation (i) is divisible by 2, 11 and 256,
a
Rearranging, we get 7 = which means it has more than 2 prime
3b factors.
a
Since 3, a and b are integers, can be ∴ (17 × 5 × 11 × 3 × 2 + 2 × 11) is a com-
3b
posite number.

Short Answer Type Questions-II (3 marks each)

Q.  1. Prove that 2 + 5 3 is an irrational num- Step II: Because remainder 128 ≠ 0, so, on
ber, given that 3 is an irrational number. applying Euclid’s algorithm between 960
 [CBSE OD, Set 1, 2019] and 128, we get
Ans. Let 2 + 5 3 = r, where, r is rational. 960 = 128 × 7 + 64
\ (2 + 5 3 )2 = r2 Step III: Again remainder 64 ≠ 0, so
128 = 64 × 2 + 0
4 + 75 + 20 3 = r2
Here remainder is 0. So, process ends here.
79 + 20 3 = r2
And dividend is 64 so, required HCF is 64.
20 3 = r2 – 79
Q.  3. Prove that 2 is an irrational number.
r 2 − 79
3 =  [CBSE Delhi, Set 1, 2019]
20
r 2 − 79 Ans. Let2 is a rational number.
Now, is a rational number. So, 3 a
20 So, 2 = where a and b are co-prime
must also be a rational number. But 3 is b
integers and b ≠ 0
an irrational number (Given).
So, our assumption is wrong. or 2 b = a
Squaring on both sides, we get
\ 2 + 5 3 is an irrational number.
2b2 = a2...(i)
 Hence Proved. Therefore, 2 divides a2
Q. 2. Using Euclid’s Algorithm, find the HCF or 2 divides a (from theorem)
of 2048 and 960. [CBSE OD, Set 1, 2019] Let a = 2c, for some integer c
Ans. Step I: Here 2048 > 960. So, on applying From equation (i)
Euclid‘s algorithm, we get 2b2 = (2c)2
2048 = 960 × 2 + 128 or 2b2 = 4c2
or b2 = 2c2
 It means that 2 divides b2 and so 2 divides b 5a
or 2+ 3 =
Therefore a and b have at least 2 as a b
common factor. But this contradicts the 5a 2
fact that a and b are co-prime. 3 = −
b 1
This contradiction is due to our wrong
5 a − 2b
assumption that 2 is rational. 3 =
b
So, we conclude that 2 is irrational.
Hence Proved. In R.H.S., a, b, 2 and 5 are integers.
\ R.H.S. is a rational number but L.H.S. =
2+ 3
Q.  4. Prove that is an irrational number, 3 , which is given that 3 is an irrational.
5 So, it is a contradiction.
given that 3 is an irrational number.
 [CBSE Delhi, Set 3, 2019] Hence, 2 + 3 is an irrational number.
2 + 3 5
Ans. Let is a rational number Hence Proved.
5
2+ 3 a Q. 5. Find HCF and LCM of 404 and 96 and
\ = , where a and b are co-prime verify that HCF × LCM = Product of the
5 b
numbers. two given numbers. [CBSE 2018]

Topper’s Answers

Ans. Prime factorisation of 404 = 2 × 2 × 101

2 404 2 96 Prime factorisation of 96
2 202 2 48 =2×2×2×2×2×3
101 101 2 24 ∴ HCF = 2 × 2 = 4
1 2 12 And LCM = 2 × 2 × 2 × 2 × 2 × 3 × 101
= 9696
2 6
∴ HCF = 4, LCM = 9696
3 3
Verification
1
HCF × LCM = Product of two numbers
 4 × 9696 = 404 × 96 1800 = 2 × 2 × 2 × 3 × 3 × 5 × 5
38784 = 38784 Hence Verified. then, HCF = 2 × 3 × 5 = 30
Q.  6. Find LCM and HCF of 3930 and 1800 by and, LCM = 2 × 3 × 5 × 131 × 2 × 2 × 3 × 5
prime factorisation method. = 235800
 [CBSE, Term 1, 2016] Q.  7. The length, breadth and height of a room
Ans. By prime factorisation method, are 8 m 50 cm, 6 m 25 cm and 4 m 75 cm
respectively. Find the length of the longest
Factors of 3930 and 1800 are,
rod that can measure the dimensions of
2 3930 2 1800 the room exactly. [CBSE Term 1, 2015]
3 1965 2 900 Ans. To find the length of the longest rod that
2 450 can measure the dimensions of the room
5 655
exactly, we have to find HCF.
131 131 3 225
Length, L = 8 m 50 cm = 850 cm
1 3 75
= 21 × 52 × 17
5 25 Breadth, B = 6 m 25 cm = 625 cm = 54
5 5 Height, H = 4 m 75 cm = 475 cm = 52 × 19
1 ∴ HCF of L, B and H is 52 = 25 cm

∴ Length of the longest rod = 25 cm
So, 3930 = 2 × 3 × 5 × 131

Long Answer Type Questions (4 marks each)

Q. 1. Show that the square of any positive = 5(5m2 + 4m) + 4

integer cannot be of the form (5q + 2) or (5q = 5q + 4, where q = 5m2 + 4m
+ 3) for any integer q. Case IV : a = 5m + 3
 (CBSE Delhi Set 1, 2020) a2 = (5m + 3)2
Ans. Let a be the given positive integer. = 25m2 + 9 + 2 (5m) (3)
 To prove : a2 cannot be of the from (5q + 2) = 25m2 + 30m + 9
or (5q + 3) for any integer q. = 5(5m2 + 6m) + 5 + 4
Proof : By Euclid‘s division lemma,
= 5 (5m2 + 6m + 1) + 4
a = bm + r, 0 ≤ r < b
= 5q + 4, where q = 5m2 + 6m + 1
Let b = 5
Case V : a = (5m + 4)
\ r = 0, 1, 2, 3 and 4.
a2 = (5m + 4)
⇒ a = 5m, 5m + 1, 5m + 2, 5m + 3 and 5m + 4.
= 25m2 + 16 + 2(5m) (4)
Case I : a = 5m
a2 = (5m)2 = 25m2 + 40m + 16
= 25m2 = 25m2 + 40m + 15 + 1
= 5(5m)2 = 5(5m2 + 8m + 3) + 1
= 5(q) = 5q + 1, where q = 5m2 + 8m + 3.
= 5q, where q = 5m2 \  a2 is of the form 5q, 5q + 1, 5q + 4 but not
Case II : a = 5m + 1 of the form 5q + 2 or 5q + 3 for any integer
q. Hence Proved.
a2 = (5m + 1)2
= 25m2 + 1 + 2(5m) (1) Q. 2. Prove that one of every three consecutive
positive integers is divisible by 3.
= 25m2 + 10m + 1
= 5(5m2 + 2m) + 1 (CBSE Delhi Set 1, 2020)
= 5q + 1, where q = 5m2 + 2m Let n, n + 1 and n + 2 are the three consecutive
Ans. 
Case III : a = 5m + 2 positive integers.
a2 = (5m + 2)2 By Euclid‘s division lemma, we have,
= 25m2 + 4 + 2 (5m) (2) n = mq + r, 0 ≤ r < m
= 25m2 + 20m + 4 Let m = 3
 \ r = 0, 1 and 2 ⇒ 5 divides b2

\ n = 3q, 3q + 1 and 3q + 2 ⇒ 5 divides b
Case I : n = 3q ⇒ a and b have 5 as a common factor.

So, n + 1 = 3q + 1
But this contradicts the fact that a and b are
n + 2 = 3q + 2 co-prime integers..
In this case, only n = 3q is divisible by 3 but n + \ Our assumption that 5 is rational is
1 and n + 2 are not divisible by 3. incorrect.
Case II : n = 3q + 1
\ We conclude that 5 is an irrational
So, n + 1 = (3q + 1) + 1 = 3q + 2
number. Hence Proved.
n + 2 = (3q + 1) + 2 = 3q + 3 = 3(q + 1)
In this case, only n + 2 = 3(q + 1) is divisible Q.  4. Prove that 5 is an irrational number.
by 3 but n and n + 1 are not divisible by 3. Hence show that 3 + 2 5 is also an
irrational number.
Case III : n = 3q + 2  [CBSE Term 1, 2016]
So, n + 1 = (3q + 2) + 1 = 3q + 3 = 3(q + 1)
Ans. Let 5 be a rational number.
n + 2 = (3q + 2) + 2 = 3q + 4
So, 5= p
In this case, only n + 1 = 3(q + 1) is divisible q
by 3 but n and n + 2 are not divisible by 3 On squaring both sides,
2
Hence, one of every three consecutive 5 = p
positive integers is divisible by 3. q2
2
Hence Proved. ⇒ q2 = p
Q. 3. Prove that 5 is an irrational number. 5
(CBSE OD Set 1, 2020) ⇒ 5 is a factor of p 2

Let us assume, to the contrary that 5 is a

Ans.  ⇒ 5 is a factor of p.
rational number.
Now, again let p = 5c

Then, there exists co-prime positive integers
So, 5 = 5c
a and b such that b ≠ 0.
q
a
Then, 5 = On squaring both sides
b
25c 2
Squaring both sides, we get 5=
q2
2
a 2
( 5) =   ⇒ q2 = 5c2
b q2
⇒ c2 =
a2 5
⇒ 5 = 2 ⇒ 5 is factor of q2.
b
⇒ 5 is a factor of q.
⇒ 5b2 = a2 ...(i)
Here, 5 is a common factor of p, q which
⇒ 5 divides a2

contradicts the fact that p, q are co-prime.
⇒ 5 divides a
Hence, our assumption is wrong, 5 is an
⇒ a = 5k for some integer k
irrational number.

Substituting the value of a in equation (i), Now, we have to show that 3 + 2 5 is an
5b2 = (5k)2 irrational number.
⇒ 5b = 25k2
2 So, let us assume 3 + 2 5 is a rational
⇒ b2 = 5k2 number.
 p Ans. First we find HCF of 6339 and 6341 by
⇒ 3 + 2 5 = Euclid’s division method
q
p 6339 6341 1
⇒  2 5 = −3
q 6339
2 6339 3169
⇒ 2 5 = p − 3q 6338
q 1 2 2
p − 3q 2
⇒ 5= ×
2q
6341 > 6339
p − 3q
is in the rational form of p so 5 ⇒ 6341 = 6339 × l + 2
2q q
is a rational number but we have already Also, 6339 = 2 × 3169 + 1
proved that 5 is an irrational number. So, 2 = 1 × 2 + 0
contradiction arises because we supposed
wrong that 3 + 2 5 is a rational number. ∴ HCF of 6341 and 6339 is 1.
So we can say that 3 + 2 5 is an irrational Now, we find the HCF of 134791 and 1
number.  Hence Proved.
134791 = 1 × 134791 + 0
Q.  5. Find HCF of numbers 134791, 6341 and
∴ HCF of 134791 and 1 is 1.
6339 by Euclid's division algorithm.
 [CBSE Term 1, 2015] Hence, HCF of given three numbers is 1.