Chapter2 - Test Bank
Chapter2 - Test Bank
202. Case 1, x ≥ 0 : then x = |x| , so x ≤ |x| . Case 2, x < 0 : here x < 0 and 0 < |x|, so x < |x|.
203. We prove the statement by cases. The two cases 1 ≤ x ≤ 5 or x ≥ 6 are exhaustive. In the first case, if
1 ≤ x ≤ 5 , then x2 ≤ 25 so x2 6= 27 . In the second case, if x ≥ 6 , then x2 ≥ 36 and x2 6= 27 . So x2 6= 27
for all positive integers x and we conclude that 27 is not a perfect square.
204. It is easier to give a contraposition proof; it is usually easier to proceed from a simple expression (such as n )
to a more complex expression (such as 3n + 5 is even). Begin by supposing that n is not odd. Therefore n
is even and hence n = 2k for some integer k . Therefore 3n + 5 = 3(2k) + 5 = 6k + 5 = 2(3k + 2) + 1 , which
is not even. If we try a direct proof, we assume that 3n + 5 is even; that is, 3n + 5 = 2k for some integer k .
From this we obtain n = (2k − 5)/3 , and it it not obvious from this form that n is even.
205. Prove that (a) and (b) are equivalent and that (a) and (c) are equivalent.
206. If at most three people were born in each of the 12 months of the year, there would be at most 36 people.
207. Give a proof by cases. There are only six cases that need to be considered: x = y = 1; x = 1, y = 2; x = 1,
y = 3; x = 2, y = 1; x = y = 2; x = 2, y = 3.
208. The steps in the “proof” cannot be reversed. Knowing that the squares of two numbers, −3 and 3 , are equal
does not allow us to infer that the two numbers are equal.
54. (c, c) ∈ A × A
In questions 55–62 suppose A = {1, 2, 3, 4, 5} . Mark the statement TRUE or FALSE.
55. {1} ∈ P(A)
56. {{3}} ⊆ P(A)
57. ∅ ⊆ A
58. {∅} ⊆ P(A)
59. ∅ ⊆ P(A)
60. {2, 4} ∈ A × A
61. {∅} ∈ P(A)
62. (1, 1) ∈ A × A
In questions 63–66, suppose the following are multisets:
S = {6 · a, 3 · b, 2 · c, 5 · d},
T = {2 · a, 4 · b, 2 · c}
63. Find S ∪ T .
64. Find S ∩ T .
65. Find S − T .
66. Find S + T .
In questions 67–69 suppose the following are fuzzy sets:
F = {0.7 Ann, 0.1 Bill, 0.8 F ran, 0.3 Olive, 0.5 T om},
R = {0.4 Ann, 0.9 Bill, 0.9 F ran, 0.6 Olive, 0.7 T om}
8.
A B A B
U U
A∩B A∩B
A B A B A B
S
U U U
A B A∪B
9. A ∩ (B ∪ C) ⊆ (A ∩ B) ∪ (A ∩ C) : Let x ∈ A ∩ (B ∪ C) . ∴ x ∈ A and x ∈ B ∪ C, ∴ x ∈ A and x ∈ B , or
x ∈ A and x ∈ C, ∴ x ∈ (A ∩ B) ∪ (A ∩ C) . Reversing the steps gives the opposite containment.
10. Each set has the same values in the element table: the value is 1 if and only if A has the value 1 and either
B or C has the value 1.
11. A ∩ (B ∪ C) = {x | x ∈ A ∩ (B ∪ C)} = {x | x ∈ A ∧ x ∈ (B ∪ C)} = {x | x ∈ A ∧ (x ∈ B ∨ x ∈ C)} = {x |
(x ∈ A ∧ x ∈ B) ∨ (x ∈ A ∧ x ∈ C)} = {x | x ∈ A ∩ B ∨ x ∈ A ∩ C} = {x | x ∈ (A ∩ B) ∪ (A ∩ C)} =
(A ∩ B) ∪ (A ∩ C) .
12.
A A
B C B C
B∪C A ∩ (B ∪ C)
A A A
B C B C B C
A∩B A∩C (A ∩ B) ∪ (A ∩ C)
13. False. For example, let A = {1, 2}, B = {1} , C = {2}.
14. True, using either a membership table or a containment proof, for example.
15. =
16. ⊇
17. =
18. ⊆
19. Yes, {∅, a, {a}, {{a}}} .
20. Yes, {a} .
21. No, it lacks {∅}.
Chapter 2 Test Bank 487
64. {2 · a, 3 · b, 2 · c}
65. {4 · a, 5 · d}
66. {8 · a, 7 · b, 4 · c, 5 · d}
67. F = {0.3 Ann, 0.9 Bill, 0.2 F ran, 0.7 Olive, 0.5 T om} ,
R = {0.6 Ann, 0.1 Bill, 0.1 F ran, 0.4 Olive, 0.3 T om}
68. {0.7 Ann, 0.9 Bill, 0.9 F ran, 0.6 Olive, 0.7 T om}
69. {0.4 Ann, 0.1 Bill, 0.8 F ran, 0.3 Olive, 0.5 T om}
70. True
71. True
72. True
73. False
74. False
75. False
76. True
77. True
78. True
79. True
80. A2 = {(1, 1), (1, a), (a, 1), (a, a)}
81. 7
82. 16
83. Infinite
84. 15