Downloaded from https://www.ncertbooksolutions.

com/

Very Short Answer Type Questions

[1 marks]
Que 1. What is the HCF of the smallest composite number and the smallest prime number?
Sol. Smallest composite number = 4
Smallest prime number = 2
So, HCF (4,2) = 2
𝟔
Que 2. The decimal representation of will terminate after how many places of
𝟏𝟐𝟓𝟎
decimal?

om
6 3 3 24 48 48
Sol. = = × = = = 0.0048

.c
1250 625 54 24 (5 × 2)4 104

ns
This representation will terminate after 4 decimal places.

io
t
Que 3. If HCF of a and b is 12 and product of these numbers is 1800. Then what is LCM of
lu
so
these numbers?
k
Sol. Product of two numbers = Product of their LCM and HCF
oo

⇒ 1800 = 12 X LCM
rtb

1800
ce

⇒ LCM = = 150.
12
.n

Que 4. What is the HCF of 33 x 5 and 32 × 52?

w
w

Sol. HCF of 33 x 5 and 32 x 52 - 32 x 5 = 45

//w

Que 5. If a is an odd number, b is not divisible by 3 and LCM of a and b is P, what is the
s:

LCM of 3a and 2b?

tp
ht

Sol. 6p
Que 6. If P is prime number then, what is the LCM of P, P2, P3?
Sol. P3
Que 7. Two positive integers p and q can be expressed as p = ab 2 and q = a2b, a and b are
prime numbers. What is the LCM of p and q?
Sol. a2b2
Que 8. A number N when divided by 14 gives the remainder 5. What is the remainder when
same number is divided by 7?
Sol. 5, because 14 is multiple of 7.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Therefore, remainder in both cases are same.

𝟏𝟕
Que 9. Examine whether is a terminating decimal or not.
𝟑𝟎
17 17

om
Sol. = , since the denominator has 3 as its factor.
30 2×3×5

.c
17
is a non-terminating decimal.

ns
30

io
Que 10. What are the possible values of remainder r, when a positive integer a is divided by

t
lu
3? so
Sol. According to Euclid's division lemma a 3q+ r, where 0 ≤ r < 3 and r is an integer.
k
oo

Therefore, the values of r can be 0, 1 or 2.

rtb

Que 11. A rational number in its decimal expansion is 1.7351. What can you say about the
ce

𝒑
prime factors of q when this number is expressed in the form ? Give reason.
𝒒
.n
w

Sol. As 1.7351 is a terminating decimal number, so q must be of the form 2 m 5m, where m,n are
w

natural numbers.
//w

𝟗𝟖𝟕
Que 12. Without actually performing the long division, find if will have terminating
s:

𝟏𝟎𝟓𝟎𝟎
tp

or non-terminating repeating decimal expansion. Give reason for your answer.

ht

987 47
Sol. = and 500 = 22 × 53, so it has terminating decimal expansion.
10500 500

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Value Based Questions

Que 1. In order to celebrate Van Mahotsav, the students of a school planned to plant
two types of trees in the nearby park. They decided to plant 144 trees of type A and 84
trees of type B. If the two types of plants are to be in the same number of columns, find
the maximum number of columns in which they can be planted.
What values do these students possess?
Sol. Maximum number of columns in which the two types of plants can be planted = HCF of
144 and 84 Since 144 > 84
So, by division lemma, 144 = 84 x 1 + 60
Again, applying division lemma (since remainder ≠ 0), we get
84 = 60 × 1 + 24
Continuing the same way,

om
60 = 24 × 2 + 12 and 24 = 12 × 2 + 0
∵ Remainder at this stage = 0

.c
∴ HCF (144, 84) = 12

ns
Environmental protection, sincerity, social work, cooperation.
tio
lu
Que 2. In a seminar on the topic 'Liberty and Equality', the number of participants in
so

Hindi, Social Science and English are 60, 84 and 108 respectively.
(i) Find the minimum number of rooms required if in each room the same number of
k
oo

participants
are to be seated and all of them being from the same subject.
rtb

(ii) Which mathematical concept has been used in this problem?

ce

(iii) Which values are discussed in the above problem?

.n

Sol. (i) The number of rooms will be minimum if each room accommodates maximum
w
w

number of participants. Since in each room the same number of participants are to be seated
w

and all of them must be on the same subject, therefore, the number of participants in each
//

room must be the HCF of 60, 84, 108.

s:

The prime factorisation of 60, 84 and 108 are as under.

tp

60 = 22 × 3 × 5 and 84 = 22 × 3 × 7
ht

108 = 22 × 33
HCF = 22 × 3 = 12
𝑇𝑜𝑡𝑎𝑙 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑃𝑎𝑟𝑡𝑖𝑐𝑖𝑝𝑎𝑛𝑡𝑠
∴ Number of rooms required =
12
60+84+108 252
= = = 21
12 12
(ii) Mathematical concept used in the above problem is highest common factor, i.e., H.C.F.
(iii) Liberty and equality are the pay marks of democracy.
Que 3. Three sets of English, Hindi and Sociology books dealing with cleanliness have to
be stacked in such a way that all the boobs are stored topic wise and the height of each
stack is the same. The number of English books is 96, the number of Hindi books is 240
and the number of Sociology books is 336.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

(i) Assuming that the books are of the same thickness, determine the number of stacks
of each subject.
(ii) Which mathematical concept is used in this problem?
(iii) Which habits are discussed in this problem?
Sol. (i) In order to arrange the books as required we have to find the largest number that
divides 96, 240 and 336 exactly. Clearly, such a number is their HCF.
96 = 25 × 3
240 = 24 × 3 × 5
336 = 24 × 3 × 7

om
∴ HCF of 96, 240 and 336 is 24 × 3 = 48
So, there must be 48 books in each stack.

.c
ns
96
∴ Number of stacks of English books = =2
tio
48
240
lu
Number of stacks of Hindi books = =5
so
48
k

336
Number of stacks of sociology books = =7
oo

48
rtb

(ii) HCF of number.

ce

(iii) Cleanliness and orderliness have been discussed in this question. Cleanliness leads to
good health and orderliness makes a person better organised in life.
.n
w

Que 4. There is a circular path around a sports field. Priya takes 12 minutes to drive
w

one round of the field. While Ravish takes 10 minutes for the same. Suppose they both
w

start from the same point and at the same time and go in the same direction.
//
s:

(i) After how many minutes will they meet again at the starting point?
tp

(ii) Which mathematical concept is used in this problem?

ht

(iii) What is the value discussed in this problem?

Sol. (i) Required number of minutes is
LCM of (12, 10)
12 = 2 × 2 × 3
10 = 2 × 5
LCM = 2 × 2 × 3 × 5 = 60
Hence, they meet at starting point after 60 minutes.
(ii) LCM of number.
(iii) Health competition is necessary for person development and progress.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

HOTS (Higher Order Thinking Skills)

Que 1. Show that there is no positive integer n for which √𝐧 − 𝟏 + √𝐧 + 𝟏 is

rational.

Sol. Let there be a positive integer n for which √n − 1 + √n + 1 be rational number.

𝑝
√𝑛 − 1 + √𝑛 + 1 = 𝑞 ; Where p, q are integer and q ≠ 0 ……(i)

1 𝑞 √𝑛−1−√𝑛+1 𝑞
⇒ = ⇒
√𝑛−1+√𝑛+1 𝑝 (√𝑛−1+√𝑛+1)×(√𝑛−1−√𝑛+1) 𝑝

√𝑛−1−√𝑛+1 𝑞 √𝑛−1−√𝑛+1 𝑞
⇒ (𝑛−1)−(𝑛+1) = ⇒ =
𝑝 𝑛−1−𝑛−1 𝑝

√𝑛+1−√𝑛−1 𝑞 2𝑞
⇒ = ⇒ √𝑛 + 1 − √𝑛 − 1 = …..(ii)
2 𝑝 𝑝

om
Adding (i) and (ii), we get

.c
ns
𝑝 2𝑞
√𝑛 − 1 + √𝑛 + 1 + √𝑛 + 1 − √𝑛 − 1 = 𝑞
+
𝑝

𝑝2 +2𝑞 2 tio
𝑝2 +2𝑞2
lu
⇒ 2√𝑛 + 1 = ⇒ √𝑛 + 1 =
so
𝑝𝑞 2𝑝𝑞
k

𝑝 2 +2𝑞2
oo

⇒ √𝑛 + 1 is rational number as is rational.

2𝑝𝑞
rtb

