Rosen, Discrete Mathematics and Its Applications, 6th Edition Extra Examples
Rosen, Discrete Mathematics and Its Applications, 6th Edition Extra Examples
1
We can write this set in set-builder notation by specifying the property that the elements must have: each
x satisfies x ≥ 1 and x ≤ 99. Therefore, we can write this set as { x | x ∈ N, 1 ≤ x ≤ 99 }.
We can also write the set as { y | y ∈ N, 1 ≤ y ≤ 99 }. You can name the variable however you wish, but
you must use the same letter to name the general element as you use in the description of the property.
The same set can also be written as { x | x ∈ Z, 1 ≤ x ≤ 99 }, using Z instead of N, because the property
restricts membership to the same collection of integers.
We can also write the set as { x | x ∈ N, 0 < x < 100 }, { x | x a positive integer with one or two digits }, or
{ x | x a positive integer less than 100 } by altering the property or by describing the property in English.
See Solution
Solution:
The integers in S are the even integers beginning with 2 and ending with 64. We can write S = {2, 4, 6, 8, . . . , 64},
S = {2, 4, 6, . . . , 64}, or S = {2, 4, 6, . . . , 62, 64}, for example. Note than writing S = {2, 4, . . . , 64} would
not be wise because the pattern in the list is not obvious — it could be 2, 4, 8, 16, 32, 64.
See Solution
Solution:
(a) The ellipsis indicates that the pattern continues forever, so the set is infinite.
(b) The set consists of the first 300 odd positive integers, stopping at 599. Therefore the set is finite.
(c) The equation can be rewritten as 3x + 3 = 3x + 3; hence all real numbers are solutions. The set is
therefore infinite.
(d) The number is quite large, but the number of possibilities is still finite.
(e) There are no real numbers that are solutions to this equation. Therefore the set is empty, that is, it has
size zero, and hence is finite.
(f) The polynomial factors as (x − 7)(x − 2). This product is positive if x > 7 or x < 2, and is negative if
2 < x < 7. Therefore, the set is finite — it is equal to {3, 4, 5, 6}.
2
p.116, icon at Example 13
#1. Let S = {∅, a, {a}}. Determine whether each of these is an element of S, a subset of S, neither, or
both.
(a) {a}
(b) {{a}}
(c) ∅
(d) {{∅}, a}
(e) {∅}
(f) {∅, a}
See Solution
Solution:
(a) {a} is the third element in the list of elements of S. Therefore {a} ∈ S. The set {a} is also a subset
of S: {a} has one element, a, which is also an element of S.
(b) {{a}} is not an element of S, because it does not appear in the list of elements of S. However {{a}} ⊆ S
because every element of {{a}} belongs to S. (The only element of {{a}} is {a}, which is an element of S.)
(c) ∅ ∈ S (it is the first element in the list for S) and ∅ ⊆ S (the empty set is a subset of all sets).
(d) {{∅}, a} is neither a subset of S nor an element of S. It is not a subset of S because {∅} is not an
element of S; it is not an element of S because it does not appear in the list of elements of S.
(e) {∅} ⊆ S. The set {∅} has one element, ∅, which is the first element in the list for S. However, {∅} is
not an element of S.
(f) {∅, a} ⊆ S. The set {∅, a} has two elements, each of which is an element of S. However {∅, a} is not an
element of S because it is not one of the three elements in the list for S.
3
#3. Suppose that A and B are sets such that P(A ∪ B) ⊆ P(A) ∪ P(B). Prove that A ⊆ B or B ⊆ A.
See Solution
Solution:
We give a proof by contraposition. That is, we will give a direct proof of the following: If A ⊆ B and B ⊆ A
are false, then P(A ∪ B) ⊆ P(A) ∪ P(B) is false.
Suppose A ⊆ B and B ⊆ A are false. Then there is an element a ∈ A − B and an element b ∈ B − A.
Consider the set S = {a, b}. Then S ⊆ A ∪ B, but S is not a subset of A and S is not a subset of B.
Therefore, S ∈ P(A ∪ B) but S ∈
/ P(A) and S ∈
/ P(B).