Question

Prove that any integer can be odd or even

Answer 1

Proof: (By contradiction)

Let's assume that there exists some integer that is neither even or odd. Let that integer be a.

This implies:

2 does not divide a [Because a is not even].

But this is a contradiction since a is also not odd, and odd numbers are those which do not divide a.

Hence Proved.