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.
//----------------------------------------------------------------- // Counts the number of odd, even, and zero digits in an integer // input...
//----------------------------------------------------------------- // Counts the number of odd, even, and zero digits in an integer // input value. Repeat as long as the user wishes to continue //----------------------------------------------------------------- public static void main(String[] args) {     // Declare the identifiers final int SENTINEL = -99;    // Declare the remaining identifiers ... Scanner scan = new Scanner(System.in);    // Display the programmer's information              // Input an integer number          // Count the number of odd, even, and...
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.
3. To begin a proof by contradiction for “If n is even then n+1 is odd,”...
3. To begin a proof by contradiction for “If n is even then n+1 is odd,” what would you “assume true? 4. Prove that the following is not true by finding a counterexample. “The sum of any 3 consecutive integers is even" 5. Show a Proof by exhaustion for the following: For n = 2, 4, 6, n²-1 is odd 6.  Show an informal Direct Proof for “The sum of 2 even integers is even.” Recursive Definitions 7.  The Fibonacci Sequence is...
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?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT