Question

In: Advanced Math

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.

Solutions

Expert Solution

To prove:

For an integer k:

                        (1)

is odd if and only if k is odd

Proof by Contradiction:
Step 1:

By Contradiction:

Assume k is even.

Step 2:
Then, by theorem, as the square of even integer is even, k2 is even.

Step 3:

By theorem, 4k, the product of an even integer by 4 is even.

Step 4:

6 is an even integer.

Step 5:
By theorem, the sum of 3 even integers is even.

Thus,

is even.

Step 6:
But, Given:

is odd.

This contradiction proves that the initial assumption that k is even is incorrect.

This proves the required result that

is odd if and only if k is odd.

Also:
If k is odd, since by theorem, the square of an odd integer is odd, k2 is odd.

4k = the product of an even integer by 4 is even.

6 is even integer.

Thus,

is the sum of an odd integer, an even integer and an even integer.

Thus, by Theorem,

is an odd integer.


Related Solutions

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.
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 this is true: The sequence {4k + 3} where k ∈ N contains infinitely many...
Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many primes, but the sequence {4k + 2} does not.
Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many...
Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many primes, but the sequence {4k + 2} does not. Show your work.
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.
Show that there is only one positive integer k such that no graph contains exactly k...
Show that there is only one positive integer k such that no graph contains exactly k spanning trees.
Prove the statement by using definitions and assumptions only: if an integer greater than 4 is...
Prove the statement by using definitions and assumptions only: if an integer greater than 4 is a perfect square then the immediately preceding integer is not prime.
Prove that every natural number is odd or even.
Prove that every natural number is odd or even.
6. Suppose K1 and K2 are compact. Why is K1 ∪ K2 necessarily also compact? (a)...
6. Suppose K1 and K2 are compact. Why is K1 ∪ K2 necessarily also compact? (a) Write a proof of this using the sequential definition. (b) Write a proof of this using the “closed and bounded” definition. (c) Write a proof of this using open covers and subcovers.
Let p be an odd prime and a be any integer which is not congruent to...
Let p be an odd prime and a be any integer which is not congruent to 0 modulo p. Prove that the congruence x 2 ≡ −a 2 (mod p) has solutions if and only if p ≡ 1 (mod 4). Hint: Naturally, you may build your proof on the fact that the statement to be proved is valid for the case a = 1.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT