CHAPTER

Real Numbers 1
YOURSELF SOLUTIONS

1. Let n = 5q + 1, where q is a positive integer 5. Given numbers are 1305, 1365 and 1530
Squaring both sides, we get Q 1530 > 1365 > 1305
n2 = (5q + 1)2 = 25q2 + 10q + 1 \ By applying Euclid’s division lemma to 1530 and
= 5(5q2 + 2q) + 1 = 5m + 1, 1365, we get
where m = 5q2 + 2q is an integer 1530 = 1365 × 1 + 165,
Hence, the square of any positive integer of the form 1365 = 165 × 8 + 45,
5q + 1 is of the same form. 165 = 45 × 3 + 30,
2. On dividing n by 3, let q be the quotient and r be the 45 = 30 × 1 + 15, 30 = 15 × 2 + 0
remainder. Since, remainder is 0 when divisor is 15
Then, by Euclid’s division lemma, \ HCF (1530, 1365) is 15
n = 3q + r, where 0 ≤ r < 3 Now, applying Euclid’s division lemma to 1305 and 15,
⇒ n = 3q or n = 3q + 1 or n = 3q + 2 we get
Case I : If n = 3q, which is divisible by 3 1305 = 15 × 87 + 0
but (n + 1) and (n + 2) are not divisible by 3. Since, remainder is 0, when divisor is 15
\ HCF (1305, 15) is 15
So, in this case, only n is divisible by 3.
Hence, HCF of 1305, 1365 and 1530 is 15.
Case II : If n = 3q + 1, then n + 2 = 3q + 3
= 3(q + 1) which is divisible by 3 6. (i) Using factor tree method, we have
but n and (n + 1) are not divisible by 3. 4095
So, in this case, only (n + 2) is divisible by 3.
Case III : If n = 3q + 2, then n + 1 = 3q + 3 3 1365
= 3(q + 1) which is divisible by 3
but n and (n + 2) are not divisible by 3.
3 455
So, in this case, only (n + 1) is divisible by 3.
Thus, one and only one out of n, (n + 1) and (n + 2) is
divisible by 3. 5 91

3. Here, 250 > 30

\ Applying Euclid’s division lemma, we get 7 13

250 = 30 × 8 + 10 2
\ 4095 = 3 × 3 × 5 × 7 × 13 = 3 × 5 × 7 × 13
Since, remainder, 10 ≠ 0 (ii) Using factor tree method, we have
\ Applying Euclid’s division lemma to 30 and 10, we get
1001
30 = 10 × 3 + 0
Since, remainder is 0, when divisor is 10
\ By Euclid’s division algorithm, 7 143
HCF (250, 30) = 10
4. The required number of soaps in each box is HCF of 11 13

612 and 342. \ 1001 = 7 × 11 × 13

