Real Numbers CLASS 10 QUESTIONS

Download as pdf or txt
Download as pdf or txt
You are on page 1of 8

Question 1. Show that for any positive integer ‘n’, n2 – n is divisible by 2.

Proof :

Let ‘n’ be a positive integer.


Therefore by Euclid’s division lemma, n = bq + r, 0 ≤ r < b ---------------- (1)
Since we have to show that n2 – n is divisible by 2, here we take b= 2
 r=0&1
we now write n2 – n = n(n – 1)

Case 1 : When r = 0

n = 2q + 0 [from (1)]
i.e. n = 2q
n – 1 = 2q – 1
so n(n – 1) = 2q x (2q – 1)
Hence it is divisible by 2

Case 1 : When r = 1

n = 2q + 1 [from (1)]
n – 1 = 2q + 1 – 1 = 2q
so n(n – 1) = (2q + 1) x 2q
Hence it is divisible by 2.

Therefore, from case 1 and case 2 it implies that n2 – n is always divisible by 2 for
any positive integer n.

Hence proved.

Question 2. Show that one and only one out of n, n + 2 or n + 4 is divisible by 3 for
any positive integer ‘n’.

Proof :

Let ‘n’ be a positive integer.


Therefore by Euclid’s division lemma, n = bq + r, 0 ≤ r < b ---------------- (1)
Since we have to check the divisibility by 3, here we take b= 3
 r = 0,1 & 2
Case 1 : When r = 0

n = 3q + 0 [from (1)]
i.e. n = 3q It is divisible by 3
n + 2 = 3q + 2
n + 4 = 3q + 4

Case 2 : When r = 1

n = 3q + 1 [from (1)]
n + 2 = 3q + 1 + 2 = 3q + 3 = 3 (q + 1) It is divisible by 3
n + 4 = 3q + 4

Case 3 : When r = 2

n = 3q + 2 [from (1)]
n + 2 = 3q + 2 + 2 = 3q + 4
n + 4 = 3q + 2 + 4 = 3q + 6 = 3 (q +2) It is divisible by 3

Hence from cases 1, 2 & 3, we observe that one and only one out of n, n +2 or n + 4
is divisible by 3.

Hence proved.

Question 3. Show that n3 – n is divisible by 6 for any positive integer n.

Proof :

Let ‘n’ be a positive integer.


Therefore by Euclid’s division lemma, n = bq + r, 0 ≤ r < b ---------------- (1)
Since we have to show that n3 – n is divisible by 6, here we take b= 6
 r = 0,1,2,3,4 & 5
we now write n3 – n = n(n2 – 1) = n (n + 1) (n – 1)

Case 1 : When r = 0

n = 6q + 0 = 6q [from (1)]
n + 1 = 6q + 1
n – 1 = 6q – 1
Now we have n (n + 1) (n – 1) = 6q x (6q +1) x (6q – 1).
Therefore it is divisible by 6

Case 2 : When r = 1

n = 6q + 1 [from (1)]
n + 1 = 6q + 1 + 1 = 6q + 2
n – 1 = 6q + 1 – 1 = 6q
Now we have n (n + 1) (n – 1) = 6q x (6q +1) x (6q + 2).
Therefore it is divisible by 6

Case 3 : When r = 2

n = 6q + 2 [from (1)]
i.e.n = 2(3q + 1)
n + 1 = 6q + 2 + 1 = 6q + 3 = 3(2q + 1)
n – 1 = 6q + 2 – 1 = 6q + 1
Now we have n (n + 1) (n – 1) = 2(3q + 1) x 3(2q + 1) x (6q + 1)
= 6 x (3q +1) x (2q + 1) x (6q + 1).
Therefore it is divisible by 6

Case 4 : When r = 3

n = 6q + 3 [from (1)]
i.e.n = 3(2q + 1)
n + 1 = 6q + 3 + 1 = 6q + 4 = 2(3q + 2)
n – 1 = 6q + 3 – 1 = 6q + 2
Now we have n (n + 1) (n – 1) = 3(2q + 1) x 2(3q + 2) x (6q + 2)
= 6 x (2q +1) x (3q + 2) x (6q + 2).
Therefore it is divisible by 6

