CMSC 250 Fall 2004 -- Homework 14
Due Never 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.
- In the following, the relation
is an equivalent relation on the set
.
Find the distinct equivalence classes of
.
and
.
is defined on
as follows:
For all sets
and
in
,
is the set of all strings of length 2 in 0's, 1's, and 2's.
is defined on
as follows:
For all strings
and
in
,
- Let
be the set of all points in the Cartesian plane except the origin.
is the relation defined as follows:
For all
and
in
,
Proof that the relation is and equivalence relation, and describe the distinct equivalence classes.
- Let
be a binary relation on a set
and suppose
is symmetric and transitive. Prove the following:
If for every
in
there is a
in
such that
, then
is an equivalence relation.
- For each of the following either prove that it is a partial order relation or indicate why it is not a partial order relation.
- Define a relation
on the set
of all integers as follows: For all
,
- Define a relation
on the set
of all real numbers as follows: For all
,
- Let
, and let
be the relation
Is
a total order on
? justify your answer.
- Define each of the following as it pertains to a graph
- Path
- Simple Circuit
- Circuit
- Euler Circuit
- Hamiltonian Circuit
Kin-Keung Ma
2004-12-07
Web Accessibility