Category:Derangements

From ProofWiki
Jump to navigation Jump to search

This category contains results about Derangements.
Definitions specific to this category can be found in Definitions/Derangements.

A derangement is a permutation $f: S \to S$ from a set $S$ to itself where:

$\forall s \in S: \map f s \ne s$

That is, a permutation with no fixed points.


If $S$ is finite, the number of derangements is denoted by $D_n$ or $d_n$, where $n = \card S$ (the cardinality of $S$.)

Subcategories

This category has the following 4 subcategories, out of 4 total.