Skip to main contentSkip to solution

The number of all onto functions from the set {1, 2, .......n} to itself is

Solution

✅ Correct Option: 3

When the domain and codomain are the same finite set with nn elements, an onto function is necessarily a bijection. The number of bijections from a set of nn elements to itself is n!n!.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question