Mathematics
Use proof by contradiction to prove that if for an integer a, a2 is even, then so is a.
Mathematics Proofs
2 Likes
Answer
By seeking contradiction,
Let a2 be even and a be odd.
So, a will be of form,
a = (2n + 1) for any integer n.
⇒ a2 = (2n + 1)2
⇒ a2 = 4n2 + 4n + 1
⇒ a2 = 4(n2 + n) + 1
Let (n2 + n) = k
⇒ a2 = 4k + 1
For any integer k, on multiplying by 4 makes it even and adding 1 to an even no. makes it odd.
So, a2 will be an odd number, which is not possible.
So, our assumption is wrong i.e. a is not odd.
Hence, proved that for an integer a if a2 is even, then so is a.
Answered By
1 Like
Related Questions
Suppose a + b = c + d, and a < c. Use proof by contradiction to show b > d.
Let r be a rational number and x be an irrational number. Use proof by contradiction to show that r + x is an irrational number.
Use proof by contradiction to prove that if for an integer a, a2 is divisible by 3, then a is divisible by 3.
Use proof by contradiction to show that there is no value of n for which 6n ends with the digit zero.