REAL NUMBER.

Class-10 Mathematics Important questions & Worksheet

Practice Questions and worksheet for Chapter-1

Real Numbers

Q. Find the HCF of 128, 240 using Euclid’s Division Algorithm.

Sol.: 240 = 128 × 1 + 112

128 = 112 × 1 + 16

112 = 16 × 7 + 0® Remainder is zero.

HCF of 112 and 16 is 16.

HCF of 240 and 128 is 16.

Q. A number when divided by 61 gives 27 as quotient and 32 as remainder.

Find the number.

Sol.: a = ?, b = 61, q = 27, r = 32

Using Euclid’s Division Algorithm

a = bq + r = 61´ 27 + 32 = 1647 + 32 = 1679

The required number is 1679. Q. For a pair of integers 151, 16, find the
quotient q and the remainder r when the larger number a is divided by the
smaller number b and verify that a = bq + r and 0 £ r < b .

Sol.: Given pair of integers = 151, 16 16 151 9

144
Suppose a = 151, b = 16
7
After dividing 151 by 16, we have q = 9 and r = 7
Which satisfies 0 £ r < 16 .
It verifies a = bq + r
Þ 151 = 16 ´ 9 + 7
151 = 151
Q. Find the number by which 546 should be divided to get 7 as quotient and 7
as remainder.
Sol.: a = 546, b = ?, q = 7, r = 7.

Using Euclid’s Division Algorithm

a =b´q + r

546 = b ´ 7 + 7

546 - 7 = b ´ 7

539
=b
7

77 = b

546 should be divided by 77.

Q. Use Euclid’s Division Algorithm to show that the square of any positive
integer is either of the form 3m or 3m + 1 for some integer m.

Sol.: Let x be any positive integer

Taking a = x and b = 3. So x may be either

x = 3q + 0, 3q + 1, 3q + 2 for 0 £ r < 2 [by division algorithm]

Þ ( )
x 2 = (3q + 0)2 = 9q 2 = 3 3q 2 = 3m [taking 3q 2 = m]

Þ x 2 = (3q + 1)2 = 9q 2 + 6q + 1 = 3(3q 2 + 2q ) + 1 = 3m + 1 [taking 3q 2 + 2q = m]

also x 2 = (3q + 2)2 = 9q 2 + 12q + 4 = 3(3q 2 + 4q + 1) + 1 = 3m + 1

[taking 3q 2 + 4q + 1 = m]

Thus, we see that x 2 may be of the form either 3 m or 3m + 1 for some integer
m.

Q. Use Euclid’s division algorithm to show that the cube of any positive
integer is either of the form 9q, 9q + 1 or 9q + 8.

2
Sol.: Let x be any positive integer. Then x = 3m, 3m +1, 3m + 2.

Let a = x, b = 3, then by Euclid’s Algorithm

When x = 3m Þ x 3 = (3m)3 = 9 ´ 3m 3 = 9q [q = 3m3]

When x = 3m + 1 Þ x 3 = (3m + 1)3 = 27m 3 + 27m 2 + 9m + 1

= 9q + 1 [Let q = 3m 3 + 3m 2 + m]

When x = 3m + 2 Þ x 3 = (3m + 2) 3 = 27m 3 + 54m 2 + 36m + 8

= 9(3m 3 + 6m 2 + 4m) + 8

= 9q + 8 [Let q = 3m 3 + 6m 2 + 4m]

Thus, we see that x3 may be of the form 9q, 9q + 1 and 9q + 8 for any integer x.

Q. Show that only one of the numbers (n + 2), n and (n + 4) is divisible by 3.

Sol.: Let n be any positive integer.

On dividing n by 3, let q be the quotient and r be the remainder.

Then, by Euclid’s division lemma, we have

n = 3q + r , where 0 £ r < 3

Þ n = 3q + r where r = 0, 1 or 2

Þ n = 3q (where r = 0 ), n = 3q + 1 (when r = 1)

and n = 3q + 2 (when r = 2)

The following table shows

the divisibility of n, n + 2 and n + 4 by 3.

3
 Positive n n+2 n+4
intege
r (n)
Cas When 3q (3q) + 2 (3q) + 4
e 1: n = 3q = 3(q +
1) + 1
Division divisible leaves leaves
by 3 remainde remainde
r2 r1
\ not \ not
divisible divisible
Case 2: When 3q + 1 (3q + 1) + 2 (3q + 1) + 4
n = 3q = 3(q + = 3(q +
+1 1) 1) +2
Division leaves divisible leaves
by 3 remainde remainde
r1 r2
\ not \ not
divisible divisible
Case 3: When 3q + 2 (3q + 2) + 2 (3q + 2) + 4
n = 3q = 3(q + = 3(q +
+2 1) + 1 2)
Division leaves Leaves divisible
by 3 remainde remainde
r2 r1
\ not \ not
divisible divisible
In case 1, n is divisible by 3 but n + 2 and n + 4 are not divisible by 3.

In case 2, n + 2 is divisible by 3 but n and n + 4 are not divisible by 3.

