Sometimes a direct proof gets stuck because the hypothesis gives you nothing to compute with. Knowing that "$n^{2}$ is even" does not hand you a formula for $n$. The fix uses an equivalence you already know: a conditional and its contrapositive are true together.
Key idea
Why it works
Worked examples
Worked example: If $n^{2}$ is even, then $n$ is even
- Contrapositive: if $n$ is not even (odd), then $n^{2}$ is not even (odd).
- Assume $n$ is odd: $n = 2k + 1$. Then $n^{2} = 4k^{2} + 4k + 1 = 2(2k^{2} + 2k) + 1$.
- That is odd, so the contrapositive is proved, and with it the original statement.
Answer: Proved via: $n$ odd implies $n^{2} = 2(2k^{2} + 2k) + 1$ is odd.
Worked example: An "or" in the conclusion
- Negate the conclusion with De Morgan: not ($x \ge 5$ or $y \ge 5$) is $x < 5$ and $y < 5$.
- Contrapositive: if $x < 5$ and $y < 5$, then $x + y < 10$.
- Adding the inequalities gives $x + y < 5 + 5 = 10$. Done.
Answer: Proved via: $x < 5$ and $y < 5$ give $x + y < 10$.
Worked example: A linear expression
- Contrapositive: if $n$ is odd, then $3n + 5$ is even.
- Let $n = 2k + 1$. Then $3n + 5 = 6k + 3 + 5 = 6k + 8 = 2(3k + 4)$.
- That is even, which proves the contrapositive.
Answer: Proved via $3n + 5 = 2(3k + 4)$ when $n$ is odd.
Common mistake