CHAPTER – 1

REAL NUMBERS

Exercise 1.1
Page No 1.10:
Question 1: If a and b are two odd positive integers such that a > b, then
𝑎+𝑏 𝑎−𝑏
prove that one of the two numbers and is odd and the other is

T IO S
2 2
even.

I
ANSWER:NO A D
CO N
A
Given: If a and b are two odd positive integers such that a > b.

PY
DO U A
𝑎+𝑏 𝑎−𝑏
To Prove: That one of the two numbers and is odd and the other
T 2 2
ED PR

is even.
Proof: Let a and b be any odd odd positive integer such that a > b.
C

Since any positive integer is of the form q, 2q + 1

©

Let a = 2q + 1 and b = 2m + 1, where, q and m are some whole numbers

𝑎+𝑏 (2𝑞+1)+(2𝑚+1)
⇒ =
2 2
𝑎+𝑏 2(𝑞+𝑚+1)
⇒ =
2 2
𝑎+𝑏
⇒ = (𝑞 + 𝑚 + 1)
2

which is a positive integer.

Also,
𝑎−𝑏 (2𝑞+1)−(2𝑚+1)
⇒ =
2 2
𝑎−𝑏 2(𝑞−𝑚)
⇒ =
2 2
 𝑎−𝑏
⇒ = (𝑞 − 𝑚)
2

Given, a > b
∴ 2q + 1 > 2m + 1
⇒ 2q > 2m
⇒q>m
𝑎−𝑏
∴ = (𝑞 − 𝑚) > 0
2

T IO S
(𝑎−𝑏)

I
Thus, is a positive integer.
2
NO A D
CO N
(𝑎+𝑏) (𝑎−𝑏)
Now, we need to prove that one of the two numbers and is odd
A
2 2
and other is even.

PY
DO U A
(𝑎+𝑏) (𝑎−𝑏) (𝑎+𝑏)(𝑎−𝑏) 2𝑏
− = 𝑏 , which is odd positive
Consider,
T = =
2 2 2 2
ED PR

integer.
(𝑎+𝑏) (𝑎−𝑏)
C

Also, we know from the proof above that and are positive
2 2
©

integers.
We know that the difference of two positive 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 such that a
𝑎+𝑏 𝑎−𝑏
> b then one of the two numbers and is odd and the other is even.
2 2

Page No 1.10:
Question 2: Prove that the product of two consecutive positive integers
is divisible by 2.
ANSWER:
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)

T IO S
⇒= (2𝑞 )2 − (2𝑞 )

I
NO A D
⇒ 𝑛2 − 𝑛 = 4𝑞 2 − 2𝑞

CO N
A
⇒ 𝑛2 − 𝑛 = 2𝑞(2𝑞 − 1)

