*/SETS /**/AND/**/ COUNTING PRINCIPLES/*
1)
Describe what a set is and how sets are denoted.
2)
Give examples of collections that are sets.
3)
Give examples of collections that are not sets.
4)
Describe empty sets, the associated symbols, and give examples of
empty sets.
5)
Describe subsets and give examples.
6)
Define the cardinality of a set, its symbolic form, and give examples.
7)
Define power set and its cardinality.
8)
Write the members of the power set of the sets (i.e., list all
possible subsets of):
a)
{A, B}
b)
{A, B, C}
c)
{A, B, C, D}
d)
{A, B, C, D, E}
Do part d) for HW.
Results published online.
SUBSETS:
f, {A}, {B}, {C}, {D}, {E}, {A,B}, {A,C}, {A,D},
{A,E}, {B,C},
{B,D}, {B,E}, {C,D}, {C,E}, {D,E}, {A,B,C}, {A,B,D}, {A,B,E},
{A,C,D},
{A,C,E), {A,D,E}, {B,C,D}, {B,C,E}, {B,D,E}, {C,D,E}, {A,B,C,D},
{A,B,C,E}, {A,B,D,E}, {A,C,D,E}, {B,C,D,E}, {A,B,C,D,E}.
There are _
subsets.
9)
Fundamental multiplication principle of mathematics
a)
AN EXAMPLE:
Consider the sets E = {a, b, c} and F = {1, 2}.
Write out all possible pairs of elements in such a way that the first
element is from set E and the second element is from set F.
Construct a
tree diagram and a matrix.
TREE
DIAGRAM
ORDERED PAIRS