Let $n(A) = n$. Then the number of all relations on $A$ is

  • A

    ${2^n}$

  • B

    ${2^{(n)!}}$

  • C

    ${2^{{n^2}}}$

  • D

    None of these

Similar Questions

Maximum number of equivalence relations on set $A = \{1, 2, 3, 4\}$ is $N$, then -

Let $S$ be the set of all real numbers. Then the relation $R = \{(a, b) : 1 + ab > 0\}$ on $S$ is

The relation $R$ defined in $N$ as $aRb \Leftrightarrow b$ is divisible by $a$ is

Let $X =\{1,2,3,4,5,6,7,8,9\} .$ Let $R _{1}$ be a relation in $X$ given by $R _{1}=\{(x, y): x-y$ is divisible by $3\}$ and $R _{2}$ be another relation on $X$ given by ${R_2} = \{ (x,y):\{ x,y\}  \subset \{ 1,4,7\} \} $ or $\{x, y\} \subset\{2,5,8\} $ or $\{x, y\} \subset\{3,6,9\}\} .$ Show that $R _{1}= R _{2}$.

Show that the relation $R$ in the set $\{1,2,3\}$ given by $R =\{(1,1),\,(2,2),$ $(3,3)$, $(1,2)$, $(2,3)\}$ is reflexive but neither symmetric nor transitive.