Let $R = \{(1, 3), (2, 2), (3, 2)\}$ and $S = \{(2, 1), (3, 2), (2, 3)\}$ be two relations on set $A = \{1, 2, 3\}$. Then $RoS =$

The probability that a relation $R$ from $\{ x , y \}$ to $\{ x , y \}$ is both symmetric and transitive, is equal to

Let $I$ be the set of positve integers. $R$ is a relation on the set $I$ given by $R =\left\{ {\left( {a,b} \right) \in I \times I\,|\,\,{{\log }_2}\left( {\frac{a}{b}} \right)} \right.$ is a non-negative integer$\}$, then $R$ is 

Let $M$ denotes set of all $3 \times 3$ non singular matrices. Define the relation $R$ by

$R = \{ (A,B) \in M \times M$ : $AB = BA\} ,$ then $R$ is-

Let $\mathrm{A}=\{1,2,3,4,5\}$. Let $\mathrm{R}$ be a relation on $\mathrm{A}$ defined by $x R y$ if and only if $4 x \leq 5 y$. Let $m$ be the number of elements in $\mathrm{R}$ and $\mathrm{n}$ be the minimum number of elements from $\mathrm{A} \times \mathrm{A}$ that are required to be added to $\mathrm{R}$ to make it a symmetric relation. Then $m+n$ is equal to:

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is