Homework 9

Discrete Mathematics 216

6.2 4: A: 𝐴⋃𝐵 ⊆ 𝐵 B: 𝐴⋃𝐵 C: 𝑥 ∈ 𝐵 D: 𝐴 E: Or F: 𝐵 G: 𝐴

H: 𝐵 I: 𝐵

14: Suppose that 𝐴, 𝐵, 𝑎𝑛𝑑 𝐶 are all sets and that 𝐴 ⊆ 𝐵. Let 𝑥 ∈ 𝐴 ∪ C; by the definition of
a union 𝑥 ∈ 𝐴 and 𝑥 ∈ 𝐶. For 𝑥 ∈ 𝐴 under the definition of a subset the it goes that 𝑥 ∈
𝐵. Thus it is true that 𝑥 ∈ 𝐵 ∪ 𝐶 by the definition of a union.

In the case of 𝑥 ∈ 𝐶, for 𝑥 ∈ 𝐵 then it’s also true that 𝑥 ∈ 𝐵 𝑜𝑟 𝑥 ∈ 𝐶. By the definition
of a union 𝑥 ∈ 𝐵 ∪ 𝐶. So then for either case of 𝑥 ∈ 𝐴 or 𝑥 ∈ 𝐶 we get 𝑥 ∈ 𝐵 ∪ 𝐶.
Therefore, in the case of 𝐴 ⊆ 𝐵, 𝐴 ∪ C ⊆ B ∪ C.

