Answer:
You can prove this statement as follows:
Explanation:
An odd integer is a number of the form
where
. Consider the following cases.
Case 1. If
is even we have:
.
If we denote by
we have that
.
Case 2. if
is odd we have:
.
If we denote by
we have that
![(2k+1)^(2)=8m+1](https://img.qammunity.org/2020/formulas/mathematics/college/m698rew6p4kl0o77hnwg4cy303l5tpu0g1.png)
This result says that the remainder when we divide the square of any odd integer by 8 is 1.