Use proof by contradiction to prove that if for an integer , is even, then so is .
We want to prove: If is even, then is even.
Proof by contradiction: Let us assume that is not even, that is, is odd. If is odd, then can be written in the form for some integer .
Now,
This shows that is of the form (where ), which means is odd.
But we are given that is even. Thus, we have arrived at a contradiction because cannot be both even and odd simultaneously. Therefore, our assumption that is odd is false. Hence, must be even.
∴ is even.
Explanation
This question is from Exercise A1.6, Question 3. The proof follows the standard contradiction method: assume the negation of what we want to prove (that is odd), derive a consequence that contradicts the given condition ( is even), and conclude the original statement must be true. The hint in the textbook guides students to express an odd number as .
Solution Steps
Step 1: Assume the negation — let be odd, so for some integer .
Step 2: Calculate , which is odd.
Step 3: This contradicts the given that is even.
Step 4: Conclude that must be even.