Combinatorics Basic counting Concept
Derangement
Summary
A derangement is a permutation that moves every element. Derangements answer the classical hat-check problem, and their number is a standard application of inclusion and exclusion. The node derangement gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Derangement, lead section
About this page
| Tag | 0XHWTD3MPV |
|---|---|
| URI | m2://0XHWTD3MPV |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05A05 |
| Specializes | Permutation |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.