Question
Proving the cube of an integer even implies even integer
Original question: (i) If and is an even number then is an even number.
This statement is true. Let be even. This statement is true because when is even, also even.
Expert Verified Solution
Key takeaway: The claim about being even depends on what kind of number is, because “even” only applies to integers.
The statement needs a careful check
The claim given is: if and is an even number, then is an even number. As written, this statement is not correct, because the word even applies to integers, not to arbitrary real numbers. For real numbers like , the cube is , which is even as an integer, but itself is not an even integer.
So before proving anything, we must fix the statement. A mathematically valid version is: if is an integer and is even, then is even.
Proof by contrapositive
To prove the corrected statement, use the contrapositive. Instead of proving "if is even, then is even," prove the equivalent statement:
If is odd, then is odd.
Let be odd. Then there exists an integer such that
Cube both sides:
Expand the binomial:
Factor out 2 from the first three terms:
This has the form for an integer , so is odd. Therefore, the contrapositive is true, and the corrected statement is proven.
Why the original attempt fails
The work shown in the prompt starts by assuming is even and then shows is even. That proves only one direction: even integers have even cubes. It does not prove the converse. To prove "if is even, then is even," you need either a contrapositive or a contradiction argument.
There is also a language issue. The line " and is an even number" mixes real numbers with an integer property. If a teacher expects a proof in number theory, the domain should usually be . If the domain stays real numbers, the statement is false.
What a complete answer should say
A strong final response should mention the counterexample to the original real-number claim and then present the corrected integer proof. That shows both logical precision and mathematical understanding. In proof writing, fixing the statement is often just as important as proving it.
So the right conclusion is: the statement is false as written for real numbers, but the integer version is true, and its proof is best done by contrapositive.
Pitfalls the pros know 👇 The first place this proof can go wrong is accepting the phrase “ is even” when is only assumed to be real. Even and odd are properties of integers, so the statement must be checked for a domain mismatch before any algebra begins. Another common mistake is trying to prove the converse by showing that even integers have even cubes; that only proves one direction and does not justify the implication from to . Students also sometimes write "" without stating that is an integer, which weakens the proof. If you want a rigorous result, either change the hypothesis to integers or supply a counterexample showing the real-number version is false. Then use the contrapositive, since that route is shorter and cleaner than trying to reason directly from cube parity.
What if the problem changes? If the problem were rewritten as “If and is even, then is even,” the statement becomes true and the proof is straightforward. A different variant would be: “If is odd, then is odd.” In that version, write and expand to show it equals for some integer . Another useful variant is to replace the cube with a fifth power: if is even, then is even for integers . The same contrapositive idea works, because any odd integer raised to an odd power remains odd. These variants help show that the parity argument is really about odd and even integers, not about arbitrary real numbers.
Tags: proof by contrapositive, parity of integers, odd and even integers
FAQ
Why is the statement about z cubed being even not correct for real numbers?
Because even and odd are properties of integers, not all real numbers. A real number can have an even cube without itself being an even integer, so the original claim is false as written.
What is the best way to prove the corrected integer version of this parity statement?
Use the contrapositive. Assume the integer is odd, write it in the form two k plus one, cube it, and show the result is still odd. That proves the original implication.