Case 5 : When r = 4

n = 6q + 4 [from (1)]
i.e.n = 2(3q + 2)
n + 1 = 6q + 4 + 1 = 6q + 5
n – 1 = 6q + 4 – 1 = 6q + 3 = 3(2q + 1)
Now we have n (n + 1) (n – 1) = 2(3q + 2) x 3(2q + 1) x (6q + 5)
= 6 x (2q +1) x (3q + 2) x (6q + 5).
Therefore it is divisible by 6

Case 6 : When r = 5

n = 6q + 5 [from (1)]
n + 1 = 6q + 5 + 1 = 6q + 6 = 6 (q + 1)
n – 1 = 6q + 5 – 1 = 6q + 4
Now we have n (n + 1) (n – 1) = (6q + 5) x 6 (q + 1) x (6q + 4)
= 6 x (q +1) x (6q + 4) x (6q + 5).
Therefore it is divisible by 6

In all the cases above, we observe that n (n – 1) (n + 1) is divisible by 6.


Hence proved that n3 – n is divisible by 6 for any positive integer n.

Question 4. Show that √3 + √5 is irrational.

Proof Let us assume, to the contrary that √3 + √5 is rational.


𝑎
Thus we can find coprime a and b (b ≠ 0) such that √3 +√5 =
𝑏
𝑎
Rearranging, we get. √3 = − √5 ---------------------- (1)
𝑏
Squaring on both sides of (1), we have,
𝑎
(√3)2 = ( − √5)2
𝑏
𝑎2 2a√5
i.e 3 = 2 – + (√5)2
𝑏 𝑏
2a√5 𝑎2 2
Rearranging, we have = + (√5) – 3
𝑏 𝑏2 2
𝑎
= 2+5 –3
𝑏
𝑎2
= 2 +2
𝑏
2a√5 𝑎2+2𝑏2
=
𝑏 𝑏2

𝑎2+2𝑏2 𝑏
Therefore we have √5 = x ---------------(2)
𝑏2 2𝑎

Since 2,a and b are integers, R.H.S of equation (2) is rational.


So √5 is rational.
But this contradicts the fact that √5 is irrational.
This contradiction arises due to our wrong assumption that √3 +√5 is rational.

Hence we conclude that √3 +√5 is irrational.

[Note : If this question is asked for 3 or 4 marks, after equation (2) we have to prove
the irrationality of √5 also].

*Alternate Proof : We can separately prove both √3 and √5 are irrational and
then we can conclude that sum of any two irrational numbers is always irrational.

Question 5. If the H.C.F of 56 and 72 is expressed as a linear combination in the


form 56x + 72y, find the values of x and y.

Solution :

Step 1: To find the H.C.F of 56 and 72


Here 72 > 56.
So by Euclid’s division algorithm, we have
72 = 56 x 1 + 16 --------------------(1)
56 = 16 x 3 + 8 --------------------(2)
16 = 8 x 2 + 0 --------------------(3)
Hence H.C.F (72,56) = 8

Step 2 :To express 8 as a linear combination of 56 and 72.


From (2) we have 8 = 56 – 16 x 3
i.e. 8 = 56 – (72 – 56 x 1) x 3 [From (1), replacing 16 as 72 – 56 x 1) x 3 ]
= 56 – 72 x 3 + 56 x 1 x3
= 56 – 72 x 3 + 56 x 3
= 56 x 1 – 72 x 3 + 56 x 3
i.e. 8 = 56 (1 + 3) – 72 x 3
= 56 x 4 – 72 x 3
= 56 x 4 + 72 x (–3)
i.e. 8 = 56 x + 72y , where x = 4 and y = –3

Hence if the H.C.F(56,72) is expressed as 56x + 72y, we have x = 4 and y = – 3

Question 6. If the H.C.F of 210 and 55 is expressed in the form 210 x 5 + 55 x y,


find the value of y.

Solution :

Step 1 : To find the H.C.F of 210 and 55


Here 210 > 55
So by Euclid’s division algorithm, we have,
210 = 55 x 3 + 45
55 = 45 x 1 + 10
45 = 10 x 4 + 5
10 = 5 x 2 + 0

