Discrete Structures

Homework 3.4

FVCproductions
Fall 2014

1. In Exercises 18, determine whether the given relation is an equivalence

relation on {1, 2, 3, 4, 5}. If the relation is an equivalence relation, list the
equivalence classes. (In Exercises 58, x, y {1, 2, 3, 4, 5}.)
{(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (1, 3), (3, 1)}

So [1] = {1,3}. Then that means [2] = {2} and [3] = {1,3} which we know is [1]. Then [4] =
{4}. And finally [5] = {5}.

4. In Exercises 18, determine whether the given relation is an equivalence

relation on {1, 2, 3, 4, 5}. If the relation is an equivalence relation, list the
equivalence classes. (In Exercises 58, x, y {1, 2, 3, 4, 5}.)
{(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (1, 5), (5, 1), (3, 5), (5, 3), (1, 3), (3, 1)}

Okay so [1] = {1,3,5}. Then that means [2] = {2}, [3] = {1,3,5} which we know is [1]. And 4
= {4}, [5] = {1,3,5} = [1] = [3].

7. In Exercises 18, determine whether the given relation is an equivalence

relation on {1, 2, 3, 4, 5}. If the relation is an equivalence relation, list the
equivalence classes. (In Exercises 58, x, y {1, 2, 3, 4, 5}.)
{(x, y) | 3 divides x + y}

! of 3
1
!

Discrete Structures
Homework 3.4

FVCproductions
Fall 2014

So we have to prove this relation is reflexive, symmetric, and transitive in order for the
relation to be an equivalence relation.

If x is a random integer in the relation, then x + x = 2x which isnt divisible by 3 because its
event. So (x,x) isnt going to be in the relation, and therefore it is NOT reflexive. For (x, y) in
the relation, (y,x) has to be in the relation as well for it to be symmetric. (x+y) is divisible by
3 so that means (y+x) is too and the relation is symmetric. Finally, if there is an (x,y), (y,z),
and (x,z) in the relation, then it is transitive. Well make (x,y) = (1,2) for this relation, then we
can make (2,4) the (y,z). But theres no (x,z) or (1,4) so the relation is not transitive.

Because this relation is not reflexive or transitive, this relation is not an equivalence relation.

18. In Exercises 1520, list the members of the equivalence relation on {1, 2, 3, 4}
defined (as in Theorem 3.4.1) by the given partition. Also, find the equivalence
classes [1], [2], [3], and [4].
{{1, 2, 3},{4}}

Okay so we have [1] = {1,2,3}.

Then we can know that [2] = {1,2,3} which we know is [1], [3] = {1,2,3} which we know is
[1] and [2], and [4] = {4}.
So the first equivalence class is [1] = [2] = [3] = {1,2,3} and the second class is [4] = {4}.
! of 3
2
!

Discrete Structures
Homework 3.4

FVCproductions
Fall 2014

22. In Exercises 2123, let X={1, 2, 3, 4, 5}, Y ={3, 4}, and C={1, 3}. Define the
relation R on P( X), the set of all subsets of X, as A R B if A Y = B Y.
List the elements of [C], the equivalence class containing C.

Okay so C B = {1,3} {3,4} = {1,3,4} = Z Y.

Z then must be {1,3,4}. Itll have 1 in it and can have numbers from 3 and/or 4.
So [C] = { {1} , {1,3} , {1,4}, {1,3,4} }

! of 3
3
!