prove that square of any integers leaves the remainder either 0 or 1 when divided by 4
Answers
Answered by
2
Answer:
let the integer be a and b =4
by Euclid's lemma
a =bq +r , 0<=r<b
: r =0,1,2
case I when r = 0 .
a=4q+0
7KARTHI07:
worng
i want clearly step
to step by step
please
no problem
Answered by
0
Answer:
Step-by-step explanation:
Similar questions