By Euclid’s division algorithm
a = bq + r, where 0 ≤ r ≤ b
Put b = 4
a = 4q + r, where 0 ≤ r ≤ 4
If r = 0, then a = 4q even
If r = 1, then a = 4q + 1 odd
If r = 2, then a = 4q + 2 even
If r = 3, then a = 4q + 3 odd
Now, (4q + 1)2 = (4q)2 + 2(4q)(1) + (1)2
= 16q2 + 8q + 1
= 8(2q2 + q) + 1
= 8m + 1 where m is some integer
Hence the square of an odd integer is of the form 8q + 1, for some integer q