Exercise · ZW-BIJECTIVE-FUNCTION-010 · ★★☆ Intermediate
How many bijections are there from a set \(A\) with \(n\) elements to itself?
Choose one option.
Show answer
- A. \(n!\)
Exercise · ZW-BIJECTIVE-FUNCTION-010 · ★★☆ Intermediate
Choose one option.
A bijection from \(A\) to itself is a permutation of its elements. Choosing the image of each element leaves \(n\), \(n-1\), \(\dots\), 1 options without repetition, giving \(n!\). \(2^n\) counts the subsets of \(A\), while \(n\) and \(n^2\) do not count permutations.
Function \(f\colon A\to B\) that is both injective and surjective, so each element of \(B\) corresponds to exactly one element of \(A\).