RD

Sharma Solutions
Class 10 Mathematics (Real Numbers)
Exercise : 1.1

Level - 1

Q.1 : If a and b … other is even.

Sol : Given: If a and b are two odd positive integers such that a > b.
To Prove: That one of the two numbers and is odd and the other is even.
Proof: Let a and b be any odd positive integer such that a > b. Since any positive integer is of
the form q, 2q + 1
Let, a = 2q + 1 and b = 2m + 1, where, q and in are some whole numbers

= (q + m + 1) which is a positive integer.

Also,

Given, a > b
2q + 1 > 2m + 1
2q > 2m
q > m
Therefore, = (q - m) > 0

Thus, is a positive integer.

Now we need to prove that one of the two numbers and is odd and other is even.

Consider , = b
Also, we know that from the proof above that and are positive integers.
We know that the difference of two integers is an odd number if one of them is odd and
another is even. (Also, difference between two odd and two even integers is even)
Hence it is proved that if a and b are two odd positive integers is even.

Material downloaded from myCBSEguide.com. 1 / 12

Hence, it is proved that if a and b are two odd positive integers such that a > b then one of the
two number and is odd and the other is even.

Q.2 : Prove that the ... divisible by 2.

Sol : To Prove: that the product of two consecutive integers is divisible by 2.
Proof: Let n - 1 and n be two consecutive positive integers.

Then their product is n (n - 1) = n2 - n

We know that every positive integer is of the form 2q or 2q + 1 for some integer q.
So let n = 2q

So, n2 - n = (2q)2 - (2q)

n2 - n = (2q)2 - (2q)

n2 - n = 4q2 - 2q

n2 - n = 2q (2q - 1)

n2 - n = 2r [where r = q (2q - 1)]

n2 - n is even and divisible by 2

Let n = 2q + 1

So, n2 - n = (2q + 1)2 - (2q + 1)

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

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

n2 - n = 2r [r = q (2q + 1)]

n2 - n is even and divisible by 2

Hence it is proved that that the product of two consecutive integers is divisible by 2.

Q.3 : Prove that the .... is divisible by 6.

Sol : To Prove: the product of three consecutive positive integers is divisible by 6.
Proof: Let n be any positive integer.
Since any positive integer is of the form 6q or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4, 6q + 5.
If n = 6q,
n (n + 1) (n + 2) = 6q (6q + 1) (6q + 2), which is divisible by 6
If n = 6q + 1
n (n + 1) (n + 2) = (6q + 1) (6q + 2) (6q + 3)
n (n + 1) (n + 2) = 6 (6q + 1) (3q + 1) (2q + 1) Which is divisible by 6

Material downloaded from myCBSEguide.com. 2 / 12

If n = 6q + 2
n (n + 1) (n + 2) = (6q + 2) (6q + 3) (6q + 4)
n (n + 1) (n + 2) = 12 (3q + 1) (2q + 1) (2q + 3),
Which is divisible by 6.
Similarly we can prove others.
Hence it is proved that the product of three consecutive positive integers is divisible by 6.

Q.4 : For any positive integer n, prove that n3 - n divisible by 6. [NCERT Exemplar]

Sol : To Prove: For any positive integer n, n3 - n is divisible by 6.

Proof: Let n be any positive integer. n3 - n = (n - 1) (n) (n + 1)

Since any positive integer is of the form 6q or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4, 6q + 5
If n = 6q,
Then, (n -1) n (n + 1) = (6q -1) 6q (6q + 1)
Which is divisible by 6
If n = 6q + 1,
Then, (n -1) n (n + 1) = (6q) (6q + 1) (6q + 2)
Which is divisible by 6.
If n = 6q + 2,
Then, (n - 1) n (n + 1) = (6q + 1) (6q + 2) (6q + 3)
(n - 1) n (n + 1) = 6 (6q + 1) (3q + 1) (2q + 1)
Which is divisible by 6.
Similarly we can prove others.

