Q3

MCQMarks unknown

Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$

(A)

Give the expression for $N_r,$ in terms of $n.$

(B)

Give the expression for $N_f,$ terms of $n.$

(C)

Which is larger for all possible $n,N_r$ or $N_f$

Loading…