Let $A = \{1, 2, 3\}, B = \{1, 3, 5\}$. $A$ relation $R:A \to B$ is defined by $R = \{(1, 3), (1, 5), (2, 1)\}$. Then ${R^{ - 1}}$ is defined by
Let $A = \{1, 2, 3\}, B = \{1, 3, 5\}$. $A$ relation $R:A \to B$ is defined by $R = \{(1, 3), (1, 5), (2, 1)\}$. Then ${R^{ - 1}}$ is defined by
- A
$\{(1,2), (3,1), (1,3), (1,5)\}$
- B
$\{(1, 2), (3, 1), (2, 1)\}$
- C
$\{(1, 2), (5, 1), (3, 1)\}$
- D
None of these
Similar Questions
Let $R_1$ and $R_2$ be two relations on a set $A$ , then choose incorrect statement
Let $R_1$ and $R_2$ be two relations on a set $A$ , then choose incorrect statement
If $\mathrm{R}$ is the smallest equivalence relation on the set $\{1,2,3,4\}$ such that $\{(1,2),(1,3)\} \subset R$, then the number of elements in $\mathrm{R}$ is
If $\mathrm{R}$ is the smallest equivalence relation on the set $\{1,2,3,4\}$ such that $\{(1,2),(1,3)\} \subset R$, then the number of elements in $\mathrm{R}$ is
- [JEE MAIN 2024]
Check whether the relation $R$ in $R$ defined by $S =\left\{(a, b): a \leq b^{3}\right\}$ is reflexive, symmetric or transitive.
Check whether the relation $R$ in $R$ defined by $S =\left\{(a, b): a \leq b^{3}\right\}$ is reflexive, symmetric or transitive.
Let $R$ be a reflexive relation on a finite set $A$ having $n$-elements, and let there be m ordered pairs in $R$. Then
Let $R$ be a reflexive relation on a finite set $A$ having $n$-elements, and let there be m ordered pairs in $R$. Then
Let $A=\{1,2,3\} .$ Then number of equivalence relations containing $(1,2)$ is
Let $A=\{1,2,3\} .$ Then number of equivalence relations containing $(1,2)$ is