I am having some trouble constructing this proof.
Prove that if x+y is odd, then x and y are of same parity.
Proof: Assume x and y have same parity.
Case1: x and y are odd. x= 2k+1 , y=2m+1.
x+y= (2k+1) + (2m+1) = 2k+2m+2= 2(k+m)+1 I know I made a mistake here. How do I get rid of that =2?
Case 2: x and y are even. Foolow the same steps used in Case 1. Am I correct?
Now do I give a contrapositive?
"If x and y are two integers with opposite parity, then their sum must be odd." So we assume x and y have opposite parity. Since one of these integers is even and the other odd, there is no loss of generality to suppose x is even and y is odd. Thus, there are integers k and m for which x = 2k and y = 2m+1. Now then, we compute the sum x+y = 2k + 2m + 1 = 2(k+m) + 1, which is an odd integer by definition.
Have it done any of the proof correctly? Thankyou in advance.
Prove that if x+y is odd, then x and y are of same parity.
Proof: Assume x and y have same parity.
Case1: x and y are odd. x= 2k+1 , y=2m+1.
x+y= (2k+1) + (2m+1) = 2k+2m+2= 2(k+m)+1 I know I made a mistake here. How do I get rid of that =2?
Case 2: x and y are even. Foolow the same steps used in Case 1. Am I correct?
Now do I give a contrapositive?
"If x and y are two integers with opposite parity, then their sum must be odd." So we assume x and y have opposite parity. Since one of these integers is even and the other odd, there is no loss of generality to suppose x is even and y is odd. Thus, there are integers k and m for which x = 2k and y = 2m+1. Now then, we compute the sum x+y = 2k + 2m + 1 = 2(k+m) + 1, which is an odd integer by definition.
Have it done any of the proof correctly? Thankyou in advance.