Question

In: Advanced Math

prove that if an even integer n is subtracted from an odd integer m. then m...

prove that if an even integer n is subtracted from an odd integer m. then m - n is odd.

Solutions

Expert Solution

Proof :

We know that an even integer is the one which is exactly divisible by 2 i.e., an even integer is always a multiple of 2.

Let n be an even integer , then n can also be written as the multiple of 2 .

i.e., n = 2h .........(1)

where h is some other integer .

Also let m be an odd integer , then m can also be written as -

m = 2k+1 ...........(2)

where k is some other integer .

Now , subtracting equation (1) from equation (2) , we get -

Put (k-h) = u .

Here , u will also be an integer because difference of two integers is always an integer (i.e., integers are closed under subtraction )

i.e., we have -

, u is an integer .

Now , since u is any integer , then 2u , being a multiple of 2 , will be even and hence (2u+1) will be odd.

Thus , from above it is clear that (m-n) is odd .

Hence , we get -

The difference (m-n) of an odd integer m and an even integer n , is odd .

Proved !


Related Solutions

Prove that if n is an integer and n^2 is even the n is even.
Prove that if n is an integer and n^2 is even the n is even.
prove that every integer is either even or odd but never both.
prove that every integer is either even or odd but never both.
Prove that every natural number is odd or even.
Prove that every natural number is odd or even.
Prove that for an integer k, k2 + 4k + 6 is odd if and only...
Prove that for an integer k, k2 + 4k + 6 is odd if and only if k is odd.
Prove that the following is true for all positive integers n: n is odd if and...
Prove that the following is true for all positive integers n: n is odd if and only if n2 is odd.
Using for loop . Input an integer and identify whether it's EVEN OR ODD ( without...
Using for loop . Input an integer and identify whether it's EVEN OR ODD ( without using modulo operator ) using only <iostream> . C++ programming
Let n be a positive integer. Prove that if n is composite, then n has a...
Let n be a positive integer. Prove that if n is composite, then n has a prime factor less than or equal to sqrt(n) . (Hint: first show that n has a factor less than or equal to sqrt(n) )
4. Let n ≥ 8 be an even integer and let k be an integer with...
4. Let n ≥ 8 be an even integer and let k be an integer with 2 ≤ k ≤ n/2. Consider k-element subsets of the set S = {1, 2, . . . , n}. How many such subsets contain at least two even numbers?
prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure...
prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure how to approach the problem. I thought to assume that x=2a+1 and then show that 3^x +1 is divisible by 4 and thus congruent to 3x=-1(mod4) but I'm stuck.
Counts the number of odd, even, and zero digits in an integer input value. Repeat until...
Counts the number of odd, even, and zero digits in an integer input value. Repeat until user does not want to continue. Develop the program in an incremental fashion. For example, write the part of the program, which inputs a single integer value and displays number of odd, even, and zero digits in that number. Submit your partial program for grading to make sure it works for the first few test cases. Below is an example execution of a partial...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT