use euclid division lemma to show that the square of any positive integers is either of the from 3m or 3m+1forsomeinteger m
Answers
Answered by
0
Answer:
when a number is divided by 3 the remainders are 0,1,2
so,
(3m)^2is equal to 9m^2
=3m(3m)
=3n......3m=n
when remainder is 1
3m+1
(3m+1)^2=3m^2+1+6m
=3m(m+2)+1
=3n+1
when remainder is 2
3m+2
=(3m+2)^2
=3m^2+4+12m
=3m^2+12m+3+1
=3(m^2+4+1)+1
=3n+1
hence proved
Answered by
0
Answer:
It is the correct answer.
Step-by-step explanation:
Hope this attachment helps you.
Attachments:
Similar questions