Contrapositive Proof: Ints $m$ & $n$ - Even/Odd Combinations

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
tmt1
Messages
230
Reaction score
0
For all integers $m$ and $n$, if $m+ n$ is even then $m$ and $n$ are both even or both odd.

For a contrapositive proof, I need to show that for all ints $m$ and $n$ if $m$ and $n$ and not both even and not both odd, then $ m + n $ is not even.

How do I go about doing this?
 
Physics news on Phys.org
The negation of the conclusion is that exactly ONE of $m,n$ is odd.

In a proof of this type, you may assume $m$ is even, and $n$ is odd (or else we may "switch them").

Your mission, should you decide to accept it, is to prove that in this case, we have the negation of the premise:

that is, to show that $m+n$ is thus odd.