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!\)

Explanation

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.

Study Set theory in ZWMath →

Review the concept: Bijective function

Function \(f\colon A\to B\) that is both injective and surjective, so each element of \(B\) corresponds to exactly one element of \(A\).

\[\forall b\in B\;\exists!\,a\in A\,(f(a)=b)\]

More practice problems: bijective function

← ZW-BIJECTIVE-FUNCTION-009