CMSC 250 Homework 9 Fall 2001
Due Wed Oct 31 at the beginning of your discussion
section.
You must write the solutions to the problems single-sided on your own lined paper, with all sheets stapled together, and with all answers written in sequential order or you will lose points.
- Let
,
,
.
,
,
. The universal set
. Find the following:
-
-
- Let
.
- Write at least 15 distinct elements of
.
-
. Let
be the set of all three-letter strings over
that start with
or
, end with
or
, and have any letter in the middle so long as all three letters aren't the same.
- Use Venn diagrams to show that the following statements are either true or false. Use two Venn diagrams for each part and show that the two diagrams are equal or different.
-
.
-
.
-
.
- Let
Partition
into subsets based on the number of straight lines it takes to write each of the letters. You may cross lines while drawing the letters, you may not change direction in any way when drawing a straight line.
- Partition the integers from 2 to 20 into a set
consisting of primes and a set
consisting of composites.
- Write the power set for
.
- Prove the following statements using the set identities from chapter 5.2. Assume that
and
are subsets of some universal set
.
- If
, then
.
-
.
- For all finite sets
, let
represent the number of elements in the set
, and let P
denote the power set of
.
Let
,
and
be three finite sets. Let
. Let
, and
,
,
,
, and that
, find
,
, and
.
This document was generated using the
LaTeX2HTML translator Version 99.1 release (March 30, 1999)
Copyright © 1993, 1994, 1995, 1996,
Nikos Drakos,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999,
Ross Moore,
Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -show_section_numbers -split 0 -no_navigation -no_footnode h9
The translation was initiated by John Arras on 2001-10-26
John Arras
2001-10-26