If `A={a,b,c}`, then the relation `R={(a,b),(b,a)}` is:

If A={a ,\ b ,\ c} , then the relation R={(b ,\ c)} on A is (a) reflexive only (b) symmetric only (c) transitive only (d) reflexive and transitive only

If A={a ,\ b ,\ c ,\ d}, then a relation R={(a ,\ b),\ (b ,\ a),\ (a ,\ a)} on A is (a)symmetric and transitive only (b)reflexive and transitive only (c) symmetric only (d) transitive only

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 integers. Show that the relation R={(a ,\ b): a ,\ b in Z and a+b is even} is an equivalence relation on Zdot

Let A={a , b , c) and the relation R be defined on A as follows: R={(a , a),(b , c),(a , b)}dot Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

Let A={a , b , c) and the relation R be defined on A as follows: R={(a , a),(b , c),(a , b)}dot Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

Let A={a , b , c) and the relation R be defined on A as follows: R={(a , a),(b , c),(a , b)}dot Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

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 Z be the set of all integers and R be the relation on Z defined by R= { (a,b): a, b in Z and (a-b) is divisible by 5} . Prove that R is an equivalence relation

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.