Skip to content
doubtly

2 answers

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}\).)

Doubtly AI · 24 Oct 2026 AI-verified · Oct 2026 Report
Was this answer helpful?

Your answer

Log in or create a free account to answer this question.