Counting and combinatorics
Derangements
Counts the permutations that fix nothing – the hat-check problem and its many disguises.
Where
- About 36.8%, and essentially exact from .
Assumptions
- Derived by inclusion–exclusion over which items are fixed.
Sanity check. out of 120, which is 36.7% – already within 0.002 of the limit.
Where this is taught
- Inclusion–exclusion, derangements and the pigeonhole · COMB · Inclusion–exclusion and invariants