Use Euclid's division lemma to show that the square of any positive
integer is either of the form 3m or 3m+1 for some integer m.
Answers
Step-by-step explanation:
Let a be any positive integer such that 0<r<=b
and EDL.
Let b=3 and a= 3q+r where 0<r<=3. i.e. r= 0,1,2
a= (3q). when r= 0
(a)= (3q)^2
a^2= 9q^2
a^2= 3(3q^2)
a^2= 3m where m= 3q^2
a= (3q+1). when r =1
(a)^2= (3q+1)^2
a^2= 9q^2+6q+1
a^2= 3(3q^2+2q) +1
a^2= 3m+1 where m= 3q^2+2q
a= 3q+2. where r= 2
a^2= 9q^2+12q+4
a^2= 9q^2+12q+3+1
a^2= 3(3q^2+4q+1)+1
a^2= 3m+1 where m= 3q^2+4q+1
Therefore, we can say that square of any positive integer is of the form 3m or 3m +1
Question: Use Euclid's division lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.
Solution:
We'll prove this statement using Euclids Divison Lemma.
From Equations 1, 2, and 3 we can say that the square of any positive integer is either the form of 3m, or 3m + 1, for some positive integer 'm'.