Mathematical Induction prove that $n^3+5n$ is divisible by $6$ Sorry, I know this will be a duplicate on the site but the other solution I found confusing and the method look completely different to what I was taught.
Prove that $n^3 + 5n$ is divisible by $6$ by using induction
The question is
Prove by mathematical Induction  $(n^3+5n)$ is divisible by $6$
Here is what I have done 
Assume $n=k$ is true
$\sum_{1}^{k} k =\dfrac{(k^3+5k)}{6}$
Now assume $n=k+1$ is true
$\sum_{1}^{k+1} k+1 =\dfrac{(k+1)^3+5(k+1)}{6}$
Then now
$\dfrac{(k+1)^3+5(k+1)}{6}=\sum_{1}^{k} k + (k+1)$
$\dfrac{(k+1)^3+5(k+1)}{6}=\dfrac{(k^3+5k)}{6} + (k+1)$
$\dfrac{(k+1)^3+5(k+1)}{6}=\dfrac{(k^3+5k)}{6} + \dfrac{(6k+6)}{6}$
$\dfrac{(k+1)^3+5(k+1)}{6}=\dfrac{(k^3+11k+6)}{6}$
But the other side doesnt equate (LHS)
$\dfrac{(k^3+3k^2+3k+1)+5k+5}{6}$
$\dfrac{(k^3+3k^2+8k+6)}{6}\ne\dfrac{(k^3+11k+6)}{6}$
I hope my method was clear enough so you can see where I went wrong. It would be much more use to me if you solved it as I learn better from looking at solutions and then applying them to other questions. 

$$n^3+5n = n(n^2+5)$$
On the RHS, factor occur in odd, even pairs, so product is even and divisible by $2$.
$$n(n^2+5) \equiv n(n^2+2) \qquad \mod 3$$ 
Hence if $n \equiv 0$ (mod $3)$ then $3$ divides into the result and if $n \equiv \pm 1$ then $n^2 \equiv +1$ thus $3 | (n^2+2)$ and thus if both $2$ and $3$ are factors, then so is $6$.