In case 3, n + 4 is divisible by 3 but n and n + 2 are not divisible by 3.

Hence, one and only one out of n, n + 2 or n + 4 is divisible by 3, where n is any

positive integer.

Q. Show that any positive even integer is of the form 4q, 4q + 2, where q is
some integer.

4
Sol.: Let a be any positive even integer and b = 4.

By Euclid’s Division lemma, we have

a = 4q + r where 0£r<4

(i) a = 4q, when r = 0

or a = 2(2q)

\ It is a multiple of 2.

(ii) a = 4q + 1 when r = 1

or a = 2(2q) + 1

\ It is not a multiple of 2.

(iii) a = 4q + 2 when r = 2

or a = 2(2q + 1)

\ It is a multiple of 2.

(iv) a = 4q + 3 when r = 3

or a = 2(2q + 1) + 1

\ It is not a multiple of 2.

Thus, a = 4q and a = 4q + 2 are positive even integers only.

Q. Show that n 2 - n is divisible by 2 for every positive integer n.

Sol.: Any positive integer is of the form 2q or 2q + 1 for some integer q.

5
 Case I:

When n = 2q

Þ n2 – n = 4q 2 - 2q = 2q(2q - 1) = 2m where m = q(2q - 1)

Hence n 2 - n is divisible by 2.

Case II:

When n = 2q + 1,

Þ n2 – n = (2q + 1) 2 - (2q + 1)

= 4q 2 + 1 + 4q - 2q - 1

= 4q 2 + 2q

= 2q(2q + 1)

= 2m¢ where m¢ = q (2q + 1)

Þ n 2 - n is divisible by 2 also.

Hence, n 2 - n is divisible by 2 for every +ve integer m and m¢.

a´b´c
Q. If a = xq + ar , b = yq + br , c = zq + c r , then show that remainder of is
q
a r ´ br ´ c r 3 560
same as the remainder of . Also, find out the remainder of .
q 8

Sol.: We have

a ´ b ´ c = ( xq + ar ) ( yq + br ) ( zq + c r )

= ( xyq 2 + xbr q + yar q + ar br ) ( zq + c r )

= xyzq 3 + xzbr q 2 + yzar q 2 + ar br zq + xyc r q 2 + xbr c r q + yqa r c r + ar br c r

6
 = q( xyzq 2 + xzbr q + yzar q + ar br z + xyc r q + xbr c r + yar c r ) + ar br c r

[Taking q common]

= qn + ar br c r

where n = xyzq 2 + xzbr q + yzar q + ar br z + xyc r q + xbr c r + yar c r

a ´ b ´ c qn + ar br c r qn ar br c r a bc
Now, = = + =n+ r r r
q q q q q

abc a bc
\ The remainder of is same as remainder of r r r .
q q

Now
3 560
=
( )
32
280

=
9 280
[ (a m ) n = a mn ]
8 8 8

[9 ´ 9 ´ 9... ´ 9 (280 times) ]

=
8

Now using the above result, we get remainder for

3 560 9 ´ 9 ´ 9... ´ 9 (280 times)

=
8 8

1´ 1´ 1´ ... ´ 1 (280 times )

=
8

1
=
8

3 560
\ The remainder of is 1. [i.e. numerator is the remainder]
8

Q. Is 7 × 11 × 13 + 11 a composite number?

Sol.: 11´ (7 ´ 13 + 1) = 11´ (91 + 1) = 11 × 92 = 1012

It is a composite number which can be factorized into primes.

7
Q. Find the missing numbers.

Sol.: Going upwards

165 × 2 = 330
2
330 × 2 = 660
2 165

Q. Write the prime factorization of (i) 72 (ii) 5005

Sol.:

72 5005
36 1001
1001
2 5
18 143
2 7
9 13
2 11
3
3

72 = 2 × 2 × 2 × 3 × 3 5005 = 5 × 7 × 11 × 13

Q. Find HCF and LCM of 45, 75 and 125.

Sol.: 45 = 3 × 3 × 5 = 32 × 5

75 = 3 × 5 × 5 = 3 × 52

125 = 5 × 5 × 5 = 53

HCF = 51 = 5

LCM = 32 × 53 = 9 × 125 = 1125

Q. Given that HCF (306, 657) = 9. Find the LCM (306, 657).
Sol.: HCF (306, 657) × LCM (306, 657) = 306 × 657

Þ 9 × LCM (306, 657) = 306 × 657

306 ´ 657
Þ LCM (306, 657) = = 34 ´ 657
9

8
 Þ LCM (306, 657) = 22338

Q. Find the largest positive integer that will divide 398, 436 and 542 leaving
remainder 7, 11 and 15 respectively.

Sol.: Given condition is that on dividing 398 by the required number, there is a
remainder of 7 so that 398 – 7 = 391 is exactly divisible by the required number
or the required number is a factor of 391.

In the same way, required positive integer is a factor of 436 – 11 = 425 and
542 – 15 = 527 also

