Question :
Using Euclid's Division Lemma, show that the square of any positive integer is either of the form 3m or (3m + 1) for some integer m.
Solution:
Let us consider any arbitrary integer be n.
On dividing n by 3, we get q as quotient and r as remainder. Then by Euclid's division lemma, we have
n = 3q + r , where 0=< r < 3.
Now, the question is asking to show the square of any positive integer. Therefore squaring both the sides.
n^2 = (3q + r)^2
n^2 = 9q^2 + r^2 + 6qr ....................(i)
Now, three cases arises as of remainder can be either 0, 1 or 3.
CASE I
n^2 = 9q^2
Now this 9q^2 can be written as the factor of 3.
n^2 = 3(3q^2)
n^2 = 3m , where m = (3q^2) and is an integer.
CASE II
n^2 = 3(3q^2 + 2q) + 1
n^2 = 3m + 1 , where m = (3q^2 + 2q) and is an integer.
CASE III
n^2 = 9q^2 + 12q + 3 + 1
n^2 = 3(3q^2 + 4q + 1) + 1
n^2 = 3m + 1 , where m = (3q^2 + 4q + 1) and is an integer.
Hence the square of any positive integer is of the form 3m or (3m + 1) for some integer m.
0 Comments