Perfect solution to all problems

Tips, Tricks, General Knowledge, Current Affairs, Latest Sample,

Previous Year, Practice Papers with solutions.

CBSE 10th Real Number Solved Paper

Solved Paper
Pack of two pdf files, purchased from [Link]

Note
This pdf file is downloaded from [Link]. Editing the content or publicizing this on any blog or
website without the written permission of Rewire Media is punishable, the suffering will be decided under
DMCA
[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

com
CBSE 10th Real Number
Solved Paper
_________________________________________________________________________

Question 1:
Use Euclid’s division algorithm to find the HCF of:
(i) 𝟏𝟑𝟓 𝒂𝒏𝒅 𝟐𝟐𝟓
(ii) 𝟏𝟗𝟔 𝒂𝒏𝒅 𝟑𝟖𝟐𝟐𝟎
(iii) 𝟖𝟔𝟕 𝒂𝒏𝒅 𝟐𝟐𝟓
Solution:
(i) 𝟏𝟑𝟓 𝒂𝒏𝒅 𝟐𝟐𝟓
Since 225 > 135, we apply the division lemma to 225 𝑎𝑛𝑑 135 to obtain
225 = 135 × 1 + 90
Since remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to obtain
135 = 90 × 1 + 45
We consider the new divisor 90 and new remainder 45, and apply the division
lemma to obtain
90 = 2 × 45 + 0
Since the remainder is zero, the process stops.
Since the divisor at this stage is 45,
Therefore, the HCF of 135 and 225 is 45.

(ii) 𝟏𝟗𝟔 𝒂𝒏𝒅 𝟑𝟖𝟐𝟐𝟎

Since 38220 > 196, we apply the division lemma to 38220 𝑎𝑛𝑑 196 to obtain
38220 = 196 × 195 + 0
Since remainder is zero, the process stops.
Since the divisor at this stage is 196,
Therefore, HCF of 196 and 38220 is 196.

(iii) 𝟖𝟔𝟕 𝒂𝒏𝒅 𝟐𝟓𝟓

Since 867 > 255, we apply the division lemma to 867 𝑎𝑛𝑑 255 to obtain
867 = 255 × 3 + 102
Since remainder 102 ≠ 0, we apply the division lemma to 255 and 102 to obtain
255 = 102 × 2 + 51

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

We consider the new divisor 102 and new remainder 51, and apply the division
lemma to obtain
102 = 51 × 2 + 0
Since the remainder is zero, the process stops.
Since the divisor at this stage is 51,
Therefore, the HCF of 867 and 255 is 51.

Question 2:
Use Euclid’s division lemma to show that the square of any positive integer is either of form
𝟑𝒎 𝒐𝒓 𝟑𝒎 + 𝟏 for some integer 𝒎.
𝐇𝐢𝐧𝐭: 𝐥𝐞𝐭 𝒙 𝐛𝐞 𝐚𝐧𝐲 𝐩𝐨𝐬𝐢𝐭𝐢𝐯𝐞 𝐢𝐧𝐭𝐞𝐠𝐞𝐫 𝐭𝐡𝐞𝐧 𝐢𝐭 𝐢𝐬 𝐨𝐟 𝐭𝐡𝐞 𝐟𝐨𝐫𝐦 𝟑𝐪, 𝟑𝐪 + 𝟏 𝐨𝐫 𝟑𝐪 + 𝟐.
[ ]
𝐍𝐨𝐰 𝐬𝐪𝐮𝐚𝐫𝐞 𝐞𝐚𝐜𝐡 𝐨𝐟 𝐭𝐡𝐞𝐬𝐞 𝐚𝐧𝐝 𝐬𝐡𝐨𝐰 𝐭𝐡𝐚𝐭 𝐭𝐡𝐞𝐲 𝐜𝐚𝐧 𝐛𝐞 𝐫𝐞𝐰𝐫𝐢𝐭𝐞𝐞𝐧 𝐢𝐧 𝐭𝐡𝐞 𝐟𝐨𝐦𝐫 𝟑𝐦 𝐨𝐫 𝟑𝐦 + 𝟏
Solution:
Let a be any positive integer and b = 3.
Then 𝑎 = 3𝑞 + 𝑟 for some integer 𝑞 ≥ 0
And 𝑟 = 0,1,2 𝑏𝑒𝑐𝑎𝑢𝑠𝑒 0 ≤ 𝑟 < 3
Therefore, 𝑎 = 3𝑞 𝑜𝑟 3𝑞 + 1 𝑜𝑟 3𝑞 + 2
Or,
𝑎2 = (3𝑞)2 𝑜𝑟 (3𝑞 + 1)2 𝑜𝑟 (3𝑞 + 2)2
𝑎2 = (9𝑞 2 ) 𝑜𝑟 9𝑞 2 + 6𝑞 + 1 𝑜𝑟 9𝑞 2 + 12𝑞 + 4
= 3 × (3𝑞 2 )𝑜𝑟 3(3𝑞 2 + 2𝑞) + 1 𝑜𝑟 3(3𝑞 2 + 4𝑞 + 1) + 1
= 3𝑘1 𝑜𝑟 3𝑘2 + 1 𝑜𝑟 3𝑘3 + 1
Where 𝑘1 , 𝑘2 𝑎𝑛𝑑 𝑘3 are some positive integers
Hence, It can be said that the square of any positive integer is either of the form
3𝑚 𝑜𝑟 3𝑚 + 1.

Question 3:
Use Euclid’s division lemma to show that the cube of any positive integer is of the form 𝟗𝒎,
𝟗𝒎 + 𝟏 𝒐𝒓 𝟗𝒎 + 𝟖.
Solution:
Let a be any positive integer and b = 3
a = 3q + r, where q ≥ 0 and 0 ≤ r < 3

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

∴ 𝑎 = 3𝑞 𝑜𝑟 3𝑞 + 1 𝑜𝑟 3𝑞 + 2
Therefore, every number can be represented as these three forms.
There are three cases.
Case 1: When 𝑎 = 3𝑞,
𝑎3 = (3𝑞)3 = 27𝑞 3 = 9(3𝑞 3 ) = 9𝑚.
Where 𝑚 is an integer such that m = 3𝑞 3

Case 2: when 𝑎 = 3𝑞 + 1,
𝑎3 = (3𝑞 + 1)3
𝑎3 = 27𝑞 3 + 27𝑞 2 + 9𝑞 + 1
𝑎3 = 9(3𝑞 3 + 3𝑞 2 + 𝑞) + 1
𝑎3 = 9𝑚 + 1
Where 𝑚 is an integer such that 𝑚 = (3𝑞 3 + 3𝑞 2 + 𝑞)

Case 3: When 𝑎 = 3𝑞 + 2,
𝑎3 = (3𝑞 + 2)3
𝑎3 = 27𝑞 3 + 54𝑞 2 + 36𝑞 + 8
𝑎3 = 9(3𝑞 3 + 6𝑞 2 + 4𝑞) + 8
𝑎3 = 9𝑚 + 8
Where 𝑚 is an integer such that 𝑚 = (3𝑞 3 + 6𝑞 2 + 4𝑞)
Therefore, the cube of any positive integer is of the form 9𝑚, 9𝑚 + 1 𝑜𝑟 9𝑚 + 8.

Question 4:
Find the LCM and HCF of the following pairs of integers and verify that
LCM × HCF = product of the two numbers.
(i) 26 𝑎𝑛𝑑 91
(ii) 510 𝑎𝑛𝑑 92
(iii) 336 𝑎𝑛𝑑 54

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Solution:
(i) 26 𝑎𝑛𝑑 91
26 = 2 × 13
91 = 7 × 13
HCF = 13
LCM = 3 × 7 × 13 = 182
Product of the two numbers = 26 × 91 = 2366
HCF × LCM = 13 × 182 = 2366
Hence, product of two numbers = HCF × LCM

(ii) 510 𝑎𝑛𝑑 92

510 = 2 × 3 × 5 × 17
92 = 2 × 2 × 23
HCF = 2
LCM = 2 × 2 × 3 × 5 × 17 × 23 = 23460
Product of the two numbers = 510 × 92 = 46920
HCF × LCM = 2 × 23460 = 46920
Hence, product of two numbers = HCF × LCM

(iii) 336 𝑎𝑛𝑑 54

336 = 2 × 2 × 2 × 2 × 3 × 7
336 = 24 × 3 × 7
54 = 2 × 3 × 3 × 3
54 = 2 × 33
HCF = 2 × 3 = 6
LCM = 24 × 33 × 7 = 3024
Product of the two numbers = 336 × 54 = 18144
HCF × LCM = 6 × 3024 = 18144
Hence, product of two numbers = HCF × LCM

Question 5:
Find the LCM and HCF of the following integers by applying the prime factorization
method.
(i) 𝟏𝟐, 𝟏𝟓 𝒂𝒏𝒅 𝟐𝟏
(ii) 𝟏𝟕, 𝟐𝟑 𝒂𝒏𝒅 𝟐𝟗
(iii) 𝟖, 𝟗 𝒂𝒏𝒅 𝟐𝟓

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Solution:
(i) 12, 15 𝑎𝑛𝑑 12
12 = 22 × 3
15 = 3 × 5
21 = 3 × 7
HCF = 3
LCM = 22 × 3 × 5 × 7 = 420

(ii) 17, 23 𝑎𝑛𝑑 29

17 = 1 × 17
23 = 1 × 23
29 = 1 × 29
HCF = 1
LCM = 17 × 23 × 29 = 11339

(iii) 8, 9 𝑎𝑛𝑑 25
8= 2×2×2
9= 3×3
25 = 5 × 5
HCF = 1
LCM = 2 × 2 × 2 × 3 × 3 × 5 × 5 = 1800

Question 6:

Prove that √𝟓 is irrational.

Solution:

Let √5 is a ration number.

𝑎
Therefore, we can find two integers 𝑎, 𝑏 (𝑏 ≠ 0) such that √5 = 𝑏

Let 𝑎 and 𝑏 have a common factor other than 1. Then we can divide them by the common
factor, and assume that a and b are co-prime.

𝑎 = √5𝑏
𝑎2 = 5𝑏 2

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Therefore, 𝑎2 is divisible by 5 and it can be said that a is divisible by 5.

Let 𝑎 = 5𝑘, where k is an integer
(5𝑘)2 = 5𝑏 2
𝑏 2 = 5𝑘 2 This means that 𝑏 2 is divisible by 5 and hence, b is divisible by 5.
This implies that a and b have 5 as a common factor.
And this is a contradiction to the fact that a and b are co-prime.
𝑝
Hence, √5 cannot be expressed as 𝑞 or it can be said that √5 is irrational.

Question 7:

Prove that 𝟑 + 𝟐√𝟓 is irrational.

Solution:

Let 3 + 2√5 is rational.

Therefore, we can find two integers 𝑎, 𝑏(𝑏 ≠ 0) such that
𝑎
3 + 2√5 = 𝑏
𝑎
2√5 = 𝑏 − 3
1 𝑎
√5 = 2 (𝑏 − 3)
1 𝑎
Since 𝑎 𝑎𝑛𝑑 𝑏 are integers, 2 (𝑏 − 3) will also be rational and

Therefore, √5 is rational.

This contradicts that fact that √5 is irrational. Hence, our assumption

That 3 + 2√5 is rational is false. Therefore, 3 + 2√5 is irrational.

Question 8:
Prove that the following are irrationals:
𝟏
(i)
√𝟐
(ii) 𝟕√𝟓
(iii) 𝟔 + √𝟐

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Solution:
1
(i)
√2
1
Let is rational.
√2
Therefore, we can find two integers 𝑎, 𝑏(𝑏 ≠ 0) such that
1 𝑎
=
√2 𝑏

𝑏
√2 =
𝑎
𝑎
𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑎𝑠 𝑎 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠.
𝑏

Therefore, √2 is rational which contradicts to the fact that √2 is irrational.

(ii) 7√5
Let 7√5 is rational.
Therefore, we can find two integers 𝑎, 𝑏(𝑏 ≠ 0) such that
𝑎
7√5 = , for some integers a and b
𝑏
𝑎
√5 =
7𝑏
𝑎
𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑎𝑠 𝑎 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠.
7𝑏

Therefore, √5 is rational

This contradicts the fact that √5 is irrational.

Therefore, our assumption that 7√5 is rational is false, Hence, 7√5 is irrational.

(iii) 6 + √2
Let 6 + √2 be rational.
Therefore, we can find two integers 𝑎, 𝑏(𝑏 ≠ 0) such that
𝑎
6 + √2 =
𝑏
𝑎
√2 = −6
𝑏

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

a
Since a and b are integers, − 6 is also rational
b
and hence, √2 should be rational.
This contradicts the fact that √2 is irrational.
Therefore, our assumption is false and hence, 6 + √2 is irrational.

Question 9:
Show that any positive odd integer is of the form 𝟔𝒒 + 𝟏 𝒐𝒓, 𝟔𝒒 + 𝟑 𝒐𝒓, 𝟔𝒒 +
𝟓, 𝐰𝐡𝐞𝐫𝐞 𝐪 𝐢𝐬 𝐬𝐨𝐦𝐞 𝐢𝐧𝐭𝐞𝐠𝐞𝐫.
Solution:
Let a be any odd positive integer we need to prove that a is of the form
6𝑞 + 1 𝑜𝑟, 6𝑞 + 3 𝑜𝑟, 6𝑞 + 5, where q is some integer
Since a is an integer consider 𝑏 = 6 another integer applying Euclid’s division lemma we
get
𝑎 = 6𝑞 + 𝑟 for some integer q ≥ 0, and r = 0, 1, 2, 3, 4, 5 since 0 ≤ r < 6.
Therefore, 𝑎 = 6𝑞 𝑜𝑟 6𝑞 + 1 𝑜𝑟 6𝑞 + 2 𝑜𝑟 6𝑞 + 3 𝑜𝑟 6𝑞 + 4 𝑜𝑟 6𝑞 + 5
However since a is odd so a cannot take the values 6𝑞, 6𝑞 + 2, 6𝑞 + 4
(since all these are divisible by 2)
Also, 6𝑞 + 1 = 2 × 3𝑞 + 1 = 2𝑘1 + 1, where 𝑘1 is a positive integer
6𝑞 + 3 = (6𝑞 + 2) + 1 = 2(3𝑞 + 1) + 1 = 2𝑘2 + 1, where 𝑘2 is an integer
6𝑞 + 5 = (6𝑞 + 4) + 1 = 2(3𝑞 + 2) + 1 = 2𝑘3 + 1, where 𝑘3 is an integer
Clearly, 6𝑞 + 1, 6𝑞 + 3, 6𝑞 + 5 are of the form 2k + 1, where k is an integer
Therefore, 6𝑞 + 1, 6𝑞 + 3, 6𝑞 + 5 are odd numbers.
Therefore, any odd integer can be expressed is of the form
6𝑞 + 1, 𝑜𝑟 6𝑞 + 3, 6𝑞 + 3, 6𝑞 + 5 where q is some integer
Concept insight: In order to solve such problem Euclid’s division lemma is applied to two
integers a and b the integer b must be taken in accordance with what is to be proved, for
example here the integer b was taken 6 because a must be of the form 6𝑞 + 1, 6𝑞 + 3,
6𝑞 + 5 Basic definition of even ( divisible by 2) and odd numbers ( not divisible by 2)
and the fact that addiction and multiplication of integers is always an integer are
applicable here.

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Question 10:
Prove that the square of any positive integer is of the form 𝟒𝒒 𝒐𝒓 𝟒𝒒 + 𝟏 for some integer
q.
Solution:
By Euclid’s division Algorithm
𝑎 = 𝑏𝑚 + 𝑟, 𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑟 ≤ 𝑏
Put 𝑏 = 4
𝑎 = 4𝑚 + 𝑟, 𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑟 ≤ 4
𝐼𝑓 r = 0, then a = 4m
𝐼𝑓 r = 1, then a = 4m + 1
𝐼𝑓 r = 2, then a = 4m + 2
𝐼𝑓 r = 3, then a = 4m + 3
Now, (4𝑚)2 = 16𝑚2
= 4 × 4𝑚2
= 4𝑞 where q is some integer
(4𝑚 + 1)2 = (4𝑚)2 + 2(4𝑚)(1) + (1)2
= 16𝑚2 + 8𝑚 + 1
= 4(4𝑚2 + 2𝑚) + 1
= 4𝑞 + 1 𝑤ℎ𝑒𝑟𝑒 𝑞 is some integer
(4𝑚 + 2)2 = (4𝑚)2 + 2(4𝑚)(2) + (2)2
= 16𝑚2 + 24𝑚 + 9
= 16𝑚2 + 24𝑚 + 8 + 1
= 4(4𝑚2 + 6𝑚 + 2) + 1
= 4𝑞 + 1, where q is some integer
Hence, the square of any positive integer is of the form 4𝑞 𝑜𝑟 4𝑞 + 1 for some integer m

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Q.11 Prove that if a positive integer is of the form 6q + 5, then it is of the form 3q + 2 for
some integer q, but not conversely.
Ans.
Let, n = 6q + 5, when q is a positive integer
We know that any positive integer is of the form 3k, or 3k + 1, or 3k + 2
∴ q = 3k or 3k + 1, or 3k + 2
If q = 3k, then
n = 6q + 5
= 6(3k) + 5
= 18k + 5
= 18k + 3 + 2
= 3(6k + 1) + 2
= 3m + 2, where m is some integer
If q = 3k + 1, then
n = 6q + 5
= 6(3k + 1) + 5
= 18k + 6 + 5
= 18k + 11
= 3(6k + 3) + 2
= 3m + 2, where m is some integer
If q = 3k + 2, then
n = 6q + 5
= 6(3k + 2) + 5
= 18k + 12 + 5
= 18k + 17
= 3(6k + 5) + 2
= 3m + 2, where m is some integer
Hence, if a positive integer is of the form 6q + 5, then it is of the form 3q + 2 for some integer q.
Conversely

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Let n = 3q + 2
We know that a positive integer can be of the form 6k + 1, 6k + 2, 6k + 3, 6k + 4 or 6k + 5
So, now if q = 6k + 1 then
n = 3(6k + 1) + 2
= 18k + 5
= 6(3k) + 5
= 6m + 5, where m is some integer
So, now if q = 6k + 2 then
n = 3(6k + 2) + 2
= 18k + 8
= 6 (3k + 1) + 2
= 6m + 2, where m is some integer
Now, this is not of the form 6m + 5
Hence, if n is of the form 3q + 2, then it necessarily won’t be of the form 6q + 5 always.

Q.12 Prove that the product of three consecutive positive integer is divisible by 6.
Ans. Let, n be any positive integer. Since any positive integer is of the form 6q or 6q + 1 or 6q +
2 or, 6q + 3 or 6q + 4 or 6q + 5.
If n = 6q, then
n(n + 1)(n + 2) = (6q + 1)(6q + 2)(6q + 3)
= 6[(6q + 1)(3q + 1)(2q + 1)]
= 6m, which is divisible by 6?
If n = 6q + 1, then
n(n + 1)(n + 2) = (6q + 2)(6q + 3)(6q + 4)
= 6[(6q + 1)(3q + 1)(2q + 1)]
= 6m, which is divisible by 6
If n = 6q + 2, then
n(n + 1)(n + 2) = (6q + 2)(6q + 3)(6q + 4)
= 6[(3q + 1)(2q + 1)(6q + 4)]
= 6m, which is divisible by 6
If n = 6q + 3, then
n(n + 1)(n + 2) = (6q + 3)(6q + 4)(6q + 5)
 = 6[(6q + 1)(3q + 2)(2q + 5)]
= 6m, which is divisible by 6.
If n = 6q + 4, then
n(n + 1)(n + 2) = (6q + 4)(6q + 5)(6q + 6)
= 6[(6q + 4)(3q + 5)(2q + 1)]
= 6m, which is divisible by 6.
If n = 6q + 5, then
n(n + 1)(n + 2) = (6q + 5)(6q + 6)(6q + 7)
= 6[(6q + 5)(q + 1)(6q + 7)]
= 6m, which is divisible by 6.
Hero, the product of three consecutive positive integer is divisible by 6.

Q.13 For any positive integer n , prove that 𝒏𝟑 − n divisible by 6.

Ans.
We have 𝑛3 − 𝑛 = 𝑛(𝑛2 − 1) = (𝑛 − 1)(𝑛)(𝑛 + 1)
Let, n be any positive integer. Since any positive integer is of the form 6q or 6q + 1 or, 6q
+ 2 or, 6q + 3 or, 6q + 4 or, 6q + 5.
If n = 6q, then
(𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 − 1)(6𝑞)(6𝑞 + 1)
= 6[(6𝑞 − 1)(𝑞)(6𝑞 + 1)]
= 6m, which is divisible by 6
If n = 6q + 1, then
(𝑛 − 1)(𝑛 + 1) = (6𝑞)(6𝑞 + 1)(6𝑞 + 2)
= 6[(𝑞)(6𝑞 + 1)(6𝑞 + 2)]
= 6m, which is divisible by 6
If n = 6q + 2, then
(𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 + 1)(6𝑞 + 2)(6𝑞 + 3)
= 6[(6𝑞 + 1)(3𝑞 + 1)(2𝑞 + 1)]
= 6m, which is divisible by 6
If n = 6q + 3, then
(𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 + 3)(6𝑞 + 4)(6𝑞 + 5)

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

= 6[(3𝑞 + 1)(2𝑞 + 1)(6𝑞 + 4)]

= 6m, which is divisible by 6
If n = 6q + 4, then
(𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 + 3)(6𝑞 + 4)(6𝑞 + 5)
= 6[(2𝑞 + 1)(3𝑞 + 2)(6𝑞 + 5)]
= 6m, which is divisible by 6
If n = 6q + 5, then
(𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 + 4)(6𝑞 + 5)(6𝑞 + 6)
= 6[(6𝑞 + 4)(6𝑞 + 5)(𝑞 + 1)]
= 6m, which is divisible by 6
Hence, for any positive integer n, 𝑛3 – n is divisible by 6.

Q.14 Define HOE of two positive integers and find the HCF of the following pairs of
numbers:
(i) 32 and 54
(ii) 18 and 24
(iii) 70 and 30
(iv) 56 and 88
(v) 475 and 495
Ans. By applying Euclid’s division lemma
(i)
5y = 32 × 1 + 22
Since remainder ≠ 0, apply division lemma on division of 32 and remainder 22.
32 = 22 × 1 + 10
Since remainder ≠ 0, apply division lemma on division of 22 and remainder 10.
22 = 10 × 2 + 2
Since remainder ≠ 0, apply division lemma on division of 10 and remainder 2.
10 = 2 × 5 [remainder 0]
Hence, HCF of 32 and 54 10 2

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

(ii) By applying division lemma

24 = 18 × 1 + 6
Since remainder = 6, apply division lemma on divisor of 18 and remainder 6.
18 = 6 × 3 + 0
∴ Hence, HCF of 18 and 24 = 6
(iii) By applying Euclid’s division lemma
70 = 30 × 2 + 10
Since remainder ≠ 0, apply division lemma on divisor of 30 and remainder 10.
30 = 10 × 3 + 0
∴ Hence HCF of 70 and 30 is = 10.
(iv) By applying Euclid’s division lemma
88 = 56 × 1 + 32
Since remainder ≠ 0, apply division lemma on divisor of 56 and remainder 32.
56 = 32 × 1 + 24
Since remainder ≠ 0, apply division lemma on divisor of 32 and remainder 24.
32 = 24 × 1 + 8
Since remainder ≠ 0, apply division lemma on divisor of 24 and remainder 8.
24 = 8 × 3 + 0
∴ HCF of 56 and 88 is = 8.
(v) By applying Euclid’s division lemma
495 = 475 × 1 +20
Since remainder ≠ 0, apply division lemma on divisor of 475 and remainder 20.
475 = 20 × 23 + 15
Since remainder ≠ 0, apply division lemma on divisor of 20 and remainder 15.
20 = 15 × 1 + 5
Since remainder ≠ 0, apply division lemma on divisor of 15 and remainder 5.
15 = 5 × 3 + 0
∴ HCF of 475 and 495 is = 5.

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Q.15 Use Euclid’s division algorithm to find the HCF of

(i) 135 and 225 (ii) 196 and 38220
Ans. (I) 135 and 225
Step 1: Since 225 > 135. Apply Euclid’s division lemma to a = 225 and b = 135 to find q and
r such that 225 = 135q + r, 0 ≤ r < 135
On dividing 225 by 135 we get quotient as 1 and remainder as ‘90’ i.e., 225 = 135r 1 + 90
Step 2: Remainder 5 which is 90 7, we apply Euclid’s division lemma to a = 135 and b = 90
to find whole numbers q and r such that 135 = 90 × q + r 0 ≤ r < 90 on dividing 135 by 90 we
get quotient as 1 and remainder as 45 i.e., 135 = 90 × 1 + 45
Step3: Again remainder r = 45 to so we apply division lemma to a = 90 and b = 45 to find q
and r such that 90 = 45 × q × r. 0 ≤ r < 45. On dividing 90 by 45we get quotient as 2 and
remainder as 0 i.e., 90 = 2 × 45 + 0
Step 4: Since the remainder = 0, the divisor at this stage will be HCF of (135, 225) Since the
divisor at this stage is 45. Therefore the HCF of 135 and 225 is 45.
(ii) 867 and 255:
Step 1: Since 867 > 255, apply Euclid’s division Lemma a to a = 867 = 255 q + r, 0 < r < 255
On dividing 867 by 255 we get quotient as 3 and the remainder as low
Step 2: Since the remainder 102 to, we apply the division lemma to a = 255 and b = 102 to
find 255 = 102q + 51 = 102r – 151
Step 3: Again remainder 0 is non-zero, so we apply the division lemma to a = 102 and b = 51
to find whole numbers q and r such that 102 = q = r when 0 ≤ r < 51 On dividing 102 by 51
quotient = 2 and remainder is ‘0’ i,e., = 102 = 51 × 2 + 0 Since the remainder is zero, the
divisional this stage is the HCF. Since the divisor at this stage is 51, ∴ HCF of 867 and 255 is
‘51’.
Q.17 If the HCF of 408 and 1032 is expressible in the form 1032 m − 408 × 5, find m.
Ans. General integers are 408 and 1032 where 408 < 1032
By applying Euclid’s division lemma, we get
1032 = 408 × 2 + 216
Since remainder ≠ 0, apply division lemma on division 408 and remainder 216
408 = 216 × 1 + 192
Since remainder ≠ 0, apply division lemma on division 216 and remainder 192
216 = 192 × 1 + 24
Since remainder ≠ 0, apply division lemma on division 192 and remainder 24
192 = 24 × 8 + 32

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

We observe that 32m under in 0. So the last divisor 24 is the H.C.F of 408 and 1032
∴ 216 = 1032m – 408 × 5
⇒ 1032 m = 24 + 408 × 5
⇒ 1032m = 24 + 2040
⇒ 1032m = 2064
2064
⇒ m = 1032= 2

Q.18 If the HCF of 657 and 963 is expressible in the form 657 x + 963 x − 15, find x.
Ans.
657 and 963
By applying Euclid’s division lemma
963 = 657 × 1 + 306
Since remainder ≠ 0, apply division lemma on division 657 and remainder 306
657 = 306 × 2 + 45
Since remainder ≠ 0, apply division lemma on division 306 and remainder 45
306 = 45 × 6 + 36
Since remainder ≠ 0, apply division lemma on division 45 and remainder 36
45 = 36 × 1 + 19
Since remainder ≠ 0, apply division lemma on division 36 and remainder 19
36 = 19 × 4 + 0
∴ HCF = 657
Given HCF = 657 + 963 × (-15)
⇒ 9 = 657 × −1445
⇒ 9 + 14445 = 657 x
⇒ 657x = 1445y
1445𝑦
⇒x= 657

Q.19 Find the largest number which divides 615 and 963 leaving remainder 6 in each
case.

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Ans.
The required number when the divides 615 and 963
Leaves remainder 616 is means 615 – 6 = 609 and 963 – 957 are completely divisible by
the number
∴ the required number
= HCF of 609 and 957
By applying Euclid’s division lemma
957 = 609 × 1 + 348
609 = 348 × 1 + 261
348 = 261 × 1 + 87
261 = 87 × 370
HCF = 87
Hence the required number is ‘87’

Q.20 Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7
respectively.
Ans.
The require number when divides 285 and 1249, leaves remainder 9 and 7, this means 285 –
9 = 276 and 1249 – 7 = 1242 are completely divisible by the number
∴ The required number = HCF of 276 and 1242
By applying Euclid’s division lemma
1242 = 276 × 4 + 138
276 = 138 × 2 + 0
∴ HCF = 138
Hence remainder is = 0
Hence required number is 138

Download More @ [Link]

[Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link] [Link]

Q.21 Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and
3, respectively.
Ans.
The required number when divides 280 and 1245 leaves the remainder 4 and 3, this means
280 4 – 216 and 1245 – 3 = 1245 – 3 = 1242 are completely divisible by the number
∴ The required number = HCF of 276 and 1242
By applying Euclid’s division lemma
1242 = 276 × 4 + 138
276 = 138 × 2 + 0
∴ HCF = 138
Hence the required numbers is 138

Download More @ [Link]