CS F222 Tutorial2
CS F222 Tutorial2
Tutorial - 2
Problem 1.7.39:
Prove that at least one of the real numbers a1 , a2 , . . . , an is greater than or equal to the
average of these numbers. What kind of proof did you use?
Problem 1.8.7:
Prove the triangle inequality, which states that if x and y are real numbers, then
|x| + |y| ≥ |x + y|.
Problem 2.1.10:
Determine whether these statements are true or false.
(a) ∅ ∈ {∅}
(b) ∅ ∈ {∅, {∅}}
(c) {∅} ∈ {∅}
(d) {∅} ∈ {{∅}}
(e) {∅} ⊆ {∅, {∅}}
(f) {{∅}} ⊆ {∅, {∅}}
(g) {{∅}} ⊆ {{∅}, {∅}}
Problem 2.1.39:
Are A × B × C and (A × B) × C the same? Why?
Problem 2.2.15:
Prove the second De Morgan’s law by showing that if A and B are sets, then:
A∪B =A∩B
1. by showing each side is a subset of the other side.
2. using a membership table.
1
Problem 2.2.18:
Let A, B, and C be sets. Show that:
1. (A ∪ B) ⊆ (A ∪ B ∪ C)
2. (A ∩ B ∩ C) ⊆ (A ∩ B)
3. (A − B) − C ⊆ A − C
4. (A − C) ∩ (C − B) = ∅
5. (B − A) ∪ (C − A) = (B ∪ C) − A
Problem 2.2.29:
What can you say about the sets A and B if we know that:
1. A ∪ B = A
2. A ∩ B = A
3. A − B = A
4. A ∩ B = B ∩ A
5. A − B = B − A
Problem 2.3.12:
Determine which of these functions from Z to Z is one-to-one and onto.
1. f (n) = n − 1
2. f (n) = n2 + 1
3. f (n) = n3
4. f (n) = n2
Problem 2.5.3:
Determine whether each of these sets is countable or uncountable. For those that are
countably infinite, exhibit a one-to-one correspondence between the set of positive integers
and that set.
1. all bit strings not containing the bit 0.
2. all positive rational numbers that cannot be written with denominators less than 4.
3. the real numbers not containing 0 in their decimal representation.
4. the real numbers containing only a finite number of 1s in their decimal representation.