By Euclid’s division algorithm, we have 7. We have, 9 × 13 × 17 + 17
612 = 342 × 1 + 270, = 17(9 × 13 + 1) = 17(117 + 1) = 17 × 118, which is not a
342 = 270 × 1 + 72, prime number because it has 17 as a factor other than 1
270 = 72 × 3 + 54, and the number itself.
72 = 54 × 1 + 18, \ 9 × 13 × 17 + 17 is a composite number.
54 = 18 × 3 + 0 Also, we have 5 × 6 × 7 × 8 × 9 + 7 = 7(5 × 6 × 8 × 9 + 1),
Here, remainder is 0, when divisor is 18 which is again not a prime number because it has 7 as a
\ HCF (612, 342) is 18 factor other than 1 and the number itself.
So, the trader can pack 18 soaps in each box. \ 5 × 6 × 7 × 8 × 9 + 7 is a composite number.
2 100 PERCENT Mathematics Class-10
8. If any number ends with the digit 0 or 5, it is always
15. Let us assume that 3 is rational
divisible by 5.
So, we can find integers a and b (b ≠ 0 and a, b are co-
If 12n ends with the digit zero or five, it must be divisible
prime) such that
by 5.
a
This is possible only if prime factorisation of 12n contains 3 = ⇒ 3b = a
b
the prime number 5.
Now, 12 = 2 × 2 × 3 = 22 × 3 ⇒ 3b2 = a2 [Squaring both sides]
\ 3 divides a2 ⇒ 3 divides a  ...(ii)
⇒ 12n = (22 × 3)n = 22n × 3n
So, we can write a = 3m, where m is an integer
Since, there is no term containing 5.
Putting a = 3m in (i), we get
Hence, there is no value of n for which 12n ends with the
3b2 = 9m2 ⇒ b2 = 3m2
digit zero or five.
\ 3 divides b2 ⇒ 3 divides b...(iii)
9. The prime factorisation of 144, 180 and 192 is, From (ii) and (iii), 3 is a common factor of a and b, which
144 = 2 × 2 × 2 × 2 × 3 × 3 = 24 × 32 contradicts the fact that a and b are co-prime.
180 = 2 × 2 × 3 × 3 × 5 = 22 × 32 × 5 \ Our assumption that 3 is rational is wrong.
192 = 2 × 2 × 2 × 2 × 2 × 2 × 3 = 26 × 3
Hence, 3 is irrational.
\ HCF (144, 180, 192) = 22 × 3 = 12
and LCM (144, 180, 192) = 26 × 32 × 5 = 2880 16. Let us assume that 3 + 2 is rational.
So, we can find two integers a and b (b ≠ 0 and a, b are
10. Since, the books are to be distributed equally among
the students of section A or section B. co-prime)
a
So, number of books must be a multiple of 32 as well such that 3 + 2 = , ⇒ 2 = a − 3 = a − 3b
as 36 b b b
a − 3b
\ Required number of books is the LCM of 32 and 36 Here, is rational [Q a and b are integers]
b
Prime factorisation of 32 and 36 is
32 = 2 × 2 × 2 × 2 × 2 = 25
⇒ 2 is rational, which contradicts the fact that 2 is
irrational
36 = 2 × 2 × 3 × 3 = 22 × 32
\ Our supposition is wrong.
\ LCM of 32 and 36 is 25 × 32 = 288
Hence, required number of books is 288. Hence, 3 + 2 is irrational.
11. Given, HCF (a, b) = 11 17. We have a rational number 23.3408, whose decimal
expansion terminates.
Product of a and b = 7623
Product of a and b 233408 233408 2 6 × 7 × 521
\ LCM (a, b) = Now, 23.3408 = = =
HCF ( a , b ) 10000 10 4 2 4 × 54
7623 2 2 × 7 × 521 14588
⇒ LCM (a, b) = = 693 = =
11 54 2 0 × 54
14588
12. Given HCF (2520, 6600) = 120 Thus, 23.3408 can be expressed as , where
LCM (2520, 6600) = 252 × k 2 0 × 54
Now, HCF (2520, 6600) × LCM (2520, 6600) = 2520 × 6600 numerator and denominator are co-prime and
⇒ (120) × (252 × k) = 2520 × 6600 denominator is of the form 2m × 5n, where m, n are non-
2520 × 6600 negative integers.
⇒ k= = 550 18. Here, denominator,
252 × 120
22 × 153 = 22 × (5 × 3)3 = 22 × 53 × 33
13. We know that HCF (a, b) × LCM (a, b) = product of
129
a and b \ will be a non-terminating repeating
⇒ 12 × LCM (a, b) = 1152 2 × 53 × 33
2

1152 decimal expansion because it contain 3 as a factor in its

⇒ LCM (a, b) = = 96 denominator.
12
14. Given, x = p2q3, y = p3q, where p and q are primes. 19. As, we need only 10 as denominator, so we multiply
LCM (x, y) = p3q3 1 3
with
HCF (x, y) = p2q 3 10
Now, LCM (x, y) = p3q3 = pq2p2q = pq2 × HCF (x, y) 1 3 1
\ × = = 0.1
\ LCM is a multiple of HCF. 3 10 10
Visit www.mtg.in for complete information