Prove That If x + 5 Is Odd, Then x² Is Even
At a glance
- 1. Assume integers
Parity is defined for integers, so take x to be an integer.
- 2. Solve for x
Write x + 5 as 2k + 1; subtracting 5 shows x is even.
- 3. Square the result
Write x as 2m and factor x² as 2 times an integer.
Assume that is an integer. The statement is then true: if is odd, must be even, and the square of an even integer is even. The proof follows directly from the definitions of odd and even.
Direct proof from the definitions
An integer is odd if it can be written as for some integer . If is odd, there is an integer such that
Subtract from both sides:
Because is an integer, is also an integer. Thus has the form for the integer , so is even. Squaring gives
The quantity is an integer, so is twice an integer. That is exactly the definition of an even integer. This proves the claim.
A shorter parity argument
Adding an odd integer to an integer changes its parity: an even integer plus an odd integer is odd, while an odd integer plus an odd integer is even. Since is odd, the only way for to be odd is for to be even. The square of an even integer is even, because if , then .
The definition-based proof is often preferable in a formal proof because it shows exactly which integer witnesses make the expressions even or odd.
Worked example
Take . Then , which is odd. The proof’s representation applies with , since . It gives
so is even. Its square is , also even.
The same reasoning works for negative integers. For instance, if , then is odd, and is even. The definitions use integer multiples of and do not require the integer to be positive.
Why the integer assumption matters
Odd and even are normally defined only for integers. If is an arbitrary real number, the phrases “ is odd” and “ is even” do not have their usual number-theoretic meaning. The claim should therefore be read with the domain stated: .
If the premise is instead understood to mean that is an odd integer, that condition itself implies is an integer, because subtracting the integer from an integer leaves an integer. The conclusion then follows as above.
Common mistakes
- Ignoring the domain: State that is an integer, or explain why the premise makes it an integer. Parity is not ordinarily assigned to arbitrary real numbers.
- Stopping after showing is even: The requested conclusion concerns . Finish by writing and showing .
- Assuming the square is even without justification: Use the definition: a number is even when it equals times an integer. Here the integer is .
- Treating the implication as an equivalence: The proof establishes the stated direction, not its converse. For integer , the converse is also true: if is even, then is even (an odd would give , which is odd), so is odd.
A compact final proof is: since is odd, for some integer . Hence , so , which is even.
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.