Show that if n is an odd positive integer, then
n^2 is congruent to 1 modulo 8, i.e., n^2 = 1(mod 8)
This is good; it has the advantage of not relying on (general) principles of modular arithmetic. However, you would have a bit more trouble generalizing this type of argument; for instance proving that the square of every integer relatively prime to 12 is congruent to 1 modulo 12 might make the argument quite a lot less elegant.
Also, this question lends itself to induction.
Problem: Prove that if is an odd natural number then
Proof: We do this by weak induction.
Base case- Trivially
Inductive hypothesis- Assume that
Inductive step- Using the hypothesis we see that , but the next odd integer is given by and . Since is odd we know that is even therefore . So we may conclude that .