⇒ n + 1 is perfect square of positive integer …(A)

ce

Again subtracting (ii) from (i), we get

.n

𝑝 2𝑞 𝑝2 −2𝑞2
w

√𝑛 − 1 + √𝑛 + 1 − √𝑛 + 1 + √𝑛 − 1 = 𝑞 − ⇒ 2√𝑛 − 1 =
w

𝑝 𝑝𝑞
w

𝑝 2 −2𝑞2
//

⇒ √𝑛 − 1 is rational number as is rational.

s:

2𝑝𝑞
tp

⇒ √𝑛 − 1 is also perfect square of positive integer. ….(B)

ht

From (A) and (B)

√𝑛 + 1 𝑎𝑛𝑑 √𝑛 − 1 are perfect squares of positive integer. It contradict the fact that
two perfect differ at least by 3.
Hence, there is no positive integer n for which √𝑛 − 1 + √𝑛 + 1 is rational.
Que 2. Let a, b, c, k be rational numbers such that k is not a perfect cube.
If a + bk1/3 + ck2/3 = 0, then prove that a = b = c = 0.

Sol. Given, 𝑎 + 𝑏𝑘 1⁄3 + 𝑐𝑘 2⁄3 = 0 …(i)

Multiplying both sides by k , we have
1/3

𝑎𝑘 1⁄3 + 𝑏𝑘 2⁄3 + 𝑐𝑘 = 0
Multiplying (i) by b and (ii) by c and then subtracting, we have
(𝑎𝑏 + 𝑏 2 𝑘 1⁄3 + 𝑏𝑐𝑘 2⁄3 ) − (𝑎𝑐𝑘 1⁄3 + 𝑏𝑐𝑘 2⁄3 + 𝑐 2 𝑘) = 0

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

⇒ (𝑏 2 − 𝑎𝑐 )𝑘 1⁄3 + 𝑎𝑏 − 𝑐 2 𝑘 = 0
⇒ 𝑏 2 − 𝑎𝑐 = 0 𝑎𝑛𝑑 𝑎𝑏 − 𝑐 2 = 0 [Since k1/3 is irrational]
⇒ 𝑏 2 = 𝑎𝑐 𝑎𝑛𝑑 𝑎𝑏 = 𝑐 2 𝑘
⇒ 𝑏 2 = 𝑎𝑐 𝑎𝑛𝑑 𝑎2 𝑏 2 = 𝑐 4 𝑘 2
⇒ 𝑎2 (𝑎𝑐 ) = 𝑐 4 𝑘 2 [By putting b2 = ac in a2 b2 = c4 k2]
3 2 4 3 2 3
⇒ 𝑎 𝑐 −𝑘 𝑐 = 0 ⇒ (𝑎 − 𝑘 𝑐 ) 𝑐 = 0

om
⇒ 𝑎3 − 𝑘 2 𝑐 3 = 0, 𝑜𝑟 𝑐 = 0

.c
𝑎3
Now, 𝑎3 − 𝑘 2 𝑐 3 = 0 ⇒ 𝑘2 =

ns
𝑐3