Clearly, required number is the HCF of 391, 425 and 527.

Using the factor tree for the prime factorization of 391, 425 and 527 are as under:

391 = 17 ´ 23, 425 = 5 2 ´ 17 and 527 = 17 ´ 31

\ HCF of 391, 425 and 527 is 17

Hence, required number = 17

Q. Find the HCF and LCM of 26 and 91 and verify that L.C.M. × H.C.F.

= product of two numbers.

Sol.: By prime factorization

26 = 2 × 13

91 = 7 × 13

HCF (26, 91) = 13

LCM (26, 91) = 13 × 2 × 7 = 26 × 7 = 182

LCM × HCF = 13 × 182 = 2366

Product of two numbers = 26 × 91 = 2366.

9
 Hence, L.C.M. × H.C.F. = Product of two numbers.

Q. 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.: In order to find the maximum number of column in which army contingent can
march. We have to find the largest number that divides 616 and 32.

Clearly, such a number is the HCF.

616 = 2 × 2 × 2 × 7 × 11 = 23 × 7 × 11

32 = 2 × 2 × 2 × 2 × 2 = 25

H.C.F. = 23 = 8

Hence, 8 is the maximum number of columns in which they can march.

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

Sol.: Greatest number of 6 digits is 999999. In order to find the greatest 6 digit number
divisible by 24, 15, 36, we find their LCM.

L.C.M. of 24, 15 and 36 = 360

360 999999 2777

720
2799
2520
2799
2520
2799
2520
279

Subtracting remainder i.e., 279 from 999999, we get

999999 – 279 = 999720

10
 Hence, 999720 is the largest 6 digit number divisible by 24, 15 and 36. Q. If d
is the HCF of 56 and 72, find x, y satisfying d = 56x + 72y. Also, show that
x and y are not unique.

Sol.: Applying Euclid’s division lemma to 56 and 72, we get

72 = 56 ´ 1+16 …(i)

56 = 16 ´ 3 + 8 …(ii)

16 = 8 ´ 2 + 0 …(iii)

\ Last divisor 8 is the HCF of 56 and 72.

From (ii), we get

8 = 56 – 16 ´ 3

Þ 8 = 56 – (72 – 56 ´ 1) ´ 3 [From equation (i)]

Þ 8 = 56 – 3 ´ 72 + 56 ´ 3

Þ 8 = 56 ´ 4 + (–3) ´ 72

Comparing it with d = 56x + 72y, we get x = 4 and y = –3.

Now, 8 = 56 ´ 4 + (–3) ´ 72

8 = 56 ´ 4 + (–3) ´ 72 – 56 ´ 72 + 56 ´ 72

Þ 8 = 56 ´ 4 – 56 ´ 72 + (–3) ´ 72 + 56 ´ 72

Þ 8 = 56 ´ (4 – 72) {(–3) + 56} ´ 72

Þ 8 = 56 ´ (–68) + (53) ´ 72

Þ x = –68 and y = 53.

Hence, x and y are not unique.

Q. Prove that 2 is not a rational number.

11
Sol.: Let 2 is a rational number

p
\ 2= [p and q are co-prime and q ¹ 0]
q

Squaring both sides

p2
2=
q2

Þ 2q 2 = p 2

Þ p 2 is even so p is even.

Let p = 2r

Þ 2q 2 = (2r ) 2 = 4r 2

Þ q 2 = 2r 2

Þ q 2 is even so q is even.

Hence, p and q have 2 as a common factor or p and q are not co-prime.

So, our supposition is wrong.

\ 2 is not a rational number.

Q. Show that 5 - 3 is irrational.

a
Sol.: Let 5 - 3 be rational equal to , where a and b are co-primes and b ¹ 0
b

a
Then 5 - 3 =
b

a
Þ 5- = 3
b

12
 5b - a
Þ = 3
b

Þ 3 is rational [ ! a, b are integers and difference of two rational number

5b - a
is rational. \ is a rational number]
b

This contradicts the fact that 3 is irrational.

So, our assumptions are incorrect.

Hence, 5 - 3 is an irrational number.

Q. Prove that 3 + 5 is an irrational number.

a
Sol.: Suppose 3 + 5 is a rational number and can be taken as , b ¹ 0 and a, b
b
are co-prime.

a
Þ 3+ 5= [Rational]
b

Squaring both sides

a2
3+5+2 3 5 =
b2

a2
Þ 8 + 2 15 =
b2

a 2 - 8b 2
Þ 15 =
2b 2

LHS is 15 which is irrational while RHS is rational.

So, our supposition is wrong.

Hence, 3 + 5 is not a rational number.

13
Q. What can you say about the prime factorization of the denominators of the
following rationales:

(i) 36.12345

(ii) 36.5678

Sol.: (i) Since 36.12345 has terminating decimal expansion. So, its denominator
is of the form 2 m ´ 5 n where m, n are non-negative integers.

(ii) Since 36 .5678 has non terminating repeating decimal expansion. So, its
denominator has factors other than 2 or 5.

14