Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = \{1, 2, 3\}$,the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is

Let $R$ be a relation from $A = \{2, 3, 4, 5\}$ to $B = \{3, 6, 7, 10\}$ defined by $R = \{(a, b) \mid a \text{ divides } b, a \in A, b \in B\}$. Then,the number of elements in $R^{-1}$ will be:

Let $M$ denote the 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 $R = \{(a, a)\}$ be a relation on a set $A$. Then $R$ is

On set $A = \{1, 2, 3\}$, relations $R$ and $S$ are given by $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}$ and $S = \{(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)\}$. Then,

Let $R$ be a relation defined on $N \times N$ by $(a, b) R(c, d) \Leftrightarrow a(b + d) = c(b + d)$ is incorrect,the correct relation is $(a, b) R(c, d) \Leftrightarrow ad = bc$. Given the relation $(a, b) R(c, d) \Leftrightarrow a(b + d) = c(a + d)$ is not standard,let us analyze the relation $(a, b) R(c, d) \Leftrightarrow ad = bc$. Then $R$ is: