I am stuck trying to get the inductive step done on the following proof...
For all $n \ge 0, n^2 - n$ is even.
I have established that the problem is even by setting it equal to $2k$ and then plugging in $n+1$ but after that I am stuck.
Proof: Proceed using induction. Base case: Set $n = 0.$ $0^2 - 0 = 0$ which is even.
Inductive step: Set $n\ge0$. Suppose that $n^2-n$ is even. Then there exists integer $k$ such that $n^2-n = 2k$.
Then $(n+1)^2-(n+1) = 2k$