Show that the square of any odd integer is of the form , for some integer .
Proving that the square of any odd integer is of the form , for some integer .
Apply Euclid's division algorithm, where are non-negative integers and .
Assume that .
Substitute and into .
We know that is odd
So, the value of cannot be since are divisible by and so are even.
Thus, .
Square on both sides.
Square on both sides.
Hence, it is proved that the square of any odd integer is of the form , for some integer .