Discrete Math: Lets say B = {1,2,3,4,5,6}. Let R be the smallest equivalence relation on B which has the ordered pairs (1,2) (4,5) (4,6). List all the ordered pairs in R(other than the ones above). Draw the diagraph that represents R.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.7: Relations
Problem 27E: Prove Theorem 1.40: If is an equivalence relation on the nonempty set , then the distinct...
icon
Related questions
Question

Discrete Math:

Lets say B = {1,2,3,4,5,6}. Let R be the smallest equivalence relation on B which has the ordered pairs (1,2) (4,5) (4,6).

List all the ordered pairs in R(other than the ones above). 
Draw the diagraph that represents R. 

Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer