Discrete Math HW 1.5

You might also like

Download as txt, pdf, or txt
Download as txt, pdf, or txt
You are on page 1of 1

22)

a) Indirect Proof:

So, we can write n as 2k + 1, where k is an integer.


Now, we are given that 3n + 2 is even.
If n is odd, then 2k + 1 is odd as well. The product of an odd number (2k + 1) and
an odd integer (3) will be odd.
Adding 2 to an odd number will result in an odd number.
However, we are given that 3n + 2 is even, which contradicts our assumption that n
is odd.
Therefore, our initial assumption that n is odd must be incorrect. So, n must be
even.

b) Proof by Contradiction:

Assume that n is an integer such that 3n + 2 is even, but n is not even (i.e., n is
odd).
This implies that n can be expressed as n = 2k + 1, where k is an integer.
Now, consider 3n + 2. Since n is odd, we can write it as 2k + 1. So, 3n + 2 can be
written as:

3n + 2 = 3(2k + 1) + 2 = 6k + 3 + 2 = 6k + 5

Now, we have an expression 6k + 5, which represents an odd number (since 6k is


always even, and adding 5 to an even number remains odd).
However, we are given that 3n + 2 is even.
This is a contradiction because we just showed that it must be an odd number.
Therefore, our initial assumption that n is odd must be incorrect, and n must be
even.

24)

To prove that the product of two odd numbers is odd, we can use a direct proof.

Let's assume that we have two odd numbers, which we can represent as follows:
a = 2k + 1
b = 2m + 1

a * b = (2k + 1) * (2m + 1)

Using the distributive property of multiplication over addition, we can expand the
expression:
a * b = 4km + 2k + 2m + 1
Then,
a * b = 2(2km + k + m) + 1

In this form, it's clear that "a * b" is an odd number because it is of the form
"2n + 1," where "n" is an integer.
Therefore, we have shown that the product of two odd numbers, "a" and "b," is also
an odd number.

You might also like