ID : U-4180-138-1126-Real-Numbers [1]

Class 10
Real Numbers
For more such worksheets visit www.edugain.com

Answer the questions

(1) Prove that √11 is an irrational number.

(2) A number, when divided by 95 gives 13 as the quotient and 92 as the remainder. Find the number.
(3) Using Euclid's Division Algorithm, find the HCF of 12900 and 720
(4) Two tankers contain 696 litres and 432 litres of petrol respectively. A container with maximum capacity
is used which can measure the petrol of either tanker in exact number of litres. How many containers of
petrol are there in the first tanker.
(5) Find the smallest number which when increased by 13 is exactly divisible by both 150 and 165.
(6) The HCF of two numbers is 89 and their LCM is 113. Find their product.
(7) Two tankers contain 1360 litres and 540 litres of petrol respectively. Find the maximum capacity of the
container which can measure the petrol of either tanker in exact number of litres.
(8) Find the largest positive integer that will divide 2194 and 1250 leaving remainders 4 and 20
respectively.

(9) Prove that n 2-n is even for every positive integer n.

(10) In a school annual day function parade, a group of 744 students need to march behind the band of 288
members. The two groups have to march in the same number of columns. What is the maximum
number of columns in which they can march?
(11) Show all the prime factors of 1660120;
(12) Find the LCM of 1752 and 624.
(13) Usha and Saina are racing on a circular track. If Usha takes 24 minutes and Saina takes 36 minutes to
complete the round. If they both start at the same point at the same time and go in same direction, after
how many minutes will they meet again at the start point?
(14) Show that every positive even integer is of the form 2m and every positive odd integer is of the form
(2m+1), where m is some integer.

Choose correct answer(s) from the given choices

(15) Euclid's Division Lemma states that if a and b are any two positive integers, then there exist unique
integers q and r such that
a. a = bq + r, 0 ≤ r < b b. a = bq + r, 0 < q ≤ b
c. a = bq + r, 0 ≤ q < b d. a = bq + r, 0 < r ≤ b

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [2]

© 2018 Edugain (www.edugain.com). Many more such worksheets can be

All Rights Reserved generated at www.edugain.com

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [3]

Answers
(1)

Step 1
Let's assume that √11 is a rational number.
i.e. √11 = a/b (a and b are the two integers, such that, b is not equal to zero(0), and a and b do not
have common factor other than 1)

Step 2
a = √11b
Squaring both side,
a2 = 11b2
Therefore, a 2 is divisible by 11 and it can be said that a is divisible by 11.
Let a = 11m, where m is an integer.
Squaring both side,
a2 = (11m) 2
Now,
(11m) 2 = 11b2
b2 = 11m2
This means that b2 is divisible by 11 and hence, b is divisible by 11.
This implies that a and b have a common factor and this is contradiction to the fact that a and b
are a co-prime.

Step 3
Therefore, √11 is an irrational number.

(2) 1327

Step 1
Here, divisor = 95, quotient = 13, and remainder = 92.

Step 2
By applying Euclid's division lemma, we have:
dividend = (divisor × quotient) + remainder
= (95 × 13) + 92
= (1235 + 92) = 1327

Step 3
Hence, the required number is 1327.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [4]
(3) 60

Step 1
If we look at the question, we notice that 12900 > 720.
Therefore, a = 12900 and b = 720,
By applying the Euclid's Division Algorithm(a = bq + r) we get,
12900 = 720 × 17 + 660

Step 2
Since, r ≠ 0, by applying the Euclid's Division Algorithm by taking a = 720 and b = 660, we get,
720 = 660 × 1 + 60

Step 3
Since, r ≠ 0, by applying the Euclid's Division Algorithm by taking a = 660 and b = 60, we get,
660 = 60 × 11 + 0

Step 4
Since, r = 0, the process stops. The divisor at this stage is 60.
Thus, the HCF of the pair 12900 and 720 is 60.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [5]
(4) 29

Step 1
It is given that, the two tankers contain 696 litres and 432 litres of petrol respectively.
The maximum capacity of the container which can measure the petrol of either tanker in exact
number of litres is equal to the HCF of 696 and 432.

Step 2
Let's find the HCF of 696 and 432, using Euclid's Division Algorithm,
696 = 432 × 1 + 264,
432 = 264 × 1 + 168,
264 = 168 × 1 + 96,
168 = 96 × 1 + 72,
96 = 72 × 1 + 24,
72 = 24 × 3 + 0.
Thus, the HCF of 696 and 432 is 24.

Step 3
Therefore, the maximum capacity of the container which can measure the petrol of either tanker in
exact number of litres is 24 litres.

Step 4
Now, the number of containers of petrol in the first tanker = Petrol contained by the first tanker in
litres/The maximum capacity of the container which can measure the petrol of either tanker in
exact number of litres
= 696/24
= 29

Step 5
Thus, the number of containers of petrol in the first tanker are 29.

(5) 1637

Step 1
The smallest number which is exactly divisible by 150 and 165 is the LCM of 150 and 165.

Step 2
The LCM of 150 and 165 is 1650.

Step 3
According to the question, the required number is 13 less than the smallest number which is
exactly divisible by 150 and 165.

Step 4
Hence, the required number = 1650 - 13 = 1637.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [6]
(6) 10057

Step 1
For any two numbers a and b:
(a x b) = HCF(a,b) x LCM(a,b)

Step 2
We are told that HCF(a,b) = 89 and LCM(a,b) = 113.
Therefore,
Product of two numbers (a x b) = Product of HCF(a,b) and LCM(a,b)
= 89 x 113
= 10057

Step 3
Thus, the product of the two given numbers is 10057.

(7) 20

Step 1
It is given that, the two tankers contain 1360 litres and 540 litres of petrol respectively.
The maximum capacity of the container which can measure the petrol of either tanker in exact
number of litres is equal to the HCF of 1360 and 540.

Step 2
Let's find the HCF of 1360 and 540, using Euclid's Division Algorithm,
1360 = 540 × 2 + 280,
540 = 280 × 1 + 260,
280 = 260 × 1 + 20,
260 = 20 × 13 + 0.
Thus, the HCF of 1360 and 540 is 20.

Step 3
Therefore, the maximum capacity of the container which can measure the petrol of either tanker in
exact number of litres is 20 litres.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [7]
(8) 30

Step 1
We have to find the largest positive integer that will divide 2194 and 1250 leaving remainders 4
and 20 respectively.

Step 2
In other words, we have to find the largest number that will divide (2194-4) and (1250-20) leaving
no remainder.
Such number is the Highest Common Factor (HCF) of:
2190 [i.e., 2194 - 4] and 1230 [i.e., 1250 - 20].

Step 3
Let's find the HCF of 2190 and 1230 using Euclid's Division Algorithm,
2190 = 1230 × 1 + 960,
1230 = 960 × 1 + 270,
960 = 270 × 3 + 150,
270 = 150 × 1 + 120,
150 = 120 × 1 + 30,
120 = 30 × 4 + 0.
Thus, the HCF of 2190 and 1230 is 30.

Step 4
Therefore, 30 is the largest positive integer that will divide 2194 and 1250 leaving the remainders 4
and 20 respectively.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [8]
(9)

Step 1

We have been asked to prove that n2 - n is even for every positive integer n.

Step 2
Before beginning, we have to understand the following
Even × Even = Even
Even - Even = Even
Odd - Odd = Even
Odd × Odd = Odd

Step 3
First, suppose n is odd:
Now, n 2 - n = (odd) 2 - (odd)
= odd × odd - odd
= odd - odd
= Even

Step 4
Second, suppose n is even:
Now, n 2 - n = (even) 2 - (even)
= even × even - even
= even - even
= even

Step 5

Therefore, n2 - n is even for every positive integer n.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [9]
(10) 24

Step 1
Since number of students in each line (or column) should be same, number of columns should
fully divide number of students. Similarly number of band members should also be fully divisible by
number of columns

Step 2
Therefore number of columns should be highest possible number which fully divides both number
of students and number of band members. Therefore, maximum of number of columns in which
744 students can march behind the band of 288 members are equal to the HCF of 744 and 288.

