2024年11月26日 · The derangements of a list of n elements can be computed... A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and {3,1,2}, so !3=2.