CLASS: X (CBSE) Real Numbers

Euclid’s Division Lemma

1. Show that every positive even integer is of the form 2q, and that every positive odd
integer is of the form 2q + 1, where q is some integer. (2 M)
Solution :
Let a be any positive integer and b = 2. Then, by Euclid’s algorithm, a = 2q + r, for some
integer q ≥ 0, and r = 0 or r = 1, because 0 ≤ r < 2. So, a = 2q or 2q + 1.
If a is of the form 2q, then a is an even integer. Also, a positive integer can be either even
or odd. Therefore, any positive odd integer is of the form 2q + 1.

2. Show that any positive odd integer is of the form 4q + 1 or 4q + 3, where q is some
integer. (2
M)
Solution :
Let us start with taking a, where a is a positive odd integer. We apply the division
algorithm with a and b = 4.
Since 0 ≤ r < 4, the possible remainders are 0, 1, 2 and 3.
That is, a can be 4q, or 4q + 1, or 4q + 2, or 4q + 3, where q is the quotient.
However, since a is odd, a cannot be 4q or 4q + 2 (since they are both divisible by 2).
Therefore, any odd integer is of the form 4q + 1 or 4q + 3.

3. A sweet seller has 420 kaju barfis and 130 badam barfis. She wants to stack them in
such a way that each stack has the same number, and they take up the least area of the tray.
What is the number of that can be placed in each stack for this purpose? (3 M)
Solution :
This can be done by trial and error. But to do it systematically, we find HCF (420, 130).
Then this number will give the maximum number of barfis in each stack and the number of
stacks will then be the least. The area of the tray that is used up will be the least.

1
CLASS: X (CBSE) Real Numbers

Now, let us use Euclid’s algorithm to find their HCF. We have :

420= 130×3+30
130= 30×4+10
30= 10×3+0
So, the HCF of 420 and 130 is 10.
Therefore, the sweet seller can make stacks of 10 for both kinds of barfi.
4. 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? (3 M)

SOLUTION:

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 × 19 + 8

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

We have, 32 = 8 × 4 + 0

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

Hence, maximum number of columns is 8

1. Find the HCF (865, 255) using Euclid’s division lemma. (3 M)

Solution:

2
CLASS: X (CBSE) Real Numbers

865 > 255