Step 3
Let's find the HCF of 744 and 288 using Euclid's Division Algorithm,
744 = 288 × 2 + 168,
288 = 168 × 1 + 120,
168 = 120 × 1 + 48,
120 = 48 × 2 + 24,
48 = 24 × 2 + 0.
Thus, the HCF of 744 and 288 is 24.

Step 4
Therefore, the maximum number of columns in which they can march are 24.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [10]
(11) 2 2 2 5 7 7 7 11 11

Step 1
We have been asked to find the all prime factors of 1660120.

Step 2
All prime factors of 1660120:
2 | 1660120 2 is a factor of 1660120
2 | 830060 2 is a factor of 830060
2 | 415030 2 is a factor of 415030
5 | 207515 5 is a factor of 207515
7 | 41503 7 is a factor of 41503
7 | 5929 7 is a factor of 5929
7 | 847 7 is a factor of 847
11 | 121 11 is a factor of 121
11 | 11 11 is a factor of 11
|1

Thus,
1660120 = 2 × 2 × 2 × 5 × 7 × 7 × 7 × 11 × 11.

Step 3
Therefore, all the prime factors of 1660120 is 2 × 2 × 2 × 5 × 7 × 7 × 7 × 11 × 11.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [11]
(12) 45552

Step 1
Let us find the LCM of 1752 and 624.
All prime factors of 1752:
2 | 1752 2 is a factor of 1752
2 | 876 2 is a factor of 876
2 | 438 2 is a factor of 438
3 | 219 3 is a factor of 219
73 | 73 73 is a factor of 73
|1

Thus,
1752 = 2 × 2 × 2 × 3 × 73.

Step 2
All prime factors of 624:
2 | 624 2 is a factor of 624
2 | 312 2 is a factor of 312
2 | 156 2 is a factor of 156
2 | 78 2 is a factor of 78
3 | 39 3 is a factor of 39
13 | 13 13 is a factor of 13
|1

Thus,
624 = 2 × 2 × 2 × 2 × 3 × 13.

Step 3
Thus, the LCM of 1752 and 624 = 2 × 2 × 2 × 2 × 3 × 13 × 73 = 45552.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [12]
(13) 72

Step 1
Time after which they meet again at the starting point should be multiple of 24 and 36. Therefore,
number of minutes after which they will be meet again at starting point will be equal to the LCM of
24 and 36.

Step 2
Let us find the LCM of 24 and 36.
All prime factors of 24 = 2 × 2 × 2 × 3,
and, 36 = 2 × 2 × 3 × 3.
Thus, the LCM of 24 and 36 = 2 × 2 × 3 × 3 × 2 = 72.

Step 3
Therefore, they will meet again after 72 minutes.

(14)

Step 1
Let n be any arbitrary positive integer.
Let us divide n by 2 to get m as the quotient and r as the remainder.

Step 2
Then, by Euclid's division lemma, we have:
n = 2m + r, where 0 < r < 2.
n = 2m or (2m+1), for some integer m.

Step 3
Case 1: When n = 2m
In this case, n is clearly even.

Step 4
Case 2: When n = 2m+1
In this case, n is clearly odd.

Step 5
Thus, for some integer m, every positive even integer is of form 2m and every positive odd integer
of the form (2m+1).

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.
 ID : U-4180-138-1126-Real-Numbers [13]
(15) a. a = bq + r, 0 ≤ r < b

Step 1
Euclid's division lemma:
Euclid's division lemma, states that for any two positive integers a and b we can find two whole
numbers q and r such that a = b × q + r where 0 ≤ r < b.

Step 2
Let us take an example to understand it.
Suppose we have to divide 77 by 14.
77 = 14 × 5 + 7
where, a = 77, b = 14, q = 5 and r = 7
This type of division is known as Euclid's division lemma.

Step 3
One important point to note here is that r is the remainder when a is divided by b. Remainder can
be greater than or equal to 0, but should be less than divisor (i.e. 0 ≤ r < b). Therefore, the correct
answer is a = bq + r where 0 ≤ r < b.

Copyright 2018 www.edugain.com Personal use only. Commercial use is strictly prohibited.