n^2 - n is even for any n >= 1
So far i have the base case:
n=1 1^2-1 = 0 and 2^2-2=2 which are both even.
then prove for n = k so k^2 - 2 for k>=1
then n= (k+1)^2 - (k+1).... having problems with further steps.
Why do you have to use induction?
If $\displaystyle n$ is odd and $\displaystyle \geq 1$, then $\displaystyle n = 2k+1$ where $\displaystyle k \in \{0, 1, 2, \dots\}$ and
$\displaystyle n^2 - n = (2k + 1)^2 - (2k + 1)$
$\displaystyle = (2k + 1)(2k + 1 - 1)$
$\displaystyle = 2k(2k + 1)$ which is clearly even.
If $\displaystyle n$ is even and $\displaystyle >1$, then $\displaystyle n = 2m$ where $\displaystyle m = \{1, 2, 3, \dots\}$ and
$\displaystyle n^2 - n = (2m)^2 - 2m$
$\displaystyle = 2m(2m - 1)$
which is clearly even.
Therefore $\displaystyle n^2 - n$ is even for any $\displaystyle n \geq 1$.
$\displaystyle n^2-n$ is even for $\displaystyle n\ \ge\ 1$
You've completed the base case...
Now you must show whether or not...
$\displaystyle true\ for\ n=k$ causes $\displaystyle true\ for\ n=k+1$
P(k)
$\displaystyle k^2-k$ is even
P(k+1)
$\displaystyle (k+1)^2-(k+1)$ is even if P(k) is true
Proof
$\displaystyle (k+1)^2-(k+1)=k^2+2k+1-k-1=k^2+k=\left(k^2-k)+2k$
Since 2k is even...
If P(k) is true, then P(k+1) is definately true.