Prove: for all integers n, if n2 is odd, then n is odd. use a proof by contraposition, as in lemma 1.1.

The contrapositive of above is "If n is not odd then n^2 is not odd" or "If n is even then n^2 is even".

So, let assume that n is even

then

which is even q.e.d.