If $R$ is a relation from a finite set $A$ having $m$ elements to a finite set $B$ having $n$ elements, then the number of relations from $A$ to $B$ is
${2^{mn}}$
${2^{mn}} - 1$
$2mn$
${m^n}$
Let $R$ be a relation defined on $N$ as a $R$ b is $2 a+3 b$ is a multiple of $5, a, b \in N$. Then $R$ is
Let $R$ be a relation on the set of all natural numbers given by $\alpha b \Leftrightarrow \alpha$ divides $b^2$.
Which of the following properties does $R$ satisfy?
$I.$ Reflexivity $II.$ Symmetry $III.$ Transitivity
Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.
Let the relations $R_1$ and $R_2$ on the set $\mathrm{X}=\{1,2,3, \ldots, 20\}$ be given by $\mathrm{R}_1=\{(\mathrm{x}, \mathrm{y}): 2 \mathrm{x}-3 \mathrm{y}=2\}$ and $\mathrm{R}_2=\{(\mathrm{x}, \mathrm{y}):-5 \mathrm{x}+4 \mathrm{y}=0\}$. If $\mathrm{M}$ and $\mathrm{N}$ be the minimum number of elements required to be added in $R_1$ and $R_2$, respectively, in order to make the relations symmetric, then $\mathrm{M}+\mathrm{N}$ equals
Let $A$ be a set consisting of $10$ elements. The number of non-empty relations from $A$ to $A$ that are reflexive but not symmetric is