Is my proof correct? if so, is there something which isn't done nice? I am currently learning proofs on my own and the solutions in my book aren't always complete.
Lemma 1 given: Sum of an odd number of odd numbers is odd.
Lemma 2 given: A product of two integers is odd if both integers are odd.
Proving first implication: $ab+ac+bc$ is even $\Rightarrow$ at most one of $a,b,c$ is odd.
Proof by contradiction:
Suppose that $ab+ac+bc=2k$ and at least 2 of $a,b,c$ are odd.
Case 1: 2 numbers are odd.
WLOG assume that $a$ and $b$ are odd, write $a$ as $2k+1$, $b$ as $2l+1$ and $c$ as $2m$.
$$ab+ac+bc = (2k+1)(2l+1) + (2k+1)(2m) + (2l+1)(2m)$$
$$=(4kl + 2k + 2l + 1) + (4km + 2m) + (4lm + 2m)$$
$$=4kl + 2k + 2l + 4km + 2m + 4lm + 2m + 1$$
$$=2(2kl + k + l + 2km + m + 2lm + m) + 1$$
Since $2kl+k+l+2km+m+2lm+m$ is an integer $ab+ac+bc$ is odd which is a contradiction.
Case 2: three numbers are odd: is a contradiction if we proceed like in case 1.
Proving the second implication: If at most one of $a,b,c,$ is odd $\Rightarrow$ $ab +a c + bc$ is even.
Proof by contradiction:
Suppose that at most one of $a,b,c$ is odd and $ab + ac + bc$ is odd. Since $ab + ac + bc$ is odd,by lemma 1 one or three of the products are odd. By lemma 2 at least two numbers of $a,b,c$ are odd which is a contradiction.
$\blacksquare$
Edit:
Forgot to add second case.
Best Answer
Your argument is correct. Sometimes though people frown upon proofs by contradiction if you can do it without argument by contradiction.
For example, here you can say: If two or three of the numbers are even, each product is even and therefore the sum is even. If exactly one number is even, then two products are even and one is odd, so the sum is odd. If no numbers are even, each product is odd and therefore the sum is odd.
Still, what you did was fine.