Handouts on SETS, CROSS PRODUCT and COUNTING:
Sets homework: HOMEWORK Fall 2002 Due on Friday, March 1st.
- Page 137 : #4, #8
Here are the HW
SOLUTIONS. Utilize them.
- Page 150 : #4, #8
- Page 156 : #4, #6, #8
- Page 160 : #6, #20
- Sets, 3 ways to describe a set, etc.
- Sets, Cardinality, Subset, Proper
Subset, Power Set, etc.
-
Sets, Cartesian Product (Cross Product) and
subsets of ...
-
Sets, F*R*I*E*N*D*S who went to same high
school, principle
of inclusion/exclusion and counting overlapping sets. Review of Cross
Product with an
example binary relation on FRIENDS cast. Reflexive and Symmetric binary
relations
preview.
- Here is a Ghostbuster's problem from section 3.3 of the textbook. We
will go over this problem on Tuesday (Wednesday).
- Overhead slide one with two questions.
How many tools are shared by Dr. Peter Venkman and Dr. Egon Spengler is
answered here
- Overhead slide two with Venn diagram and
answer to the 2nd question. How many tools does Dr. Egon Spengler
use and never share with Dr. Peter Venkman or Dr. Raymond
Stantz?
- Here is the first page of an old exam from November of 1999. You are
ready for many of the problems. The Ghostbusters problem (#1) and
PowerSet problems (#2 and #3) and the draw the graph problem (#10) are of
special interest as of October 19th.
-
November 19th, 1999 exam, 1st page
key.
-
Ghostbusters counting problem
illustrated solution. The principle of inclusion/exclusion problem solving
method is shown, along with a Venn diagram for specific subproblem
components.
- October 18th, 1999 exam, page 1 with
Ghostbusters counting problem (principle of inclusion/exclusion), as
well as a proof that the sum of two odd integers has to be an even
integer.