PY
DO U A
⇒ 𝑛2 − 𝑛 = 2𝑟 (where r = q (2q – 1)
T
ED PR

⇒ 𝑛2 − 𝑛 is even and divisible by 2

C

Let n = 2q + 1
©

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

⇒ 𝑛2 − 𝑛 = (2𝑞 + 1)((2𝑞 + 1) − 1)
⇒ 𝑛2 − 𝑛 = (2𝑞 + 1)(2𝑞 )
⇒ 𝑛2 − 𝑛 = 2𝑟(𝑟 = 𝑞(2𝑞 + 1))
⇒ 𝑛2 − 𝑛 is even and divisible by 2

Hence it is proved that that the product of two consecutive integers is

divisible by 2
 Page No 1.10:
Question 3: Prove that the product of three consecutive positive integers
is divisible by 6.
ANSWER:
To Prove: the product of three consecutive positive integers is divisible
by 6.
Proof: Let n be any positive integer.

T IO S
Since any positive integer is of the form 6q or 6q + 1 or 6q + 2 or 6q + 3

I
or 6q + 4, 6q + 5
NO A D
CO N
If n = 6q
A
⇒ 𝑛(𝑛 + 1)(𝑛 + 2) = 6𝑞 (6𝑞 + 1)(6𝑞 + 2), which is divisible by 6

PY
DO U A

If n = 6q + 1
T
ED PR

⇒ 𝑛(𝑛 + 1)(𝑛 + 2) = (6𝑞 + 1)(6𝑞 + 2)(6𝑞 + 3)

⇒ 𝑛(𝑛 + 1)(𝑛 + 2) = 6(6𝑞 + 1)(3𝑞 + 1)(2𝑞 + 1)
C
©

Which is divisible by 6
If n = 6q + 2
⇒ 𝑛(𝑛 + 1)(𝑛 + 2) = (6𝑞 + 2)(6𝑞 + 3)(6𝑞 + 4)
⇒ 𝑛(𝑛 + 1)(𝑛 + 2) = 12(3𝑞 + 1)(2𝑞 + 1)(2𝑞 + 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.
 Page No 1.10:
Question 4: For any positive integer n, prove that n3 – n divisible by 6.
ANSWER:
To Prove: For any positive integer n, n3 − n is divisible by 6.
Proof: Let n be any positive integer.
⇒ 𝑛3 − 𝑛 = (𝑛 − 1)(𝑛)(𝑛 + 1)

T IO S
Since any positive integer is of the form 6q or 6q + 1 or 6q + 2 or 6q + 3
or 6q + 4, 6q + 5

I
NO A D
If n = 6q

CO N
A
Then, (𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 − 1)6𝑞 (6𝑞 + 1)

PY
DO U A
Which is divisible by 6
T
ED PR

If 𝑛 = 6𝑞 + 1
Then, (𝑛 − 1)(𝑛)(𝑛 + 1) = (6𝑞 + 1)(6𝑞 + 2)(6𝑞 + 3)
C

⇒ (𝑛 − 1)𝑛 (𝑛 + 1) = 6(6𝑞 + 1)(3𝑞 + 1)(2𝑞 + 1)

©

Which is divisible by 6
If 𝑛 = 6𝑞 + 2
Then (𝑛 − 1)𝑛(𝑛 + 1) = (6𝑞 + 1)(6𝑞 + 2)(6𝑞 + 3)
⇒ (𝑛 − 1)𝑛 (𝑛 + 1) = 6(6𝑞 + 1)(3𝑞 + 1)(2𝑞 + 1)
Which is divisible by 6
Similarly, we can prove others.
Hence it is proved that for any positive integer 𝑛, 𝑛3 − 𝑛 is divisible by 6.
 Page No 1.10:
Question 5: 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.
ANSWER:
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

T IO S
Since any positive integer n is of the form of 3k or 3k + 1, 3k + 2

I
NO A D
If q = 3k

CO N
A
Then 𝑛 = 6𝑞 + 5

PY
⇒ 𝑛 = 18𝑘 + 5(𝑞 = 3𝑘)
DO U A
T
⇒ 𝑛 = 3(6𝑘 + 1) + 2
ED PR

⇒ 𝑛 = 3𝑚 + 2 (where 𝑚 = (6𝑘 + 1))

C

If q = 3k + 1
©

Then 𝑛 = (6𝑞 + 5)
⇒ 𝑛 = (6(3𝑘 + 1) + 5) (𝑞 = 3𝑘 + 1)
⇒ 𝑛 = 18𝑘 + 6 + 5
⇒ 𝑛 = 18𝑘 + 11
⇒ 𝑛 = 3(6𝑘 + 3) + 2
⇒ 𝑛 = 3𝑚 + 2 (where 𝑚 = (6𝑘 + 3))
If q = 3k + 2
Then 𝑛 = (6𝑞 + 5)
⇒ 𝑛 = (6(3𝑘 + 2) + 5) (𝑞 = 3𝑘 + 2)
⇒ 𝑛 = 18𝑘 + 12 + 5
⇒ 𝑛 = 18𝑘 + 17
⇒ 𝑛 = 3(6𝑘 + 5) + 2
⇒ 𝑛 = 3𝑚 + 2 (where 𝑚 = (6𝑘 + 5))

Consider here 8 which is the form 3q + 2 i.e. 3 × 2 + 2 but it can’t be

written in the form 6q + 5. Hence the converse is not true

T IO S I
NO A D
CO N
Page No 1.10:
A
Question 6: Prove that the square of any positive integer of the form 5q

PY
DO U A
+ 1 is of the same form.
T
ANSWER:
ED PR

To Prove: that the square of a positive integer of the form 5q + 1 is of the

same form
C
©

Proof: Since positive integer n is of the form 5q + 1

If 𝑛 = 5𝑞 + 1
Then 𝑛2 = (5𝑞 + 1)2
⇒ 𝑛2 = (5𝑞 )2 + (1)2 + 2(5𝑞 )(1)
⇒ 𝑛2 = 25𝑞 2 + 1 + 10𝑞
⇒ 𝑛2 = 25𝑞 2 + 10𝑞 + 1
⇒ 𝑛2 = 5(5𝑞 2 + 2𝑞 ) + 1
⇒ 𝑛2 = 5𝑚 + 1 (where 𝑚 = (5𝑞 2 + 2𝑞 ))
Hence 𝑛2 integer is of the form 5m + 1.
 Page No 1.10:
Question 7: Prove that the square of any positive integer is of the form
3m or, 3m + 1 but not of the form 3m + 2.
ANSWER:
To Prove: that the square of a 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

T IO S
If n = 3q

I
⇒ 𝑛2 = (3𝑞 )2
NO A D
CO N
A
⇒ 𝑛2 = 9𝑞 2

PY
⇒ 𝑛2 = 3(3𝑞 2 )
DO U A
T
⇒ 𝑛2 = 3𝑚(𝑚 = 3𝑞 2 )
ED PR
C

If n = 3q + 1
©

Then, n2 = (3q + 1)2

⇒ 𝑛2 = (3𝑞 2 ) + 6𝑞 + 1
⇒ 𝑛2 = 9𝑞 2 + 6𝑞 + 1
⇒ 𝑛2 = 3𝑞 (3𝑞 + 1) + 1

⇒ 𝑛2 = 3𝑚 + 1 (where 𝑚 = (3𝑞 + 2))

If n = 3q + 2
Then, n2 = (3q + 2)2
⇒ 𝑛2 = (3𝑞 2 ) + 12𝑞 + 4
⇒ 𝑛2 = 9𝑞 2 + 12𝑞 + 4
⇒ 𝑛2 = 3(3𝑞 + 4𝑞 + 1) + 1

⇒ 𝑛2 = 3𝑚 + 1 (where 𝑚 = (3𝑞 + 4𝑞 + 1))

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

T IO S
Page No 1.10:

I
Question 8: Prove that the square of any positive integer is of the form
NO A D
4q or 4q + 1 for some integer q.

CO N
A
ANSWER:

PY
DO U A
To Prove: that the square of any positive integer is of the form 4q or 4q +
T
1 for some integer q.
ED PR

Proof: Since positive integer n is of the form of 2q or 2q + 1

C

If n = 2q
©

Then 𝑛2 = (2𝑞 )2
⇒ 𝑛2 = 4𝑞 2
⇒ 𝑛2 = 4𝑚 (where 𝑚 = 𝑞 2 )
If n = 2q + 1
Then, 𝑛2 = (2𝑞 + 1)2
⇒ 𝑛2 = (2𝑞 )2 + 4𝑞 + 1
⇒ 𝑛2 = 4𝑞 2 + 4𝑞 + 1
⇒ 𝑛2 = 4𝑞 (𝑞 + 1) + 1
⇒ 𝑛2 = 4𝑞 + 1 (where 𝑚 = 𝑞 (𝑞 + 1))
Hence it is proved that the square of any positive integer is of the form 4q
or 4q + 1, for some integer q.

Page No 1.10:
Question 9: Prove that the square of any positive integer is of the form
5q, 5q + 1, 5q + 4 for some integer q.
ANSWER:

T IO S
To Prove: that the square of any positive integer is of the form 5q or 5q +

I
1, 5q + 4 for some integer q.
NO A D
CO N
Proof: Since positive integer n is of the form of 5q or 5q + 1, 5q + 4
A
If n = 5q

PY
DO U A

Then, 𝑛2 = (5𝑞 )2
T
ED PR

⇒ 𝑛2 = 25𝑞 2
⇒ 𝑛2 = 5(5𝑞 )
C
©

⇒ 𝑛2 = 5𝑚 (where 𝑚 = 5𝑞 )
If n = 5q + 1
Then 𝑛2 = (5𝑞 + 1)2
⇒ 𝑛2 = (5𝑞 )2 + 10𝑞 + 1
⇒ 𝑛2 = 25𝑞 2 + 10𝑞 + 1
⇒ 𝑛2 = 5𝑞 (5𝑞 + 2) + 1
⇒ 𝑛2 = 5𝑚 + 1 (where 𝑚 = 𝑞 (5𝑞 + 2))

If n = 5q + 2
Then 𝑛2 = (5𝑞 + 2)2
⇒ 𝑛2 = (5𝑞 )2 + 20𝑞 + 4
⇒ 𝑛2 = 25𝑞 2 + 20𝑞 + 4
⇒ 𝑛2 = 5𝑞 (5𝑞 + 4) + 4
⇒ 𝑛2 = 5𝑚 + 4 (where 𝑚 = 𝑞 (5𝑞 + 4))

If n = 5q + 4

T IO S
Then 𝑛2 = (5𝑞 + 4)2

I
⇒ 𝑛2 = (5𝑞 )2 + 40𝑞 + 16
NO A D
CO N
⇒ 𝑛2 = 25𝑞 2 + 40𝑞 + 16
A
⇒ 𝑛2 = 5(5𝑞 2 + 8𝑞 + 3) + 1

PY
DO U A

⇒ 𝑛2 = 5𝑚 + 1 (where 𝑚 = (5𝑞 2 + 8𝑞 + 3))

T
ED PR

Hence it is proved that the square of a positive integer is of the form 5q or

5q + 1, 5q + 4 for some integer q.
C
©

Page No 1.10:
Question 10: Show that the square of an odd positive integer is of the
form 8q + 1, for some integer q.
ANSWER:
To Prove: that the square of an odd 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 = 4m + 1
⇒ 𝑛2 = (4𝑚 + 1)2
⇒ 𝑛2 = (4𝑚)2 + 8𝑚 + 1
⇒ 𝑛2 = 16𝑚2 + 8𝑚 + 1
⇒ 𝑛2 = 8𝑚(2𝑚 + 1) + 1
⇒ 𝑛2 + 8𝑞 + 1(𝑞 = 𝑚(2𝑚 + 1))

If n = 4m + 3
⇒ 𝑛2 = (4𝑚 + 3)2

T IO S
⇒ 𝑛2 = (4𝑚)2 + 24𝑚 + 9

I
⇒ 𝑛2 = 16𝑚2 + 24𝑚 + 9
NO A D
CO N
⇒ 𝑛2 = 8(2𝑚2 + 3𝑚 + 1) + 1
A
(𝑞 = (2𝑚2 + 3𝑚 + 1))

PY
⇒ 𝑛2 = 8𝑞 + 1
DO U A
T
Hence n2 integer is of the form 8q + 1, for some integer q.
ED PR
C

Page No 1.11:
©

Question 11: Show that any positive odd integer is of the form 6q + 1 or,
6q + 3 or, 6q + 5, where q is some integer.
ANSWER:
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
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.

Page No 1.11:
Question 12:
Show that the square of any positive integer cannot be of the form 6m + 2

T IO S
or 6m + 5 for any integer m.

I
NO A D
ANSWER:

CO N
A
Suppose a be any arbitrary positive integer, then by Euclid's division
algorithm, corresponding to the positive integers 𝑎 and 6, there exists

PY
DO U A
non-negative integers a and r such that
T
ED PR

a = 6q + r, where 0≤r<6
⇒ 𝑎2 = (6𝑞 + 𝑟)2 = 36𝑞 2 + 𝑟 2 + 12𝑞𝑟
C

⇒ 𝑎2 = 6(6𝑞 2 + 2𝑞𝑟) + 𝑟 2 . . . . . (1) where, 0 ≤ 𝑟 < 6

©

Case: 1
When r = 0.
Putting r = 0 in (1), we get
𝑎2 = 6(6𝑞 )2 = 6𝑚
Where, 𝑚 = 6𝑞 2 is an integer

Case: 2
When r = 1.
Putting r = 1 in (1), we get
𝑎2 = 6(6𝑞 2 + 2𝑞 ) + 1
⇒ 𝑎2 = 6𝑚 + 1
Where, 𝑚 = (6𝑞 2 + 2𝑞 ) is an integer

Case: 3
When r = 2.

T IO S
Putting r = 2 in (1), we get

I
𝑎2 = 6(6𝑞 2 + 4𝑞 ) + 4
NO A D
CO N
⇒ 𝑎2 = 6𝑚 + 4
A
Where, 𝑚 = (6𝑞 2 + 4𝑞 ) is an integer

PY
DO U A
T
ED PR

Case: 4
When r = 3.
C
©

Putting r = 3 in (1), we get

𝑎2 = 6(6𝑞 2 + 6𝑞 ) + 9
⇒ 𝑎2 = 6(6𝑞 2 + 6𝑞 ) + 6 + 3
⇒ 𝑎2 = 6(6𝑞 2 + 6𝑞 + 1) + 3
⇒ 𝑎2 = 6𝑚 + 3
Where, 𝑚 = (6𝑞 2 + 6𝑞 + 1) is an integer

Case: 5
When r = 4
Putting r = 4 in (1), we get
𝑎2 = 6(6𝑞 2 + 8𝑞 ) + 16
⇒ 𝑎2 = 6(6𝑞 2 + 8𝑞 ) + 12 + 4
⇒ 𝑎2 = 6(6𝑞 2 + 8𝑞 + 2) + 4
⇒ 𝑎2 = 6𝑚 + 4
Where, 𝑚 = (6𝑞 2 + 8𝑞 + 2) is an integer

T IO S
Case: 6

I
When r = 5.
NO A D
CO N
Putting r = 5 in (1), we get
A
𝑎2 = 6(6𝑞 2 + 10𝑞 ) + 25

PY
DO U A

⇒ 𝑎2 = 6(6𝑞 2 + 10𝑞 ) + 24 + 1
T
ED PR

⇒ 𝑎2 = 6(6𝑞 2 + 10𝑞 + 4) + 1
⇒ 𝑎2 = 6𝑚 + 1
C
©

Where, 𝑚 = (6𝑞 2 + 10𝑞 + 1) is an integer

Hence, the square of any positive integer cannot be of the form 6m + 2 or

6m + 5.

Page No 1.11:
Question 13: Show that the cube of a positive integer is of the form 6q +
r, where q is an integer and r = 0, 1, 2, 3, 4, 5.
ANSWER:
Suppose a be any arbitrary positive integer, then by Euclid's division
algorithm, corresponding to the positive integers 𝑎 and 6, there exists non-
negative integers a and r such that
a = 6q + r, where 0 ≤ 𝑟 < 6
⇒ 𝑎3 = (6𝑞 + 𝑟)3 = 216𝑞 3 + 𝑟 3 + 3 × 6𝑞 × 𝑟(6𝑞 + 𝑟)
⇒ 𝑎3 = 6(216𝑞 3 + 108𝑞 2 𝑟 + 18𝑞𝑟 2 ) + 𝑟 3 . . . . . (1)
where, 0 ≤ 𝑟 < 6

T IO S I
NO A D
Case: 1

CO N
A
When r = 0.

PY
DO U A
Putting r = 0 in (1), we get
T
𝑎3 = 216𝑞 3 = 6(36𝑞 3 ) = 6𝑚
ED PR

Where, 𝑚 = 36𝑞 3 is an integer

C
©

Case: 2
When r = 1.
Putting r = 1 in (1), we get
𝑎3 = (216𝑞 3 + 108𝑞 + 18𝑞 ) + 1
⇒ 𝑎3 = 6(36𝑞 3 + 18𝑞 2 + 3𝑞 ) + 1
⇒ 𝑎3 = 6𝑚 + 1
Where, 𝑚 = (36𝑞 3 + 18𝑞 2 + 3𝑞 ) is an integer
Case: 3
When r = 2.
Putting r = 2 in (1), we get
𝑎3 = (216𝑞 3 + 216𝑞 2 + 72𝑞 ) + 8
⇒ 𝑎3 = (216𝑞 3 + 216𝑞 2 + 72𝑞 + 6) + 2
⇒ 𝑎3 = 6(36𝑞 3 + 36𝑞 2 + 12𝑞 + 1) + 2
⇒ 𝑎3 = 6𝑚 + 2

T IO S I
Where, 𝑚 = (36𝑞 3 + 36𝑞 2 + 12𝑞 + 1) is an integer
NO A D
CO N
A
Case: 4

PY
DO U A

When r = 3.
T
ED PR

Putting r = 3 in (1), we get

𝑎3 = (216𝑞 3 + 324𝑞 2 + 162𝑞 ) + 27
C
©

⇒ 𝑎3 = (216𝑞 3 + 324𝑞 2 + 162𝑞 + 24) + 3

⇒ 𝑎3 = 6(36𝑞 2 + 54𝑞 2 + 27𝑞 + 4) + 3
⇒ 𝑎3 = 6𝑚 + 3
Where, 𝑚 = (36𝑞 2 + 54𝑞 2 + 27𝑞 + 4) is an integer

Case: 5
When r = 4
Put r = 4 in (1), we get
𝑎3 = (216𝑞 3 + 432𝑞 2 + 288𝑞 ) + 64
⇒ 𝑎3 = (36𝑞 3 + 72𝑞 2 + 48𝑞 + 60) + 4
⇒ 𝑎3 = 6(36𝑞 3 + 72𝑞 2 + 48𝑞 + 10) + 4
⇒ 𝑎3 = 6𝑚 + 4
Where, 𝑚 = (36𝑞 3 + 72𝑞 2 + 48𝑞 + 10) is an integer

Case: 6
When r = 5.

T IO S
Putting r = 5 in (1), we get

I
𝑎3 = 216𝑞 3 + 540𝑞 2 + 450𝑞 + 125
NO A D
CO N
⇒ 𝑎3 = 6(36𝑞 3 + 90𝑞 2 + 75𝑞 + 20) + 5
A
⇒ 𝑎3 = 6𝑚 + 5

PY
DO U A

Where, 𝑚 = (36𝑞 3 + 90𝑞 2 + 75𝑞 + 20) is an integer

T
ED PR

Hence, the cube of any positive integer of the form 6q + r, where q is an

C

integer and r = 0, 1, 2, 3, 4, 5.
©

Page No 1.11:
Question 14: Show that one and only one out of n, n + 4, n + 8, n +12 and
n + 16 is divisible by 5, where n is any positive integer.
ANSWER:
Consider the numbers n, (n+4), (n+8), (n+12) and (n+16), where n is any
positive integer.
Suppose 𝑛 = 5𝑞 + 𝑟, where 0 ≤ 𝑟 < 5
𝑛 = 5𝑞, 5𝑞 + 1, 5𝑞 + 2, 5𝑞 + 3, 5𝑞 + 4
(By Euclid's division algorithm)
Case: 1
When 𝑛 = 5𝑞.
𝑛 = 5𝑞 is divisible by 5.
𝑛 + 4 = 5𝑞 + 4 is not divisible by 5.
𝑛 + 8 = 5𝑞 + 5 + 5 + 3 = 5(𝑞 + 1) + 3 is not divisible by 5.
𝑛 + 12 = 5𝑞 + 10 + 2 = 5(𝑞 + 2) + 2 is not divisible by 5.

T IO S I
𝑛 + 16 = 5𝑞 + 15 + 1 = 5(𝑞 + 3) + 1 is not divisible by 5.
NO A D
CO N
A
Case: 2

PY
DO U A

When 𝑛 = 5𝑞 + 1.
T
ED PR

𝑛 = 5𝑞 + 1 is not divisible by 5.
𝑛 + 4 = 5𝑞 + 1 + 4 = 5(𝑞 + 1) is divisible by 5.
C
©

𝑛 + 8 = 5𝑞 + 1 + 5 + 3 = 5(𝑞 + 1) + 4 is not divisible by 5.

𝑛 + 12 = 5𝑞 + 1 + 12 = 5(𝑞 + 2) + 3 is not divisible by 5.
𝑛 + 16 = 5𝑞 + 1 + 16 = 5(𝑞 + 3) + 2 is not divisible by 5.

Case: 3
When 𝑛 = 5𝑞 + 2.
𝑛 = 5𝑞 + 2 is not divisible by 5.
𝑛 + 4 = 5𝑞 + 2 + 4 = 5(𝑞 + 1) + 1 is not divisible by 5.
𝑛 + 8 = 5𝑞 + 2 + 8 = 5(𝑞 + 2) is divisible by 5.
𝑛 + 12 = 5𝑞 + 2 + 12 = 5(𝑞 + 2) + 4 is not divisible by 5.
𝑛 + 16 = 5𝑞 + 2 + 16 = 5(𝑞 + 3) + 3 is not divisible by 5.

Case: 4
When 𝑛 = 5𝑞 + 3.
𝑛 = 5𝑞 + 3 is not divisible by 5.
𝑛 + 4 = 5𝑞 + 3 + 4 = 5(𝑞 + 1) + 2 is not divisible by 5.
𝑛 + 8 = 5𝑞 + 3 + 8 = 5(𝑞 + 2) + 1 is not divisible by 5.

T IO S I
𝑛 + 12 = 5𝑞 + 3 + 12 = 5(𝑞 + 3) is divisible by 5.
NO A D
CO N
𝑛 + 16 = 5𝑞 + 3 + 16 = 5(𝑞 + 3) + 4 is not divisible by 5.
A

PY
DO U A

Case: 5
T
ED PR

When 𝑛 = 5𝑞 + 4.
𝑛 = 5𝑞 + 4 is not divisible by 5.
C
©

𝑛 + 4 = 5𝑞 + 4 + 4 = 5(𝑞 + 1) + 3 is not divisible by 5.

𝑛 + 8 = 5𝑞 + 4 + 8 = 5(𝑞 + 2) + 2 is not divisible by 5.
𝑛 + 12 = 5𝑞 + 4 + 12 = 5(𝑞 + 3) + 1 is not divisible by 5.
𝑛 + 16 = 5𝑞 + 4 + 16 = 5(𝑞 + 4) is divisible by 5.
Hence, in each case, one and only one out of n, 𝑛 + 4, 𝑛 + 8, 𝑛 + 12 and
𝑛 + 16 is divisible by 5.
Page No 1.11:
Question 15: Show that the square of an odd positive integer can be of
the form 6q + 1 or 6q + 3 for some integer q.
ANSWER:
It is known that any positive integer can be written in the form of 6𝑚,
6𝑚 + 1, 6𝑚 + 2, 6𝑚 + 3, 6𝑚 + 4, 6𝑚 + 5 for some integer m.
Thus, an odd positive integer can be of the form 6𝑚 + 1,6𝑚 + 3,6𝑚 + 5.
We have, (6𝑚 + 1)2 = 36𝑚2 + 12𝑚 + 1 = 6(6𝑚2 + 2𝑚) + 1 =
6𝑞 + 1, where 𝑞 = 6𝑚2 + 2𝑚 is an integer
(6𝑚 + 3)2 = 36𝑚2 + 36𝑚 + 9 = 6(6𝑚2 + 6𝑚 + 1) + 3 = 6𝑞 + 3 ,
where 𝑞 = 6𝑚2 + 6𝑚 + 1 is an integer

T IO S
(6𝑚 + 5)2 = 36𝑚2 + 60𝑚 + 25 = 6(6𝑚2 + 10𝑚 + 4) + 1 = 6𝑞 + 1,
where 𝑞 = 6𝑚2 + 10𝑚 + 4 is an integer

I
NO A D
CO N
Thus, the square of an odd positive integer can be of the form 6q + 1 or
A
6q + 3 for some integer q.

PY
DO U A
T
ED PR

Page No 1.11:
Question 16: A positive integer is of the form 3q + 1, q being a natural
C

number. Can you write its square in any form other than 3m + 1,3m or 3m
©

+ 2 for some integer m? Justify your answer.

ANSWER:
By Euclid's lemma, 𝑏 = 𝑎𝑞 + 𝑟, 0 ≤ 𝑟 < 𝑎.
Here, b is a positive integer and a = 3.
∴ 𝑏 = 3𝑞 + 𝑟, for 0 ≤ 𝑟 < 3
This must be in the form 3𝑞, 3𝑞 + 1 or 3𝑞 + 2.
Now,
(3𝑞 )2 = 9𝑞 2 = 3𝑚, where 𝑚 = 3𝑞 2
(3𝑞 + 1)2 = 9𝑞 2 + 6𝑞 + 1 = 3(3𝑞 2 + 2𝑞 ) + 1 = 3𝑚 + 1, where 𝑚 =
3𝑞 2 + 2𝑞
(3𝑞 + 2)2 = 9𝑞 2 + 12𝑞 + 4 = 3(3𝑞 3 + 4𝑞 + 1) + 1 = 3𝑚 + 1, where
𝑚 = 3𝑞 2 + 4𝑞 + 1
Therefore, the square of a positive integer 3q + 1 is always in the form of
3m or 3m + 1 for some integer m.

T IO S
Page No 1.11:

I
Question 17: Show that the square of any positive integer cannot be of
NO A D
CO N
the form 3m + 2, where m is a natural number.
A
ANSWER:

PY
DO U A
By Euclid's lemma, 𝑏 = 𝑎𝑞 + 𝑟, 0 ≤ 𝑟 < 𝑎.
T
ED PR

Here, b is a positive integer and a = 3.

∴ 𝑏 = 3𝑞 + 𝑟, for 0 ≤ 𝑟 < 3
C

This must be in the form 3𝑞, 3𝑞 + 1 or 3𝑞 + 2.

©

Now,
(3𝑞 )2 = 9𝑞 2 = 3𝑚, where 𝑚 = 3𝑞 2
(3𝑞 + 1)2 = 9𝑞 2 + 6𝑞 + 1 = 3(3𝑞 2 + 2𝑞 ) + 1 = 3𝑚 + 1, where 𝑚 =
3𝑞 2 + 2𝑞
(3𝑞 + 2)2 = 9𝑞 2 + 12𝑞 + 4 = 3(3𝑞 2 + 4𝑞 + 1) + 1 = 3𝑚 + 1, where
𝑚 = 3𝑞 2 + 4𝑞 + 1
Therefore, the square of a positive integer cannot be of the form 3𝑚 + 2,
where m is a natural number.