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

  • A

    ${2^{mn}}$

  • B

    ${2^{mn}} - 1$

  • C

    $2mn$

  • D

    ${m^n}$

Similar Questions

Check whether the relation $R$ defined in the set $\{1,2,3,4,5,6\}$ as $R =\{(a, b): b=a+1\}$ is reflexive, symmetric or transitive.

Give an example of a relation. Which is Reflexive and transitive but not symmetric.

Show that the relation $R$ in the set $A$ of all the books in a library of a college, given by $R =\{(x, y): x $  and $y$ have same number of pages $\}$ is an equivalence relation.

$A$ relation $R$ is defined from $\{2, 3, 4, 5\}$ to $\{3, 6, 7, 10\}$ by $xRy \Leftrightarrow x$ is relatively prime to $y$. Then domain of $R$ is

Let $R$ be a relation on the set $N$ of natural numbers defined by $nRm $$\Leftrightarrow$ $n$ is a factor of $m$ (i.e.,$ n|m$). Then $R$ is