prove the square of any integer leaves the remainder either 0 or 1 when divided by 4
Answers
Answered by
2
Answer:
On My Way
Step-by-step explanation:
Im sorry but, don't wanna talk Ineed a movement before I go its nothing personal I draw the blind they dont never see me cry cuz even if they understand they dont understand
Answered by
0
Answer:-
Let the integer be even => x = 2k
x² = (2k)² = 4k²
It is multiple of 4.
Let the integer be odd => y= 2k+1
y² = (2k+1)² = 4k² + 4k + 1 => 4(k² + k) + 1
When it is divided by 4 gives REMAINDER 1.
Hence, proved.
Similar questions