865 = 255 × 3 + 100
255 = 100 × 2 + 55
100 = 55 × 1 + 45
55 = 45 × 1 + 10
45 = 10 × 4 + 5
10 = 5 × 2 + 0
The remainder is 0
HCF = 5
6. Using Euclid’s division algorithm, find the HCF of 56, 96 and 404. (3 M0

SOLUTION:

Using Euclid’s division algorithm we have

HCF of 56 and 96 is 8

Now to find HCF of 56, 96 and 404 we apply Euclid’s division algorithm to 404 and 8
i.e.,

3
CLASS: X (CBSE) Real Numbers

4 is the required HCF

7. Using Euclid’s division algorithm, find the HCF of 56, 96 and 404. (3 M)

Solution:

Using Euclid’s division algorithm we have

HCF of 56 and 96 is 8

Now to find HCF of 56, 96 and 404 we apply Euclid’s division algorithm to 404 and 8
i.e.,

4 is the required HCF

8. Prove that is divisible by 2 for every positive integer n. (3 M)

Solution:

A positive integer is of the form 2q, 2q + 1, for some integer q.

When n = 2q
n2 – n = n × (n -1)= 2q (2q - 1)

= 2m, when m = q (2q - 1)

Which is divisible by 2.

When n = 2q + 1

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

= 2q (2q + 1)

4
CLASS: X (CBSE) Real Numbers

= 2m, when m = q (2q + 1)

Which is divisible by 2.

Hence, n2 – n is divisible by 2 for every positive integer n.

9. Find the greatest number which divides 2011 and 2623 leaving remainders 9 and 5
respectively. (3 M)

SOLUTION:

It is given that the required number when divides 2011 and 2623 leaves
remainder 9 and 5 respectively. This means that 2011 – 9 = 2002 and 2623 – 5 =
2618 are completely divisible by required number.

So, required number is H.C.F. (2002, 2618).

By Euclid’s division lemma, we have

H.C.F. (2002, 2618) = 154

10. Use Euclid’s algorithm to find the HCF of 4052 and 12576. (4 M)

Solution :

Step 1 : Since 12576 > 4052, we apply the division lemma to 12576 and 4052, to get

12576= 4052 × 3 + 420

Step 2 : Since the remainder 420 ≠ 0, we apply the division lemma to 4052 and 420, to get

4052= 420×9+272
Step 3 : We consider the new divisor 420 and the new remainder 272, and apply the

division lemma to get

5
CLASS: X (CBSE) Real Numbers

420= 272×1+148
We consider the new divisor 272 and the new remainder 148, and apply the division

lemma to get

272= 148×1+124
We consider the new divisor 148 and the new remainder 124, and apply the division

lemma to get

148= 124×1+24
We consider the new divisor 124 and the new remainder 24, and apply the division

lemma to get

124= 24×5+4
We consider the new divisor 24 and the new remainder 4, and apply the division

lemma to get

24= 4×6+0

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.

11. Find the HCF of 52 and 117 and express it in the form 52 x + 117y. (4 M)

SOLUTION:

Given the integers 52 and 117, where 117 > 52,

117 = 52 x 2 + 13 (By Euclid Division Lemma)

Since the remainder is 13 ≠ 0, so, we apply division lemma to the divisor 52 and the
remainder 13, we get.

52 = 13 x 4 (By EDL)

Since the remainder is zero. The last divisor is the HCF.

6
CLASS: X (CBSE) Real Numbers

Therefore 13 is the HCF of 52 and 117.

117 = 52 x 2 + 13

13 = 117 – 52 x 2.

We have to represent HCF in the form of 52x + 117y

∴ 52(-2) + 117 = 13

Therefore x = -2 and y = 1

12.For any positive integer n, prove that n3 – n is divisible by 6. (4 M)

SOLUTION:

n3 – n= n (n2 – 1) = n (n + 1) (n – 1)

Let n be any positive integer. It is of the form

6q, 6q + 1, 6q + 2, 6q + 3, 6q + 4, 6q + 5

as we have divisor 6. By Euclid division lemma

Case 1 :

n = 6q, then

n3 – n = n (n + 1)(n - 1) = 6q (6q + 1)(6q - 1) = 6m

Where, m = q (6q + 1)(6q - 1)

which is divisible by 6

Case 2 : n = 6q + 1

n3 – n = n (n + 1)(n - 1) = 6q (6q + 2)(6q + 1) = 6m

7
CLASS: X (CBSE) Real Numbers

which is divisible by 6

Case 3: n = 6q + 2

n3 – n = n (n + 1)(n - 1) = (6q + 2)(6q + 3)(6q + 1)

= 2(3q + 1) 3(2q + 1)(6q + 1)

= 6 (3q + 1)(2q + 1)(6q + 1) = 6 m

Which is divisible by 6

Case 4 : n = 6q + 3

n3 – n = n (n + 1)(n - 1) = (6q + 3)(6q + 4)(6q + 2)

= 3(2q + 1) 2(3q + 2) 2(3q + 1)

= 6 × 2 (2q + 1)(3q + 2)(3q + 1)

= 6m

which is divisible by 6

Similarly if n = 6q + 4

n = 6q + 5

n3 – n is divisible by 6.

Hence proved.

13.Use Euclid division lemma to show that the square of any positive integer cannot be of
the form 5m + 2 or 5m + 3 for some integer m. (4 M)

8
CLASS: X (CBSE) Real Numbers

SOLUTION:

Let n be any positive integer

By Euclid’s division lemma, n = 5q + r, 0 ≤ r < 5 n = 5q, 5q + 1, 5q + 2, 5q + 3 or

5q + 4, where

q ϵ ω (q is a whole number)

Now n2 = (5q)2 = 25q2 = 5(5q2) = 5m

n2 = (5q + 1)2 = 25q2 + 10q + 1 = 5m + 1

n2 = (5q + 2)2 = 25q2 + 20q + 4 = 5m + 4

Similarly,

n2 = (5q + 3)2 = 5m + 4 and n2 = (5q + 4) = 5m + 1

Thus square of any positive integer cannot be of the form 5m + 2 or 5m + 3.

14.Find the HCF, by Euclid’s division algorithm of the numbers 92690, 7378 and 7161.

SOLUTION:

By using Euclid’s Division Lemma, we have

92690 = 7378 x 12 + 4154

Again we apply Euclid’s Division Lemma of divisor 7, 378 and remainder 4154

7378 = 4154 x 1 + 3224

4154 = 3224 x 1 + 930

3224 = 930 x 3 + 434

930 = 434 x 2 + 62

434 = 62 x 7 + 0

9
CLASS: X (CBSE) Real Numbers

HCF (92690, 7378) = 62

Now, using Euclid’s Division Lemma on 7161 and 62, we have

7161 = 62 x 115 + 31

Again, applying Euclid’s Division Lemma on divisor 62 and reminder 31

62 = 31 x 2 + 0

Now, HCF (7161, 62) = HCF (62, 31) = 31

Hence, HCF of 92690, 7378 and 7161 is 31.

The Fundamental Theorem of Arithmetic

1. What is the HCF of the smallest composite number and the smallest prime number?
(1 M)

SOLUTION:

The smallest prime number is 2 and the smallest composite number is 22

Hence, required HCF (22, 2) = 2

2. Find HCF of the numbers given below: k, 2k, 3k, 4k and 5k, where k is any positive
integer. (1 M)

SOLUTION:

10
CLASS: X (CBSE) Real Numbers

HCF of

3. Determine prime factorisation of 20570.

(2 M)

SOLUTION:

(a)2 x 5 x 112 x 17

4. Explain why 3 × 5 × 7 + 7 is a composite number. (2 M)

SOLUTION:

3 × 5 × 7 + 7 = 7 (3 × 5 + 1) = 7 × 16,

Which has more than two factors

Hence it is a composite number (Every composite number can be expressed as product

of prime factors)

11
CLASS: X (CBSE) Real Numbers

5.Consider the numbers 4n, where n is a natural number. Check whether there is any value
of n for which 4n ends with the digit zero. (2 M)
Solution :
If the number 4n, for any n, were to end with the digit zero, then it would be divisible by 5.
That is, the prime factorisation of 4n would contain the prime 5. This is not possible
because 4n = (2)2n; so the only prime in the factorisation of 4n is 2. So, the uniqueness of
the Fundamental Theorem of Arithmetic guarantees that there are no other primes in the
factorisation of 4 .
So, there is no natural number n for which 4 ends with the digit zero.

6. Find the HCF of 96 and 404 by the prime factorisation method. Hence, find their LCM.
(2
M)
Solution : The prime factorisation of 96 and 404 gives :
96=25 ×3,
404=22 ×101
Therefore, the
HCF of these two integers
is 22 = 4.
Also,

7. Find the HCF and LCM of 6, 72 and 120, using the prime factorisation method. (2 M)
Solution :
We have :
6 = 2x3
72 = 23 x 32
120 = 23 x 3 x 5

12
CLASS: X (CBSE) Real Numbers

Here, 21 and 31 are the smallest powers of the common factors 2 and 3, respectively.
So, HCF(6,72,120)= 21 ×31 =2×3=6
23, 32 and 51 are the greatest powers of the prime factors 2, 3 and 5 respectively involved
in the three numbers.
So, LCM(6,72,120)= 23×32 ×51 =360

8. If HCF (6, a) = 2 and LCM (6, a) = 60, then find a. (2 M)

SOLUTION:

LCM x HCF = Product of 2 numbers

LCM (6, a) x HCF (6, a) = product of (6, 9)

2 x 60 = 6 x a

a = 20

∴ The value of a is 20.

9. Calculate the HCF of 33 × 5 and 32 × 52. (2 M)

SOLUTION:

HCF OF 33 X 5 and 32 X 52

= 32 x 5

=9x5

= 45.

13
CLASS: X (CBSE) Real Numbers

3. Find the HCF and LCM of 90 and 144 by the method of prime factorization. (2 M)
SOLUTION:

90 = 2 x 32 x 5 and 144 = 22 x 32

HCF = 2 x 32 = 18,

LCM = 24 x 32 x 5 = 720.

11.If HCF (a, b) = 12 and a × b = 1800, then find LCM (a, b) (2 M)

SOLUTION:
⇒ 1, 800 = 12 x LCM (a, b)

4. Show that numbers 8n can never end with digit 0 for any natural number n. (2 M)
SOLUTION:
If 8n ends with 0, then it must have 5 as a factor. But we know that only prime
factor of 8n is 2.
∴ 8n = (2 x 2 x 2)n = 2n x 2n x 2n
From the fundamental theorem of arithmetic, we know that the prime
factorisation of every composite number is unique.
∴ 8n can never ends with 0.
5. Three bells toll at intervals of 9, 12, 15 minutes respectively. If they start tolling
together, after what time will they next toll together? (2 M)
Solution:
We take LCM of 9, 12, 15
9 = 32 , 12 = 22 × 3, 15 = 3 × 5
LCM = 22 × 32 × 5 = 4 × 9 × 5
= 180 minutes or 3 hours
They will next toll together after 3 hours

14
CLASS: X (CBSE) Real Numbers

14.Find the greatest number of 5 digits exactly divisible by 12, 15 and 36. (3 M)
SOLUTION:

The greatest 5 digit number is 99999

The required number must be divisible by LCM of 12, 15, 36
LCM (12, 15, 36) = 180
Required number = 99999 – Remainder when 99999 is divided by 180
Remainder when 99999 is divided by 180 = 99
Required number = 99999 – 99
= 99900
∴ The required greatest number exactly divisible by 12, 15, 36 is 99900

15.A, B, C start cycling around a circular path in the same direction at the same time.
Circumference of the path is 1980m. If the speed of A is 330m / min, speed of B is
198m/min and C is 220m/min and they start from the same points, after how many
minutes they meet?
(4 M)

SOLUTION:

Time taken by A to cycle one round =

Time taken by B =

Time taken by C =

Then, the three cyclists will meet at the starting point again after

[L.C.M. (6, 10, 9) min.]

15
CLASS: X (CBSE) Real Numbers

Prime factors of 6 = 2 × 3

Prime factors of 10 = 2 × 5

Prime factors of 9 = 3 × 3

L.C.M (6, 10, 9) = 2 × 5 × 32 = 90 min

So, they will meet after 90 min

16. If two positive integers p and q are written as p = a2b3 and

q = a3b ; a , b are prime numbers then verify : LCM (p , q) x HCF (p , q) = pq
(3 M)

SOLUTION:

Given , p = a2b3 and q = a3b

Finding HCF :

p = a2b3

=axaxbxbxb

q = a3b

=axaxaxb

HCF (p , q) = a2b

Finding LCM :

16
CLASS: X (CBSE) Real Numbers

LCM = a x a x a x b x b x b

= a3b3

We need to prove that

LCM (p , q) x HCF (p , q) =
pq

Since , LHS = RHS

Hence Proved.

17.There are 104 students in class X and 96 students in class IX in a school. In a house
examination the students are to be evenly seated in parallel rows such that no two
adjacent rows are of the same class.
(a) Find the maximum number of parallel rows of each class for the seating
arrangement.
(b) Also find the number of students of class IX and also of class X in a row.
(c) What is the objective of the school administration behind such an arrangement?
Solution:
17
CLASS: X (CBSE) Real Numbers

We find HCF of 104 and 96

104 = 23 × 13
96 = 25 × 3
HCF = 23 = 8
There are 8 students in a row.

(a) Number of rows of students of class X =

Number of rows of students of class IX = Total number of rows = 13 + 12 =

25
(b) Number of students of class IX in a row = 8
Number of students of class X in a row = 8
(c) The objective of school administration behind such an arrangement is fair and clean
examination, so that no student can take help from any other student of his/her class.

Irrational Numbers

1. Prove that is an irrational number. (4 M)

SOLUTION:

Let us assume is a rational number. Then it can be represented, as

18
CLASS: X (CBSE) Real Numbers

7b2 = a2 …… (i)

∴ a2 is divisible by 7.

∴ a is also divisible by 7 [by fundamental theorem of arithmetic]

Let a = 7r for some positive integer r

Then a2 = 49r2

7b2 = 49r2

b2 = 7r2 ……… (ii)

∴ b2 is divisible by 7, b is also divisible by 7.

From (i) and (ii) it is clear that a and b are divisible by 7 which contradicts the fact that
a and b are co-primes

Hence our assumption is false

∴ is irrational.

2. Prove that is an irrational number. (4 M)

SOLUTION:

Let us assume be a rational number

19
CLASS: X (CBSE) Real Numbers

= a, b ϵ z, b ≠ 0, a and b are co primes

a, b ϵ z so 5b – a is an integer. So is rational.

∴ is rational.

This contradicts the fact that is irrational. So, our assumption is wrong and

is an irrational number.

3. Prove that: 1 + is a irrational number. (4 M)

SOLUTION:

Let’s assume is rational

a, b ϵ z, b ≠ 0 ‘a’ and ‘b’ are co primes

(or)

‘a’ and ‘b’ are integers

[Subtraction of integer is also an integer]

[ Division of 2 integers is a rational number]

20
CLASS: X (CBSE) Real Numbers

= Rational

is rational

From (1), is a rational number, which contradicts the fact that is an irrational
number.

Our assumption is wrong.

1+ is an irrational number

1. Prove that is irrational. (4 M)

SOLUTION:

Let us assume on the contrary that is a rational number. Then, there exist
co-prime positive integers a and b such that

[Squaring both sides]

21
CLASS: X (CBSE) Real Numbers

is a rational number

This contradicts the fact that is irrational. So, our assumption is wrong.

Hence, is irrational.

5. Prove that is an irrational number. (4 M)

SOLUTION:

Let be a rational number, say x

Here RHS is a rational number, as both 3 and x are so

is a rational number

Proving that is not rational

Our supposition is wrong

is an irrational number

6. Prove that is irrational. (4 M)

Solution:

PT. is irrational

Assume is rational
22
CLASS: X (CBSE) Real Numbers

= , where p and q are co-prime integers and q

2=
P2 = 2q2
p2 is divisible by 2
p is divisible by 2 …………. (i)
Let p = 2r for some positive integer r
P2 = 4r2
2q2 = 4r2
q2 = 2r2
q2 is divisible by 2
q is divisible by 2 …………… (ii)
From (i) and (2), p and q are divisible by 2.
Which contradicts the fact that p and q are co-primes.
Hence, our assumption is false.

is irrational.

Rational Numbers and their Decimal Expansions

1. Write the condition to be satisfied by q so that a rational number has a terminating

decimal expansion. (1 M)

SOLUTION:

23
CLASS: X (CBSE) Real Numbers

q should be expressible as 2x . 5y where x, y are whole numbers

2. Without actually performing the long division, state whether

the following rational numbers will have a terminating decimal
expansion or a non- terminating repeating decimal expansion:

(2 M)

(a) (b)

SOLUTION:

(a) 1600 = 2 6 ×52

The denominator is of the form 2

m x 5n

Hence, the decimal expansion of is terminating

(b)

Since the denominator is not of the form 2m × 5n, and it also has 7 as
its factor, the

decimal expansion of is non-terminating repeating.

3. If find the values of m and n where m and n are non-negative integers.

Hence, write its decimal expansion without actual division. (2 M)

SOLUTION:
24
CLASS: X (CBSE) Real Numbers

= 0.06025

25
CLASS: X (CBSE) Real Numbers

4.

Therefore the decimal expansion terminates after 4 decimal places.

5. The decimal expansion of the rational number will terminate after how many
places of decimals. (2 M)
Solution:

After 4 decimal places

6. The decimal expansion of will terminate after how many places of decimals. (2 M)

26
CLASS: X (CBSE) Real Numbers

Solution:

The decimal expansion of will terminate after 3 places of decimal.

27