23666: HW 6
From Classes
Problem 26. Consider the following equivalence relation on the set A={1,2,3,4,5,6}: R={(1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(1,2),(1,4),(2,1),(2,4),(4,1),(4,2),(3,6),(6,3)}.
Find the partition generated by R.
Problem 27. Let R be a relation on N defined by (p,q)∈R⇔p2+q2 is even.
- Show that R is an equivalence relation.
- Find all distinct equivalence classes of this relation.
Problem 28. Define a relation R on N by: xRy if x and y have the same prime divisors. (For example, 6R12.)
- Show that R is an equivalence relation.
- Find the partition generated by R.
Problem 29. A relation R on a non-empty set X is called reverse-transitive if (a,b)∈R∧(b,c)∈R⇒(c,a)∈R for all a,b,c∈X.
Show that a relation R on a non-empty set X is an equivalence relation if and only if it is reflexive and reverse-transitive.