Question

prove that the square of any positive integer of the form 5 M + 1 will leave a remainder 1 when divided by 5 for some integer m​

Answer 1

according to algorithm

a=bq+r, let b=5

when r=o

a=5q+o

let q=m

then=5m

when r=1

from above

a=5m+1