Hence H.C.F (210,55) = 5

Step 2: Given that H.C.F (210,55) can be expressed as 210 x 5 + 55 x y


 5 = 210 x 5 + 55 x y
i.e 5 = 1050 + 55y
Rearranging we have, 55y = 5 – 1050
55y = –1045
–1045
y= = – 19
55
Hence the value of y is – 19.
1. If H.C.F (a , b) = 12 and a x b = 1800, then find L.C.M (a ,b).

2. What is the H.C.F of the smallest composite number and the smallest Prime
number?

3. If a and b are two positive integers such that the least prime factor of ‘a’ is 3
and the least prime factor of ‘b’ is 5, then find the least prime factor of (a +b).

4. The decimal expansion of 6137 will terminate after how many places of
80
decimals?
5. Can two numbers have 18 as their H.C.F and 380 as their L.C.M? Give
reason.

6. If H.C.F (35, 45) = 5 and L.C.M (35, 45) = 63 x p, then find the value of p.

7. If two positive integers m and n are written as m = a4b2, n = a2b3, a, b are


prime numbers, then find H.C.F (m , n).

8. Use Euclid’s Division Algorithm to find the H.C.F of (i) 1656 and 4025 (ii)
240 and 228.

9. Explain why 7 x 11 x 13 x 15 + 15 is a composite number.

10. Show that the number 7n cannot end with the digit zero where n is a natural
number.

11. Check whether 15n can end with the digit zero for any n € N.

13. Given that H.C.F (1133, 515) = 103, find L.C.M (1133, 515).

14. Given that L.C.M (306, 1314) = 22338, find H.C.F (306, 1314).
15. Show that any positive odd integer ‘n’ is of the form 8q + 1 or 8q + 3 or 8q
+ 5 or 8q + 7 where q is some integer.

16. Using prime factorisation method, find the H.C.F and L.C.M of 30, 72 and
432.

17. Check whether the following rational numbers have terminating or non-
terminating recurring decimal expansion. Also find the decimal expansion if it
is terminating.
(i) 12 (iii) 77 (iv) 29
75 210 343
(ii) 2
3
X
55

18. Prove that √7 is irrational.

19. Show that 5 - √3 is irrational.

20. Show that √2 - √5 is irrational.

21. The H.C.F of 65 and 117 is expressible in the form 65 m – 117 n. Find the
values of m and n.

22. Prove that √3 - √7 is irrational.

23. The length, breadth and height of a room are 8 m 25 cm, 6 m 75 cm and 4 m
50 cm respectively. Determine the length of the longest rope which can measure
the three dimensions of the room exactly.

24. Three bells toll at intervals of 9, 12, 15 minutes respectively. If they start
tolling together, after what time will they toll together next?

25. Find the H.C.F of 81 and 237 and express it as a linear combination 81 x +
237 y for some xand y.

26. Find the largest number that will divide 398, 436 and 542 leaving
remainders 7, 11 and 15 respectively.

27. Three sets of English, Hindi and Maths books have to be stacked in such a
way that all the books are to be stored subject wise and the height of each stack
is same. The number of English books is 96, Hindi books is 240 and Maths
books is 336. Assuming that the books are of the same thickness, determine the
number of stacks of English, Hindi and Maths books.

28. Prove that the product of 3 consecutive positive integers is divisible by 6.


29. Prove that the square of any positive integer is of the form 4q or 4q + 1 for
some integer q.

30. Prove that the square of any positive integer is of the form 5q, 5q + 1, 5q + 4
for some integer q.

31. Find the largest number which divides 615 and 963 leaving remainder 6 is
each case.

32. Two brands of chocolates are available in packs of 24 and 15 respectively. If


I need to buy an equal number of chocolates of both kinds, what is the least
number of boxes of each kind I would need to buy?

33. Find the greatest number of 6 digits exactly divisible by 24, 15, and 36.

34. Prove that one of any three consecutive positive integers must be divisible
by 3.

35. Complete the following factor tree of prime factorisation :

140 13915

2 35 11

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy