- #1

Panphobia

- 435

- 13

## Homework Statement

Prove if n is an odd integer then n^2 - 1 is divisible by 8

## The Attempt at a Solution

I already set up the whole inductive step and everything but I am trying to prove it works for n+1, here is what I have so far...

n=2k+1

((2k+1)+1)^2 - 1 = 4k^2 + 8k + 3 = 8m

Where k and m are arbitrary integers.

What do I do from here to get it in the form 8m? I can't figure it out.