A proof using the contrapositive

I am trying to prove the following conjecture:

Prove that if $m$ and $n$ are integers and $mn$ is even, then $m$ is even or $n$ is even.

Proof by contraposition:

Assume $m$ and $n$ are odd. Then $m = 2k + 1$ and $n = 2l + 1$. So $$mn = (2k + 1)(2l + 1) = 4kl + 2k + 2l + 1 = 2(2kl + k + l) + 1$$ QED

Is there anything else I need to do in order to prove this conjecture? Thank you!

Solution 1:

You did very well: you got to the "meat" of the proof.

I'll simply add "a side dish":

I would simply add, after demonstrating that, given $m$ and $n$ are both odd, and hence, as odd, there is an integer k such that $m= 2k+1$, and an integer $l$ such that $n = 2l+1$. Thus it follows that $$mn= 2(2kl + k + l) + 1 $$ by concluding that $$mn= 2(2kl + k + l) + 1 \,\text{ is odd. }$$

Hence, by the equivalence of the contrapositive, we have proven: "If $mn$ is even, then either $m$ or $n$ (or both) is even."

Solution 2:

Here is a slightly different way of doing it.

First note that the difference between two even numbers is even because $2a-2b=2(a-b)$ and if $m$ is odd then $m-1$ is even so $m-1=2r$ and $m=2r+1$.

Now suppose $mn$ is even and $m$ is odd, then $mn=(2r+1)n=2rn+n$ and $n=mn-2rn$ is the difference between two even numbers and hence is even.

So if $mn$ is even and $m$ is not we have shown that $n$ is even. Hence if $mn$ is even either $m$ is even or $n$ is even.

Solution 3:

The contrapositive is

If $m$ is odd and $n$ is odd, then $mn$ is odd.

If you prove this, then, since it is equivalent to your original problem, you will have solved the problem.

Which you did correctly. Perhaps, only thing you could add is at the beginning:

$m$ odd so we can find some integer $k$ so that $m=2k+1$ and we can find some integer $l$ so that $n=2l+1$