Prove that if n is an odd integer, then $n^2-1$ is a multiple of 8 I've gotten through proving this all the way to $\cfrac{K^2+K}{8}$, where $n=2K+1$. Since it says that $n^2-1$ is a multiple of 8, the result needs to be an integer, i.e, p (representing $K^2+K$) needs to be something like $2(K^2+K)$.
Is using $4K+1$ to represent n the only way to get around this? I'd prefer to use $2K+1$ because that's more obvious. 
EDIT: My work 
$(2k+1)^2-1=8j \\ 4k^2+4k+1-1=8j \\ 4k(k+1)=8j \\ 4(k^2+k)=8j \\ \cfrac{4(k^2+k)}{8}=j$
I realize I made a mistake with forgetting to divide 8 by 4. But still how does $\cfrac{(k^2+k)}{2}=j$ mean it's a multiple of 8? 
 A: $(2k+1)^2-1=4(k^2+k)$ and $k^2+k$ is even
A: $n = 2m + 1; \tag 1$
$n + 1 = 2m + 2; \tag 2$
$n - 1 = 2m; \tag 3$
$n^2 - 1 = (n + 1)(n - 1) = (2m + 2)(2m) = 4m(m + 1); \tag 4$
at least one of $m, m + 1$ is even; thus
$m(m + 1) = 2k; \tag 5$
then
$n^2 - 1 = 4(2k) = 8k \Longrightarrow 8 \mid n^2 - 1. \tag 6$
A: Since $n$ is odd, $n\equiv 1$ or $n\equiv 3 \bmod 4$. In either case, one of $n-1,n+1$ is divisible by 2 and one by 4. Hence $n^2 - 1 = (n+1)(n-1)$ is divisible by 8.
A: Use this technique
$$n = 2k + 1$$
Then,
$n^2 - 1 = 4k^2 + 4k = 4k \left( k + 1 \right)$
Now, since $k$ and $k + 1$ are consecutive integers, either $k$ is even or $k + 1$ is even. Therefore,
$$n^2 - 1 = 8k' \left( k + 1 \right)$$
OR
$$n^2 - 1 = 8kk''$$
where if $k$ is even, then $k = 2k'$ and if $k + 1$ is even then $k + 1 = 2k''$
Hence, in any case, $8$ divides $n^2 - 1$.
A: Proof:
An odd integer n is either a $4k+1$ or a $4k+3$.
$(4k+1)2 – 1 = 16k2+ 8k + 1 - 1 =8(2k^2 +k)$, which is a multiple of 8.
$(4k+3)2 – 1 = 16k2+ 24k + 9 - 1 =8(2k^2 +3k + 1)$, which is a multiple of 8
A: Here is an inductive proof.
Denote $n=2k+1$ where $k=0,1,2,\cdots.$ Then $n^2-1=(2k+1)^2-1=4k^2+4k.$ We are to prove $4k^2+4k$ is a multiple of $8$.
Let $k=0$. Then $4k^2+4k=0$, which is a multiple of $8$. Assume it holds for $k=p$, namely $4p^2+4p=8q,q\in \mathbb{N}$. Then for $k=p+1$, we obtain $$4(p+1)^2+4(p+1)=(4p^2+4p)+8(p+1)=8q+8(p+1)=8(p+q+1),$$ which is also a multiple of $8$. Thus, by mathematical induction, we are done.
A: If you're talking about multiples, it often helps to use modular arithmetic. In this case, we only need to prove that $n^2-1=0$ for $n=1,3,5,7$, modulo $8$. But this is easy:
$$1^2=1$$
$$3^2=9=8+1=1$$
$$5^2=25=3*8+1=1$$
$$7^2=49=6*8+1=1$$
All larger odd numbers can be reduced to one of these four cases; if $m=8k+n$, where $n=1,3,5,$ or $7$, then
$$m^2=(8k+n)^2=(8k^2+2kn)*8+n^2=n^2$$
