If the number of bijective functions from a set A to set B is 120,the n(A)+n(B) is equal to
Bijective function is both a one-to-one or injective function, and an onto or surjective function. This means that for every function f: A \(\rightarrow\) B, each member a of domain A maps to precisely one unique member b of codomain B.
There are certain features that make a bijective function:
For fn to be bijective , n(A) = n(B) = n and no. of fn are = n! n! = 120
∴ n = 5 ∴ n(A) + n(B) = 10
Let $ A = \{0, 1, 2, 3, 4, 5, 6\} $ and $ R_1 = \{(x, y): \max(x, y) \in \{3, 4 \}$. Consider the two statements:
Statement 1: Total number of elements in $ R_1 $ is 18.
Statement 2: $ R $ is symmetric but not reflexive and transitive.