# For the set A = {1, 2, 3}, define a relation R on the set A as follows:R = {(1, 1), (2, 2), (3, 3), (1, 3)}Write the ordered pairs to be added to R to make the smallest equivalence relation.

Given set A = {1, 2, 3} and relation R = {(1, 1), (2, 2), (3, 3), (1, 3)}

A relation is an equivalence relation if and only if it is reflexive, symmetric and transitive.

R = {(1, 1), (2, 2), (3, 3), (1, 3)} is reflexive and transitive but not symmetric.

If (3,1) is added to the ordered pairs, R will become symmetric.

Thus the new R:

R = {(1, 1), (2, 2), (3, 3), (1, 3),(3,1)} is the obtained smallest equivalence relation.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos
Functions - 0152 mins
Some standard real functions61 mins
Range of Functions58 mins
Quick Revision of Types of Relations59 mins
Functions - 0648 mins
Functions - 1156 mins
Battle of Graphs | various functions & their Graphs48 mins
Functions - 0947 mins
Quick Recap lecture of important graphs & functions58 mins