Difference between revisions of "Proof by contrapositive"
m (wik) |
m (→Problem: forgot to fix the typo i meant to fix!) |
||
Line 4: | Line 4: | ||
===Parity=== | ===Parity=== | ||
====Problem==== | ====Problem==== | ||
− | Show that | + | Show that if <math>x</math> and <math>y</math> are two integers for which <math>x+y</math> is even, then <math>x</math> and <math>y</math> have the same [[parity]]. |
+ | |||
====Solution==== | ====Solution==== | ||
The contrapositive of this is | The contrapositive of this is |
Revision as of 20:49, 22 October 2007
Proof by contrapositive is a method of prove in which the contrapositive of the desired statement is proven, and thus it follows that the original statement is true. Generally, this form is only used when it is impossible to prove the original statement directly.
Contents
Examples
Parity
Problem
Show that if and are two integers for which is even, then and have the same parity.
Solution
The contrapositive of this is
- If and are two integers with opposite parity, then their sum must be odd.
So we assume and have opposite parity. Since one of these integers is even and the other odd, there is no loss of generality to suppose is even and is odd. Thus, there are integers and for which and . Now then, we compute the sum , which is an odd integer by definition.
Odd Squares
Problem
Show that if is an odd integer, then is odd.
Solution
Suppose is an even integer. Then there exists and integer such that . Thus . Since is an integer, is even. Therefore is not odd.