6.4 5: Let 𝐵 be the Boolean algebra with the operations of “+” and “*”. Suppose 𝑎 𝑎𝑛𝑑 𝑏 are
any elements of 𝐵. Then:
(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 + (𝑎 ∗ 𝑏)
(𝑎 ∗ 𝑏) + 𝑎 = (𝑎 + 𝑎) ∗ (𝑎 + 𝑏)

As 𝐵 is Boolean algebra, for all 𝑎 in 𝐵, 𝑎 ∗ 𝑎 = 𝑎

(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 ∗ (𝑎 + 𝑏)

(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 ∗ 𝑎 + 𝑎 ∗ 𝑏
(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 ∗ 1 + 𝑎 ∗ 𝑏
(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 ∗ (𝑏 + 1)

As 𝐵 is Boolean algebra, for all 𝑏 in 𝑏 + 1 = 1

(𝑎 ∗ 𝑏) + 𝑎 = 𝑎 ∗ 1 = 𝑎

Therefore, for all 𝑎 and 𝑏 in 𝐵, (𝑎 ∗ 𝑏) + 𝑎 = 𝑎

15: A sentence is a statement if it is either true or false. In this case the sentence in the box
recursively references itself as not the value of itself. This is inherently contradictory and
cannot be clearly represented by a hypothesis, so the sentence is neither true nor false.
Whereas it fails the definition of a statement, this sentence cannot be a statement.

18: A sentence is a statement if it is either true or false. This sentence has the form 𝑎 𝑎𝑛𝑑 𝑏,
as such I will define 𝑎 to be “This sentence is a lie” and 𝑏 to be “1 + 1 = 2.” The
sentence 𝑏 does have a value of TRUE as the mathematic statement 1 + 1 is equal to 2,
but sentence 𝑎 recursively references itself as not the value of itself. This is inherently
contradictory and cannot be clearly represented by a hypothesis, so the sentence is
neither true nor false. Whereas it fails the definition of a statement, this sentence
cannot be a statement. Whereas 𝑎 doesn’t have a definite value we cannot use the 𝑎𝑛𝑑
operator to get a definite value for the sentence as a whole. Therefore, the entire
sentence is not a statement as there is no definite value for the sentence to resolve to.

7.1 2: A: The domain of 𝑔 is 𝑋 = {1,3,5} and the co-domain is 𝑌 = {𝑎, 𝑏, 𝑐, 𝑑}

B: 𝑔(1) = 𝑏, 𝑔(3) = 𝑏, 𝑔(5) = 𝑏

Page 1 of 4
Homework 9
Discrete Mathematics 216

7.1 2: C: The range of 𝑔 is {𝑏}

D: 3 is NOT the inverse image of 𝑎. 1 IS the reverse image of 𝑏.

E: The inverse image of 𝑏 is 1, 3, 𝑜𝑟 5. The inverse image of 𝑐 does not exist.

F: 𝑔 = {(1, 𝑏), (3, 𝑏), (5, 𝑏)}

6b: B: 𝑓(𝑛) = (−1)𝑛 ∗ 2𝑛 for 𝑛 ≥ 0

7: A: 𝐹({1, 3, 4}) = 1

B: 𝐹({Ø}) = 0 as Ø is empty and 0 is even

C: 𝐹({2, 3}) = 0

D: 𝐹({2, 3, 4, 5)} = 0

14: Yes, as shown below for the entire set of 𝑥 ∈ {0,1,2,3,4}, ℎ = 𝑘

𝒙 Value 0 1 2 3 4
𝟑 2 4 0 1 3
𝒉(𝒙) = (𝒙 + 𝟑) 𝒎𝒐𝒅 𝟓
𝒌(𝒙) = (𝒙𝟑 + 𝟒𝒙𝟐 + 𝟐𝒙 + 𝟐) 𝒎𝒐𝒅 𝟓 2 4 0 1 3
4
18: A: log 3 81 = log 3 3 = 4 ∗ log 3 3 = 4

B: log 2 1024 = log 2 210 = 10 ∗ log 2 2 = 10

1
C: log 3 27 = log 3 3−3 = −3 ∗ log 3 3 = −3

D: log 2 1 = 0
1
E: log10 10 = log10 10−1 = −1 ∗ log10 10 = −1

F: log 3 3 = 1

G: log 2 2𝑘 = 𝑘 ∗ log 2 2 = 𝑘

20: Let 𝑏 be any positive real number with 𝑏 ≠ 1. Note that by the definition of a logarithm
log 𝑎 𝑦 = 𝑥 so long that 𝑦 = 𝑎 𝑥 . When we look at 𝑏 0 , which will evaluate to 1 for all 𝑏,
we see that it is in the form of 𝑎 𝑥 with 𝑎 = 𝑏 and 𝑥 = 0. By this relation then log 𝑎 𝑦 = 𝑥
with 𝑎 = 𝑏, 𝑥 = 0 and 𝑦 = 1, by the definition of a logarithm log 𝑏 1 = 0.

28: A: 𝐸(0110) = 000111111000 𝐷(111111000111) = 1101

B: 𝐸(1010) = 111000111000 𝐷(000000111111) = 0011

29: A: 𝐻(10101,00011) = 𝑑(1,0) + 𝑑(0,0) + 𝑑(1,0) + 𝑑(0,1) + 𝑑(1,1) = 3

B: 𝐻(00110,10111) = 𝑑(0,1) + 𝑑(0,0) + 𝑑(1,1) + 𝑑(1,1) + 𝑑(0,1) = 2

Page 2 of 4
Homework 9
Discrete Mathematics 216

7.2 8: A: Where 𝑏 ≠ 𝑐 but 𝐻(𝑏) = 𝐻(𝑐), 𝐻 cannot be one-to-one as different inputs

return the same value.

Whereas the range of 𝐻 = {𝑤, 𝑦} but the co-domain of 𝐻 = {𝑤, 𝑥, 𝑦, 𝑧}, 𝐻

cannot be onto as by definition both range and co-domain must be equal.

B: Where 𝐾(𝑎) ≠ 𝐾(𝑏) ≠ 𝐾(𝑐), 𝐾 is one-to-one as each element of the domain

returns a unique value.

Whereas the range of 𝐾 = {𝑤, 𝑥, 𝑦} but the co-domain of 𝐾 = {𝑤, 𝑥, 𝑦, 𝑧}, 𝐻

cannot be onto as by definition both range and co-domain must be equal.
3𝑥−1
17: 𝑓(𝑥) = 𝑥
∀𝑥 ≠0∈ℝ

Suppose 𝑓 for some 𝑥, 𝑦 ∈ ℝ and 𝑥 ≠ 0, 𝑦 ≠ 0 such that 𝑓(𝑥) = 𝑓(𝑦).

3𝑥−1 3𝑦−1
=
𝑥 𝑦

3𝑥𝑦 − 𝑦 = 3𝑥𝑦 − 𝑥
−𝑦 = −𝑥
𝑥=𝑦
Thus for all 𝑥, 𝑦 ∈ ℝ, 𝑥 = 𝑦 meaning that 𝑓 is one-to-one

19: A: 𝐻𝑎𝑠ℎ(417302072) = 417302072𝑚𝑜𝑑7 = 5; Position 6

B: 𝐻𝑎𝑠ℎ(364981703) = 417302072𝑚𝑜𝑑7 = 2; Position 4

C: 𝐻𝑎𝑠ℎ(283090787) = 283090787𝑚𝑜𝑑7 = 0; Position 1

34: Let 𝑥, 𝑦, 𝑎𝑛𝑑 𝑏 be positive real numbers with 𝑏 ≠ 1. Suppose that log 𝑏 𝑥 = 𝑚 and
log 𝑏 𝑦 = 𝑛. Then by the definition of a logarithm, 𝑏 𝑚 = 𝑥 and 𝑏 𝑛 = 𝑦. So then does
𝑏 𝑚 ∗ 𝑏 𝑛 = 𝑏 𝑚+𝑛 = 𝑥𝑦. It goes then that 𝑚 + 𝑛 = log 𝑏 𝑥𝑦 from this comparison. This
means that log 𝑏 𝑥 + log 𝑏 𝑦 = log 𝑏 𝑥𝑦.

7.3 2: 𝑔 ∘ 𝑓 = 𝑔(𝑓(𝑥)); 𝑔(𝑓(1)) = 𝑔(3) = 1, 𝑔(𝑓(3)) = 𝑔(1) = 1, 𝑔(𝑓(5)) = 𝑔(1)

Therefore we can see that the range of 𝑔 ∘ 𝑓 = {1}

𝑓 ∘ 𝑔 = 𝑓(𝑔(𝑥)); 𝑓(𝑔(1)) = 𝑓(1) = 3, 𝑓(𝑔(3)) = 𝑓(1) = 3, 𝑓(𝑔(5)) = 𝑓(1) = 3

Therefore we can see that the range of 𝑓 ∘ 𝑔 = {3}

Whereas {1} ≠ {3}, 𝑔 ∘ 𝑓 ≠ 𝑓 ∘ 𝑔

2
10: 𝐺 ∘ 𝐺 −1 = 𝐺(𝐺 −1 (𝑥)) = 𝐺(√𝑥)) = (√𝑥) = 𝑥

𝐺 −1 ∘ 𝐺 = 𝐺 −1 (𝐺(𝑥)) = 𝐺 −1 (𝑥 2 ) = √𝑥 2 = 𝑥

So then, whereas 𝐺 ∘ 𝐺 −1 = 𝑥 = 𝐺 −1 ∘ 𝐺, both of these sets are equal.

Page 3 of 4
Homework 9
Discrete Mathematics 216
𝑥+1 𝑥+1+𝑥−1
𝑥+1 +1 2𝑥
11: 𝐻 ∘ 𝐻 −1 = 𝐻(𝐻 −1 (𝑥)) = 𝐻 (𝑥−1) = 𝑥−1
𝑥+1 = 𝑥−1
𝑥+1−𝑥+1 = 2
=𝑥
−1
𝑥−1 𝑥−1

𝑥+1 𝑥+1+𝑥−1
𝑥+1 +1 2𝑥
−1 −1
𝐻 ∘𝐻 =𝐻 (𝐻(𝑥)) = 𝐻 −1 ( ) = 𝑥−1
𝑥+1 = 𝑥−1
𝑥+1−𝑥+1 = =𝑥
𝑥−1 −1 2
𝑥−1 𝑥−1

So then, whereas 𝐻 ∘ 𝐻 −1 = 𝑥 = 𝐻 −1 ∘ 𝐻, both of these sets are equal.

7.4 4: Let 𝑓 be a function such that 𝑓(𝑛) = 2𝑛 for all 𝑛 ∈ 2ℤ.

Let 𝑎, 𝑏 ∈ 2ℤ such that 𝑓(𝑎) = 𝑓(𝑏) → 2𝑎 = 2𝑏 → 𝑎 = 𝑏. Therefore the

function 𝑓 is one-to-one.

Let 𝑦 ∈ ℤ. Then 𝑦 is of the form 𝑦 = 2𝑥 for some 𝑥 in ℤ. Then, for 𝑦 ∈ 2ℤ,

∃𝑥 ∈ 𝕆 such that 𝑓(𝑥) = 2𝑥 = 𝑦. Thus function 𝑓 is onto and there is a one-to-

one correspondence from 𝕆 to ℤ.

20: Case 1: Define a function 𝑓: ℤ → ℤ such that 𝑓(𝑥) = 2𝑥. For this then, 𝑓(𝑥1 ) = 𝑓(𝑥2 ) is
true as 2𝑥1 = 2𝑥2 → 𝑥1 = 𝑥2 which proves that 𝑓 is one-to-one.
𝑥 𝑛
Now, let 𝑛 = 𝑓(𝑥). Then 𝑥 = 𝑓 −1 𝑛 → 𝑥 = 2𝑛 → 𝑛 = 2. Then 𝑓 −1 (𝑛) = 2 ∉ ℤ
and so 𝑓 is not onto.

Case 2: Define a function 𝑔: ℤ → ℤ such that 𝑔(𝑦) = 4𝑦. For this then, 𝑓(𝑦1 ) = 𝑓(𝑦2 ) is
true as 4𝑦1 = 4𝑦2 → 𝑦1 = 𝑦2 which proves that 𝑔 is one-to-one.
𝑦 𝑚
Now, let 𝑚 = 𝑔(𝑦). Then 𝑦 = 𝑔−1 𝑚 → 𝑦 = 2𝑚 → 𝑚 = . 𝑔−1 (𝑚) = ∉ℤ
2 2
and so 𝑚 is not onto.
𝑥, 𝑖𝑓 𝑥 < 0
21: Case 1: Define a function 𝑓: ℤ → ℤ such that 𝑓(𝑥) = { }. For this function
𝑥 − 1, 𝑖𝑓 𝑥 ≥ 0
the entire co-domain has a definition by respect to 𝑓 such that they are unique
such that 𝑓(𝑥) maps to the co-domain for all 𝑥 ∈ ℤ. Thus it is onto.

Now, if we take when 𝑥 = 0 and 𝑥 = −1 we see that 𝑓(0) = −1 = 𝑓(−1). This

means that different elements of 𝑓 have the same image so the function is not
one-to-one.
1 + 𝑥, 𝑖𝑓 𝑥 < 0
Case 2: Define a function 𝑔: ℤ → ℤ such that 𝑔(𝑥) = { }. For this function
1 − 𝑥, 𝑖𝑓 𝑥 ≥ 0
the entire co-domain has a definition by respect to 𝑔 such that they are unique
such that 𝑔(𝑥) maps to the co-domain for all 𝑥 ∈ ℤ. Thus it is onto.

21: Case 2: Now, if we take when 𝑥 = 1 and 𝑥 = −1 we see that 𝑔(1) = 0 = 𝑔(−1). This
means that different elements of 𝑓 have the same image so the function is not
one-to-one.

Page 4 of 4