Hence it is proved that for any positive integer n, n3- n is divisible by 6.

Q.5 : Prove that if .... q, but not conversely.

Sol : To Prove: That if a positive integer is of the form 6q + 5 then it is of the form 3q + 2 for
some integer q, but not conversely.
Proof : Let n = 6q + 5
Since any positive integer n is of the form of 3k or 3k + 1, 3k + 2
If q = 3k,
Then, n = 6q + 5
n = 18k + 5 (q = 3k)
n = 3 (6k + 1) + 2

Material downloaded from myCBSEguide.com. 3 / 12

n = 3m + 2 (where m = (6k + 1))
If q = 3k+ 1,
Then, n = (6q + 5)
n = (6 (3k + 1) + 5) (q = 3k + 1)
n = 18k + 6 + 5
n = 18k + 11
n = 3 (6k + 3) + 2
n = 3m + 2 (where m = (6k + 3))
If q = 3k + 2,
Then, n = (6q + 5)
n = (6 (3k + 2) + 5) (q = 3k + 2)
n = 18k + 12 + 5
n = 18k + 17
n = 3 (6k + 5) + 2
n = 3m + 2 (where m = (6k + 5))
Consider here 8 which is the form 3q + 2 i.e. 3 x 2 + 2 but it can’t be written in the form 6q +
5. Hence the converse is not true.

Q.6 : Prove that square .... is of same form.

Sol : To Prove: That the square of a positive integer of the form 5q + 1 is of the same form
Proof: Since positive integer n is of the form 5q + 1
If n = 5q + 1

Then n2 = (5q + 1)2

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

n2 = 5m + 1 (where m = (5q2 + 2q))

Hence n2 integer is of the form 5m + 1.

Q.7 : Prove that the ... of the form 3m + 2.

Sol : To Prove: that the square of an positive integer is of the form 3m or 3m + 1 but not of
the form 3m + 2.
Proof: Since positive integer n is of the form of 3q , 3q + 1 and 3q + 2
If n = 3q

n2 = (3q)2

Material downloaded from myCBSEguide.com. 4 / 12

n2 = 9q2

n2 = 3 (3q)2

n2 = 3m (m = 3q)2
If n = 3q + 1

Then, n2 = (3q + 1) 2

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

n2 = 9q2 + 6q + 1

n2 = 3q (3q + 1) + 1

n2 = 3m +1 (where m = (3q + 2))

If n = 3q + 2

Then, n2 = (3q + 2)2 = (3q)2 + 12q + 4

n2 = 9q2 + 12q + 4

n2 = 3 (3q + 4q + 1) + 1

n2 = 3m + 1 (where q = (3q + 4q + 1))

Hence, n2 integer is of the form 3m, 3m + 1 but not of the form 3m + 2.

Q.8 : Prove that the Square of any positive integer is of the form 4q or 4q + 1 for some
integer q. [NCERT Exemplar]
Sol : To Prove: that the square of any positive integer is of the form 4q or 4q + 1 for some
integer q.
Proof: Since positive integer n is of the form of 2q or 2q + 1
If n = 2q

Then, n2 = (2q)2

n2 = 4q2

n2 = 4m (where m = q2)
If n = 2q + 1

Then, n2 = (2q + 1)2

n2 = (2q)2 + 4q + 1

n2 = 4q2 + 4q + 1

n2 = 4q (q + 1) + 1

Material downloaded from myCBSEguide.com. 5 / 12

n2 = 4q + 1 (where m = q (q + 1))
Hence it is proved that the square of any positive integer is of the form 4q or 4q + 1, for some
integer q.

Q.9 : Prove that the ... for some integer q.

Sol : To Prove: that the square of any positive integer is of the form 5q or 5q + 1, 5q + 4 for
some integer q.
Proof: Since positive integer n is of the form of 5q or 5q + 1, 5q + 4.
If n = 5q

Then. n2 = (5q)2

