Explanation:
The proof can be done by contradiction. Suppose both a, and b weren't even. So that a, and b are both odd. This means they both look like
(for some integers k and l)
So, let's compute what
would be in this case:



which notice wouldn't be divisible by 4. This shows then that since
is divisible by 4, at least one of the integers a and b is even.