tio
⁄
2 )1⁄3 𝑎3 1 3 𝑎
⇒ (𝑘 = ( 3) ⇒ 𝑘 2⁄3 =
lu
𝑐 𝑐
so

𝑎
This is impossible as k2/3 is irrational and is rational.
k

𝑐
oo

∴ 𝑎3 − 𝑘 2 𝑐 3 ≠ 0
rtb

Hence, c=0
ce

Subtracting c = 0 in b2 – ac = 0, we get b = 0
Substituting b = 0 and c = 0 in a + bk1/3 + ck2/3 = 0, we get a = 0
.n

Hence, a = b = c = 0.
w
w

Que 3. Find the largest positive integer that will divide 398, 436 and 542 leaving
// w

remainders 7, 11 and 15 respectively.

s:

Sol. It is given that on dividing 398 by the required number, there is a remainder of 7.
tp

This means that 398 – 7 = 391 is exactly divisible by the required number. In other
ht

words, required number is a factor of 391.

Similarly required positive integer is a factor of 436 – 11 = 425 and 542 – 15 = 527.
Clearly, required number is the HCF of 391, 425 and 527.
Using the factor tree we get the prime factorisations of 391, 425 and 425 and 527 as
follows: 391 = 17 × 23, 425 = 52 × 17 and 527 = 17 × 31
∴ HCF of 391, 425 and 527 is 17.
Hence, required number = 17

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Long Answer Type Questions

[4 marks]
Que 1. Use Euclid’s division Lemma to show that the square of any positive integer is either
of the form 3m or 3m + 1 for some integer m.

Sol. Let a be an arbitrary positive integer.

Then by Euclid’s Division algorithm, corresponding to the positive integers a and 3 there
exist non-negative integers q and r such that

a = 3q + r where 0 < r < 3

om
⇒ a2 = 9q2 + 6qr + r2 …. (i) 0≤r<3

.c
ns
Case-I: When r = 0 putting on (i)

io
a2 = 9q2 = 3(3q2) = 3m where m = 3q2

t
lu
so
Case-II: r = 1
k
oo

A2 = 9q2 + 6q + 1 = 3(3q2 + 2q) + 1 = 3m + 1 where m = 3q2 + 2q

rtb

Case-III: r = 2
ce

A2 = 9q2 + 12q + 4 = 3(3q2 + 4q + 1) + 1 = 3m + 1 where m = (3q2 + 4q + 1)

.n
w

Hence, square of any positive integer is either of the form 3m or 3m + 1 for some integer m.
w
//w

Que 2. Show that one and only one out of n, n+2, n+4 is divisible by 3, where n is any
s:

positive integer.
tp

Sol. Let q be the quotient and r be the remainder when n is divided by 3.

ht

Therefore, n = 3q + r where r = 0, 1,2

⇒ n = 3q or n = 3q + 1 or n = 3q + 2

Case (i) if n = 3q, then n is divisible by 3, n + 2 and n + 4 are not divisible by 3.

Case (ii) if n = 3q + 1 then n + 2 = 3q + 3(q + 1), which is not divisible by 3 and n + 4 = 3q + 5,

which is not divisible by 3.

So, only (n + 4) is divisible by 3.

Hence one and only one out of n, (n+2), (n+4) is divisible by 3.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Que 3. Use Euclid’s division algorithm to find the HCF of:

(i) 960 and 432

(ii) 4052 and 12576

Sol. (i) since 960 > 432, we apply the division Lemma to 960 and 432.

We have, 960 = 432 × 2 + 96

Since the remainder 96 ≠ 0, so we apply the division lemma to 432 and 96.

We have, 960 = 432 × 4 + 48

Again remainder 48 ≠ 0, so we again apply division Lemma to 96 and 48.

om
We have, 96 = 48 × 2 + 0

.c
ns
The remainder has now become zero. So our procedure stops.

io
Since the divisor at this stage is 48.

t
lu
so
Hence, HCF of 960 and 432 is 48
k
oo

i.e., HCF (960, 432) = 48

rtb

(ii) Since 12576 > 4052, we apply the division lemma to 12576 and 4052 to get
ce

12576 = 4052 × 3 + 420

.n
w

Since the remainder 420 ≠ 0, we apply the division lemma to 4052 and 420, to get
w
//w

4052 = 420 × 9 + 272

s:

We consider the new divisor 272 and the new remainder 148, and apply the division lemma to
tp

get
ht

420 = 272 × 1 + 148

We consider the new divisor 272 and the new remainder 148, and apply the division lemma to
get

148 = 124 × 1 + 24

We consider the new divisor 124 and the new remainder 4, and apply the division lemma to get

24 = 4 × 6 + 0

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4,
the HCF of 12576 and 4052 is 4.

Que 4. Using prime factorization method, find the HCF and LCM of 30, 72 and 432. Also
show that HCF × LCM ≠ Product of the three numbers.

Sol. Given numbers = 30, 72, 432

30 = 2 × 3 × 5; 72 = 23 × 32 and 432 = 24 × 33

Here, 21 and 31 are the smallest powers of the common factors 2 and 3 respectively.

So, HCF (30, 72, 432) = 21 × 31 = 2 × 3 = 6

Again, 24, 33 and 51 are the greatest powers of the prime factors 2,3 and 5 respectively.

om
So, LCM (30, 72, 432) = 24 × 33 × 51 = 2160

.c
ns
HCF × LCM = 6 × 2160 = 12960

io
t
Product of numbers = 30 × 72 × 432 = 933120
lu
so
Therefore, HCF × LCM ≠ Product of the numbers.
k
oo

Que 5. Prove that √𝟕 is an irrational number.

rtb

Sol. Let us assume, to the contrary, that √7 is a rational number.

ce
.n

Then, there exist co-prome positive integers a and b such that

w

𝑎
w

√7 = , b≠0
𝑏
//w
s:

So, a = √7b
tp

Squaring both sides, we have

ht

a2 = 7b2

⇒ 7 divides a2 ⇒ 7 divides a

So, we can write

a = 7c, (where c is any integer)

Putting the value of a = 7c in (i), we have

49c2 = 7b2 ⇒ 7c2 = b2

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

It means 7 divides b2 and so 7 divides b.

So, 7 is a common factor of both a and b which is a contradiction.

So, our assumption that √7 is rational is wrong.

Hence, we conclude that √7 is an irrational number.

Que 6. Show that 5-√𝟑 is an irrational number.

Sol. Let us assume that 5-√3 is rational.

So, 5-√3 may be written as

𝑝

om
5-√3 = , where p and q are integers, having no common factor except 1 and q ≠ 0.
𝑞

.c
𝑝 5𝑞 − 𝑝

ns
⇒5 − = √3 ⇒ √3 =
𝑞 𝑞

tio
5𝑞 − 𝑝

lu
Since is a rational number which is a contradiction.
𝑞
k so
∴ √3 is also a rational number which is a contradiction.
oo
rtb

Thus, our assumption is wrong.

ce

Hence, 5 - √3 is an irrational number.

.n
w

Que 7. Using Euclid’s division algorithm, find whether the pair of numbers 847, 2160 are
w

co-prime or not.
//w

Sol. Since 2160 > 847 we apply the division lemma to 2160 and 847
s:
tp

We have, 2160 = 847 × 2 + 466

ht

Since remainder 466 ≠ 0. So we apply the division lemma to 847 and 466

847 = 466 × 1 + 381

Again remainder 381 ≠ 0. So we again apply the division lemma to 466 and 381.

466 = 381 × 1 + 85

Again remainder 85 ≠ 0. So we again apply the division lemma to 381 and 85.

381 = 85 × 4 + 41

Again remainder 41 ≠ 0. So we again apply the division lemma to 85 and 41.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

85 = 41 × 2 + 3

Again remainder 3 ≠ 0. So we again apply the division lemma to 41 and 3.

om
.c
41 = 3 × 13 + 2

ns
Again remainder 2 ≠ 0. So we again apply the division lemma to 3 and 2.

tio
lu
3=2×1+1 so
Again remainder 1 ≠ 0. So we again apply the division lemma to 2 and 1.
k
oo

2=1×4+0
rtb

The remainder now becomes 0. So, our procedure stops.

ce
.n

Since the divisor at this stage is 1.

w
w

Hence, HCF of 847 and 2160 is 1 and numbers are co-prime.

//w

Que 8. Check whether 6n can end with the digit 0 for any natural number n.
s:
tp

Sol. If the number 6n, for any n, were to end with the digit zero, then it would be divisible by 5.
ht

That is, the prime factorisation of 6n would contain the prime 5. But 6n = (2 × 3) n = 2n × 3n So
the primes in factorisation of 6n are2 and 3. So the uniqueness of the fundamental theorem of
arithmetic guarantees that there are no other primes except 2 and 3 in the factrosation of 6 n. So
there is no natural number n for which 6n ends with digit zero.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Short Answer Type Questions – II

[3 marks]
Que 1. An army contingent of 616 members is to march behind an army band of 32
members in a parade. The two groups are to march in the same number of columns. What
is the maximum number of columns in which they can march?
Sol. For the maximum number of columns, we have to find the HCF of 616 and 32.

Now, since 616 > 32, we apply division lemma to 616 and 32.

We have, 616 32 x 19 + 8

Here, remainder 8 ≠ 0 So, we again apply division lemma to 32 and 8.

om
.c
We have, 32 = 8 x 4 + 0

ns
Here, remainder is zero. So, HCF (616, 32) = 8

io
t
lu
Hence, maximum number of columns is 8. so
Que 2. Find the LCM and HCF of 12, 15 and 21 by applying the prime factorisation
k
oo

method.
rtb

Sol. The prime factors of 12, 15 and 21 are

ce

12 = 22 x 3, 15 = 3 x 5 and 21 = 3 x 7
.n
w

Therefore, the HCF of these integers is 3.

w
//w

22,31,51 and 71 are the greatest powers involved in the prime factors of 12, 15 and 21.
s:

So, LCM (12, 15, 21) = 22 x 31 x 51 × 71 = 420.

tp
ht

Que 3. Find the LCM and HCF of the following pairs of integers and verify that LCM x
HCF = product of the two numbers.
(i) 26 and 91 (ii) 198 and 144

Sol.
(i) We have, 26 = 2 x 13 and 91 = 7 x 13

Thus, LCM (26, 91) = 2 x 7 x 13 = 182

HCF (26, 91) = 13

Now, LCM x HCF = Product of two numbers = 26 x 91 = 2366
Hence, LCM x HCF = Product of two numbers.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

(ii) 144 = 24 x 32 and 198 = 2 x 32 x 11

∴ LCM (198, 144) = 24 x 32 x 11 = 1584

HCF (198, 144) = 2 x 32 = 18

Now, LCM (198,144) x HCF (198, 144) = 1584 x 18 = 28512

And product of 198 and 144 = 28512

Thus, product of LCM (198, 144)

And HCF (198, 144) = Product of 198 and 144.

om
Que 4. There is a circular path around a sports field. Sonia takes 18 minutes to drive one
round of the field, while Ravi takes 12 minutes for the same. Suppose they both start from

.c
the same point and at the same time, and go in the same direction. After how many minutes

ns
will they meet again at the starting point?

tio
Sol. To find the time after which they meet again at the
starting point,
lu
so
we have to find LCM of 18 and 12 minutes. We have
k
18 = 2 × 32
oo

And 12 = 22 × 3
rtb

Therefore, LCM of 18 and 12 - 22 × 32 = 36

So, they will meet again at the starting point after 36 minutes.
ce
.n

Que 5. Write down the decimal expansions of the following numbers:

w
w

𝟑𝟓 𝟏𝟓
(i) (ii)
//w

𝟓𝟎 𝟏𝟔𝟎𝟎
s:

35 35 35 × 2 70
(i) we have, = = =
tp

50 52 ×2 52 × 2 × 2 52 × 22
ht

70 70
= = = 0.70
102 100

15 15 15 × 54 15 × 625
(ii) We have, = = =
1600 26 × 52 24 × 22 × 52 × 54 26 × 56

9375 9375
= = = 0.009375
106 1000000
𝒂
Que 6. Express the number 0.3178 in the form of rational number 𝒃 .

Sol. Let x 0.3178

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Then x = 0.3178178178 …(i)

10x = 3.178178178 …(ii)

10000x = 3178.178178 …(iii)

On subtracting (ii) from (iii)

3175 635
9990𝑥 = 3175 ⇒ 𝑥 = =
9990 1998
635
∴ 0.3178 =
1998

om
Que 7. If n is an odd positive integer, show that (n2 - 1) divisible by 8.

.c
ns
Sol. We know that an odd positive integer n is of the form (4q+1) or (4q+3) for some integer q.

io
Case-I When n = (4q + 1)

t
lu
so
In this case n2 – 1 = (4q + 1)2 – 1 = 16q2 + 8q = 8q (2q + 1)
k
oo

Which is clearly divisible by 8.

rtb

Case-II When n = (4q +3)

ce

In this case, we have

.n

n2 – 1 = (4q + 3)2 – 1 = 16q2 + 24q + 8 = 8(2q2 + 3q + 1)

w
w

Which is clearly divisible by 8.

//w

Hence (n2 – 1) is divisible by 8.

s:
tp

Que 8. The LCM of two numbers is 14 times their HCF. The sum of LMC and HCF is 600.
ht

If one number is 280, then find the other number.

Sol. Let HCF of the numbers br x then according to question LCM of the number will be 14x
And x + 14x = 600 ⇒ x = 40
Then HCF = 40 and LCM = 14 × 40 = 560
∵ LCM × HCF = Product of the numbers
560 × 40
560 × 40 = 280 × Second number ⇒ Second numbers = = 80
280
Then other number is 80.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Que 9. Find the value of x, y and z, in the given factor tree. Can the value of ‘x’ be found
without finding the value of ‘y’ and ‘z’? If yes, explain.
Sol. Yes, value of x can be found without finding value of y or z as x = 2 × 2 × 2 × 17 which are
prime factors of x.
Que 10. Show that any positive odd integer is of the form 6q +1, or 6q + 3, or 6q +5, where
q is some integer.
Sol. Let a be any positive odd integer and b = 6. Then, by Euclid's algorithm, a = 6q + r, for
some
integer q ≥ 0 and 0 ≤ r ˂ 6.

om
i.e, the possible remainders are 0, 1, 2, 3, 4, 5.

.c
Thus, a can be of the form 6q, or 6q + 1, or 6q + 2, or 6q + 4 (since they are even).

ns
Thus, a is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.

io
t
Hence, any odd positive integer is of the form 6q+ 1 or 6q + 3 or 6q + 5, where q is some integer.
lu
so
Que 11. The decimal expansions of some real numbers are given below. In each case, decide
𝒑
k
whether they are rational or not. If they are rational, write it in the form 𝒒. What can you
oo

say about the prime factors of q?

rtb

(i) 0.140140014000140000… (ii) 𝟎. 𝟏𝟔

ce
.n

Sol. (i) we have, 0.140140014000140000… a non-terminating and non-repeating decimal

𝒑
w

expansion. So it is irrational. It cannot be written in the form of 𝒒.

w
//w

(ii) We have, 0. 16 a non-terminating but repeating decimal expansion. So, it is rational.

s:

Let x = 0. 16
tp
ht

Then x = 0.1616… …(i)

⇒ 100x = 16.1616… …(ii)
On subtracting (i) from (ii), we get
100x – x = 16.1616 – 0.1616
16 𝑝
⇒ 99x = 16 ⇒ x= =
99 𝑞

The denominator (q) has factors other than 2 or 5.

Downloaded from https://www.ncertbooksolutions.com/

 Downloaded from https://www.ncertbooksolutions.com/

Short Answer Type Questions – I

[2 marks]
Que 1. Can the number 4", n being a natural number, end with the digit 0? Give reason.
Sol. If 4n ends with 0, then it must have 5 as a factor. But, (4) n = (22)n i.e., the only prime factor
of 4n is 2. Also, we know from the fundamental theorem of arithmetic that the prime
factorization of each number is unique.
∴ 4n can never end with 0.
Que 2. Write whether the square of any positive integer can be of the form 3m + 2, where
m is a natural number. Justify your answer.

om
Sol. No, because any positive integer can be written as 3q, 3q + 1, 3q + 2, therefore, square will

.c
9q2 = 3m, 9q2 + 6q + 1 = 3 (3q2 + 2q) + 1 = 3m + 1,

ns
9q2 + 12q + 4 = 3(3q2 + 4q + 1) + 1 = 3m + 1.

t io
Que 3. Can two numbers have 18 as their HCF and 380 as their LCM? Give reason.
lu
so
Sol. No, because here HCF (18) does not divide LCM (380).
k

Que 4. Write a rational number between √3 and √5.

oo
rtb

18 9
Sol. A rational number between √3 and √5 is √324 = 1.8 = =
ce

10 5
.n

Que 5. The product of two consecutive integers is divisible by 2. Is this statement true or
w

false? Give reason.

w

Sol. True, because n (n + l) will always be even, as one out of the n or (n+ l) must be even.
//w

Que 6. Explain why 3 x 5 x 7 + 7 is a composite number.

s:
tp

Sol. 3 × 5 × 7 + 7 = 7 (3 × 5 + 1) = 7 × 16, which has more than two factors.

ht

Que 7. What is the least number that is divisible by all the numbers from 1 to 10?
Sol. Required number = LCM of 1, 2, 3,… 10 = 2520

Que 8. Find the sum 𝟎. 𝟔𝟖 + 𝟎. 𝟕𝟑.

68 73 141
Sol. 0. 68 + 0. 73 = + = = 1. 42
99 99 99

Que 9. “the product of three consecutive positive integers is divisible by 6”. Is this statement true or
false? Justify your answer.

Sol. True, because n(n + 1)(n + 2) will always be divisible by 6, as at least one of the factors will
be divisible by 2 and at least one of the factors will be divisible by 3.

Downloaded from https://www.ncertbooksolutions.com/