n2 = 25q2

n2 = 5 (5q)

n2 = 5m (Where m = 5q)
If n = 5q + 1

Then, n2 = (5q +1)2

n2 = (5q)2 + 10q + 1

n2 = 25q2 + 10q + 1

n2 = 5q (5q + 2) + 1

It n2 = 5q (5q + 2) + 1

n2 = 5m +1 (where m = q (5q + 2))

If n = 5q + 2

Then, n2 = (5q + 2)2

n2 = (5q)2 + 20q + 4

n2 = 25q2 + 20q + 4

n2 = 5q (5q + 4) + 4

n2 = 5m + 4 (where m = q (5q + 4))

If n = 5q + 4

Then, n2 = (5q + 4)2

n2 = (5q)2 + 40q + 16

n2 = 25q2 + 40q + 16

Material downloaded from myCBSEguide.com. 6 / 12

n2 = 5 (5q2 + 8q + 3) + 1

n2 = 5m + 1 (where m = 5q2 + 8q + 3)
Hence it is proved that the square of any positive integer is of the form 5q or 5q + 1, 5q + 4 for
some integer q.

Q.10 : Show that the ... for some integer q.

Sol : To Prove: the square of any positive integer is of the form 8q + 1 for some integer q.
Proof: Since any positive integer n is of the form 4m + 1 and 4m + 3
If n = m + 1
Then,

n2 = (4m + 1)2

n2 = (4m)2 + 8m + 1

n2 = 16m2 + 8m + 1

n2 = 8m (2m + 1) + 1

n2 + 8q +1 (where q = m (2m + 1))

If n = 4m + 3

Then, n2 = (4m + 3)2

n2 = (4m)2 + 24m + 9

n2 = 16m2 + 24m + 9

n2 = 8 (2m2 + 3m + 1) + 1

n2 = 8q + 1 (where q = (2m2 + 3m + 1))

Hence, n2 integer is of the form 8q + 1, for some integer q.

Q.11 : Show that any positive odd integer is of the form 6q + 1 or 6q + 3 or 6q + 5, where q
is some integer. [NCERT Exemplar]
Sol : To Show: That any positive odd integer is of the form 6q + 1 or 6q + 3 or 6q + 5 where q
is any some integer.
Proof: Let ‘a’ be any odd positive integer and b = 6.
Then, there exists integers q and r such that a = 6q + r, 0 ≤ r < 6 (by division algorithm)
a = 6q or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4
But 6q or 6q + 2 or 6q + 4 are even positive integers.
So, a = 6q + 1 or 6q + 3 or 6q + 5

Material downloaded from myCBSEguide.com. 7 / 12

Hence it is proved that any positive odd integer is of the form 6q + 1 or 6q + 3 or 6q + 5,
where q is any some integer.

Level - 2

Q.12 : Show that the square of any positive integer cannot be of the form 6m + 2 or 6m +
5 for any integer m. [NCERT Exemplar]
Sol : Let a be the positive integer and b = 6.
Then, by Euclid’s algorithm, a = 6q + r for some integer q ≥ 0 and r = 0, 1, 2, 3, 4, 5 because 0 ≤
r < 5.
So, a = 6q or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4 or 6q + 5.

(6q)2 = 36q2 = 6(6q2)

= 6m, where m is any integer.

(6q + 1)2 = 36q2 + 12q + 1

= 6(6q2 + 2q) + 1
= 6m + 1, where m is any integer.

(6q + 2)2 = 36q2 + 24q + 4

= 6(6q2 + 4q) + 4
= 6m + 4, where m is any integer.

(6q + 3)2 = 36q2 + 36q + 9

= 6(6q2 + 6q + 1) + 3
= 6m + 3, where m is any integer.

(6q + 4)2 = 36q2 + 48q + 16

= 6(6q2 + 7q + 2) + 4
= 6m + 4, where m is any integer.

(6q + 5)2 = 36q2 + 60q + 25

= 6(6q2 + 10q + 4) + 1
= 6m + 1, where m is any integer.
Hence, The square of any positive integer is of the form 6m, 6m + 1, 6m + 3, 6m + 4 and
cannot be of the form 6m + 2 or 6m + 5 for any integer m.

Q.13 : Show that the cube of a positive integer of the form (6q + r) where q is an integer

Material downloaded from myCBSEguide.com. 8 / 12

and r = 0, 1, 2, 3, 4 and 5 which is also of the form (6m + r). [NCERT Exemplar]
Sol : By Euclid’s division algorithm,
a = 6q + r …(i)
where a, q and r are non-negative integers 0 ≤ r < 6 i.e., r = 0, 1, 2, 3, 4, 5.
Cubing (i) both sides, we get

(a)3 = (6q + r)3

⇒ a3 = (6q)3 + (r)3 +3(6q)2 (r)+ 3(6q) (r)2

= 63q3 + r3 + 3 × 62q2r + 6 × 3qr2

⇒ a3 = 6[36q3 + 18q2r + 3qr2] + r3 …(ii)

When r = 0, then a3 = 6[36q3 + 18q2 × 0 + 3q02] + 03 [From (ii)]

⇒ a3 6[36q3]

⇒ a3 = 6m is perfect cube for some value of m such that m = 36q2

When r = 1, a3 = 6[36q3 + 18q2 × 1 + 3q12] + 13

=6[36q3 + 18q2 × 1 + 3q] + 1

⇒ a3 = 6m + 1 is perfect cube for some value of m such that

m = (36q3 + 18q2 + 3q)

When r = 2, a3 = 6[36q3 + 18q2 × 2 + 3q × 22] + 23 [From (ii)]

= 6[36q3 + 36q2 + 12q] + 6 + 2

= 6[36q3 + 36q2 + 12q + 1] + 2

⇒ a3 = 6m + 2 is perfect cube for some values of m such that

m = 36q3 + 36q2 + 12q + 1

When r = 3, a3 = 6[36q3 + 18q2 × 3 + 3q × 32] + 33 [From (ii)]

⇒ a3 = 6[36q3 + 54q2 + 27q] + 24 + 3

⇒ a3 = 6[36q3 + 54q2 + 27q + 4] + 3

⇒ a3 = 6m + 3
So, (6m + 3) is perfect cube for specified value of m such that

m = 36q2 + 54q2 + 27q + 4

When r = 4, then eq. (ii) becomes

a3 = 6[36q3 + 18q2(4) + 3q42] + 43

Material downloaded from myCBSEguide.com. 9 / 12

= 6[36q3 + 72q2 + 48q] + 60 + 4

= 6[36q3 + 72q2 + 48q + 10] + 4

⇒ a3 = 6m + 4
So, (6m + 4) is perfect cube for specified value of m such that

m = 36q3 + 72q2 + 48q + 10

When r = 5, eq. (ii) becomes as

a3 = 6[36q3 + 18q2(5) + 3q(5)2] + (5)3

= 6[36q3 + 90q2 + 75q] + 120 + 5

= 6[36q3 + 90q2 + 75q + 20] + 5

⇒ a3 = 6m + 5
⇒ (6m + 5) is perfect cube for specified value of

m = 36q3 + 90q2 + 75q + 20

Hence, cubes of positive integers is of the form (6m + r), where m is a specified integer and r
= 0, 1, 2, 3, 4, 5.

