The number of bijective functions from set A to itself when A contains 106 elements is
The number of bijective functions from set A to itself when A contains 106 elements is
(a) 106
(b) (106)2
(c) 106!
(d) 2106
The number of bijective functions from set A to itself when A contains 106 elements is
(a) 106
(b) (106)2
(c) 106!
(d) 2106
Best answer
Answer: (c) 106!
A bijective function from A to itself is a one-one onto mapping, i.e. an arrangement (permutation) of the elements of A.
For a set with \(n\) elements: the first element can be mapped to any of \(n\) elements, the second to any of the remaining \(n-1\), and so on, giving
\[n(n-1)(n-2)\cdots1 = n!\]
With \(n = 106\), the number of bijections is \(106!\).
(For comparison, the total number of functions from A to A is \(106^{106}\).)
Log in or create a free account to answer this question.