A relation R in S={a,b,c} is defined as R={(a,a),(a,b),(b,b),(c,c)} . which element of relation R be removed to make R an equivalence relation?

A relation R in A = {1,2,3} is defined as ? {(1,1),(1,2),(2,2),(3,3)}. Which element(s) of relation R be removed to make R an equivalence relation?

A relation R in S = {1, 2, 3} is defined as R {(1, 1), (1, 2), (2, 2), (3, 3)}. Which element of relation R be removed to make R an equivalence relation

Let A = {a, b, c} andR = {(a, b), (b, c)}. The minimum number of ordered pairs that must be added to R to make it an equivalence relation is

Let A={a,b,c} and R={(a,a),(b,b),(c,c),(b,c),(a,b)} be a relation on A, then R is :

Let R be a relation on A = {a, b, c} such that R = {(a, a), (b, b), (c, c)}, then R is

Let Z be the set of all integers and R be the relation on Z defined as R={(a,b);a,b in Z, and (a-b) is divisible by 5.}. Prove that R is an equivalence relation.

Let a = {a, b, c} and R = {(a, a), (b, b), (c, c), (b, c), (a, b)} be a relation on A, then the