0% found this document useful (0 votes)
24 views

Homework 2

This document contains solutions to homework problems 1.27 through 1.43 from a class. Problem 1.27 defines sets of numbers. Problem 1.28 defines intervals and unions of sets. Problem 1.29 finds the smallest set of letters whose union is all letters, avoiding overlap. Problems 1.32, 1.34, and 1.43 solve other set theory problems involving partitions, subsets, and Cartesian products.

Uploaded by

Preston Lee
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views

Homework 2

This document contains solutions to homework problems 1.27 through 1.43 from a class. Problem 1.27 defines sets of numbers. Problem 1.28 defines intervals and unions of sets. Problem 1.29 finds the smallest set of letters whose union is all letters, avoiding overlap. Problems 1.32, 1.34, and 1.43 solve other set theory problems involving partitions, subsets, and Cartesian products.

Uploaded by

Preston Lee
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Homework 2

Preston Lee
January 8, 2015

Problem 1.27.
S T
x∈S X = {0, 1, 2, 3, 4, 5}; x∈S X = {2}

Problem 1.28.
Define Sr to be the interval [ r − 1, r + 2]
S = {1, 3, 4}
A
Tα∈A Sα = {0, 1, 2, 3, 4, 5, 6}
α∈A Sα = {3}

Problem 1.29.
S
For this problem, the subset S of A with the smallest cardinality such that α∈S Aα = A
is a set of every third letter:
S = {a, d, g, j, m, p, s, v, y}
A set of every other letter would also satisfy the first property, but some of the elements
in the Sα subsets would overlap as a result of a higher cardinality. With every third letter,
there is no overlap. On the other hand, a set of every fourth letter, though it has a smaller
cardinality, would miss letters.
Problem 1.32.
a Is a partition
b Not a partition. The union of all the sets in S2 does not contain g.
c Is a partition
d Not a partition. On of the elements is the empty set
e Not a partition. Sets are not pairwise disjoint (b appears multiple times)
Problem 1.34.
S = {{1,2},{3,4},{5,6}}
Problem 1.43.
P(A) = {∅, {a}, {b}, {a, b}}
A × P(A) = {( a, ∅) , ( a, {a}) , ( a, {b}) , ( a, {a, b}) , ( b, ∅) , ( b, {a}) , ( b, {b}) , ( b, {a, b}) }

You might also like