Q.14 : Show that one and only one out of n, n + 4, n + 8, n + 12, n + 16 is divisible by 5,
where n is any positive integer. [NCERT Exemplar]
Sol : Let a number n is divided by then quotient is q and remainder is r. Then by Euclid’s
division algorithm,
n = 5q + r, where n, q, r are non-negative integers and 0 ≤ r < 5
When r = 0, n = 5q + 0 = 5q
So, n is divisible by 5.
When r = 1, n = 5q + 1
n + 2 = 5q + 1 + 2 = 5q + 3 is not divisible by 5.
n + 4 = (5q + 1) + 4 = 5q + 5 = 5(q + 1) divisible by 5.
So, (n + 4) is divisible by 5.
When r = 2, n = 5q + 2
(n + 8) = (5q + 2) + 8 = 5q + 10 = 5(q + 2) = 5m is divisible by 5.
So, (n + 8) is divisible by 5.
When r = 3, n = 5q + 3
n + 12 = (5q + 3) + 12 = 5q + 15 = 5(q + 3) = 5m is divisible by 5.
So, (n + 12) is divisible by 5.

Material downloaded from myCBSEguide.com. 10 / 12

When r = 4, n = 5q + 4
n + 16 = (5q + 4) + 16 = 5q + 20 = 5(q + 4)
(n + 16) = 5m is divisible by 5.
Hence, n, (n + 4), (n + 8), (n + 12) and (n + 16) are divisible by 5.

Q.15 : Show that the square of an odd positive integer can be of the form 6q + 1 or 6q + 3
for some integer q. [NCERT Exemplar]
Sol : Let a is positive integer and 6 = 6. Then by Euclid's division algorithm
a = 6q + r for some integer q ≥ 0
r = 0, 1, 2, 3, 4, 5
a = 6q or 6q + 1, 6q + 2, 6q + 3, 6q + 4 and 6q + 5
Also 6q + 1 = 2 × 3q + 1 = 2k1 + 1

where k1 is +ve integer

gq + 3 = (6q + 2) + 1 = 2(3q + 1) + 1 = 2k2 + 1,

whose k2 is integer

6q + 5 = (6q + 4) + 1 = 2(3q + 2) + 1 = 2k3 + 1

whose k3 is an integer

clearly 6q + 1, 6q + 3, 6q + 5 are of form 2k + 1

Therefore 6q + 1, 6q + 3, 6q + 5 are not exactly divisible by 2.
It is of odd number.
Any odd integer can be expressed in form 6q + 1, 6q + 3 or 6q + 5.

Q.16 : A positive integer is of the form 3q+1, q being a natural number. Can you write its
square in any form other than 3m + 1, 3m or 3m + 2 for some integer m? Justify your
answer.
Sol : No , square of any positive integer of the form 3m + 1 is always in the form in the 3m +
1, but it'snot in the form of - Either 3m or 3m + 2 because of the following solution :
⇒ a = bq + r
Let "a" be any positive integer and 'q be the quotient and let "r" be the remainder.
Therefore we get,

a = (3q + 1)2 {We square it, as according to the question}

a = 9q2 + 6q2 + 12 {(a + b)2 = a2 + b2 + 2ab}

Material downloaded from myCBSEguide.com. 11 / 12

a = 3(3q2 + 2q2) + 1
a = 3q + 1 (Where, q is 3q + 1)
So, we got that it is always in the form of 3q + 1.

Q.17 : Show that the ... is a natural number.

Sol : No, by Euclid's lemma, b = aq + r, 0 ≤ r ≤ a Here, b is any positive integer, a = 3b = 3q + r
for 0 ≤ r ≤ 2
So, any positive integer is of the form 3k, 3k + 1 or 3k + 2.

Now, (3k)2 = 9k2 = 3m [where, m = 3k2]

and (3k + 1)2 = 9k2 + 6k + 1

= 3(3k2 + 2k) + 1 = 3m + 1[where, m = 3k2 + 2k]

Also, (3k+2)2 = 9k2 + 12k + 4[∵(a+b)2 = a2 + 2ab + b2]

= 9k2 + 12k + 3 + 1

= 3(3k2 + 4k + 1) + 1

= 3m + 1 [where, m = 3k2 + 2k]

which is in the form of 3m and 3m + 1. Hence, square of any positive number cannot be of
the form 3m + 2.

Material downloaded from myCBSEguide.com. 12 / 12