# Derangement

{{#invoke:Hatnote|hatnote}}

In combinatorial mathematics, a **derangement** is a permutation of the elements of a set such that none of the elements appear in their original position.

The number of derangements of a set of size *n*, usually written *D _{n}*,

*d*, or !

_{n}*n*, is called the "derangement number" or "de Montmort number". (These numbers are generalized to rencontres numbers.) The

**subfactorial**function (not to be confused with the factorial

*n*!) maps

*n*to !

*n*.

^{[1]}No standard notation for subfactorials is agreed upon;

*n*¡ is sometimes used instead of !

*n*.

^{[2]}

The problem of counting derangements was first considered by Pierre Raymond de Montmort^{[3]} in 1708; he solved it in 1713, as did Nicholas Bernoulli at about the same time.

## Example

Suppose that a professor has had 4 of his students – student A, student B, student C, and student D - take a test and wants to let his students grade each other's tests. Of course, no student should grade his or her own test. How many ways could the professor hand the tests back to the students for grading, such that no student received his or her own test back? Out of 24 possible permutations (4!) for handing back the tests, there are only 9 derangements:

- BADC, BCDA, BDAC,
- CADB, CDAB, CDBA,
- DABC, DCAB, DCBA.

In every other permutation of this 4-member set, at least one student gets his or her own test back.

Another version of the problem arises when we ask for the number of ways *n* letters, each addressed to a different person, can be placed in *n* pre-addressed envelopes so that no letter appears in the correctly addressed envelope.

## Counting derangements

Suppose that there are *n* persons numbered 1, 2, ..., *n*. Let there be *n* hats also numbered 1, 2, ..., *n*. We have to find the number of ways in which no one gets the hat having same number as his/her number. Let us assume that the first person takes hat *i*. There are *n* − 1 ways for the first person to make such a choice. There are now two possibilities, depending on whether or not person *i* takes hat 1 in return:

- Person
*i*does not take the hat 1. This case is equivalent to solving the problem with*n*− 1 persons and*n*− 1 hats: each of the remaining*n*− 1 people has precisely 1 forbidden choice from among the remaining*n*− 1 hats (*i'*s forbidden choice is hat 1). - Person
*i*takes the hat 1. Now the problem reduces to*n*− 2 persons and*n*− 2 hats.

From this, the following relation is derived:

where !n, known as the subfactorial, represents the number of derangements, with the starting values !0 = 1 and !1 = 0.

Notice that this same recurrence formula also works for factorials with different starting values. That is 0! = 1, 1! = 1 and

which is helpful in proving the limit relationship with *e* below.

Also, the following formulae are known:^{[4]}

where [*x*] is the nearest integer function.

where is the floor function. The following recurrence relationship also holds:^{[5]}

Starting with *n* = 0, the numbers of derangements of *n* are:

- 1, 0, 1, 2, 9, 44, 265, 1854, 14833, 133496, 1334961, 14684570, 176214841, 2290792932, ... (sequence A000166 in OEIS).

These numbers are also called **subfactorial** or **rencontres numbers**.

Perhaps a more well-known method of counting derangements uses the inclusion-exclusion principle.

## Limit of ratio of derangement to permutation as *n* approaches ∞

Using this recurrence, it can be shown that, in the limit,

This is the limit of the probability *p*_{n} = *d*_{n}/*n*! that a randomly selected permutation is a derangement. The probability converges to this limit extremely quickly as *n* increases, which is why *d*_{n} is the nearest integer to *n*!/*e*. The above semi-log graph shows that the derangement graph lags the permutation graph by an almost constant value.

More information about this calculation and the above limit may be found in the article on the statistics of random permutations.

## Generalizations

The problème des rencontres asks how many permutations of a size-*n* set have exactly *k* fixed points.

Derangements are an example of the wider field of constrained permutations. For example, the *ménage problem* asks if *n* opposite-sex couples are seated man-woman-man-woman-... around a circular table, how many ways can they be seated so that nobody is seated next to his or her partner?

More formally, given sets *A* and *S*, and some sets *U* and *V* of surjections *A* → *S*, we often wish to know the number of pairs of functions (*f*, *g*) such that *f* is in *U* and *g* is in *V*, and for all *a* in *A*, *f*(*a*) ≠ *g*(*a*); in other words, where for each *f* and *g*, there exists a derangement φ of *S* such that *f*(*a*) = φ(*g*(*a*)).

Another generalization is the following problem:

*How many anagrams with no fixed letters of a given word are there?*

For instance, for a word made of only two different letters, say *n* letters A and *m* letters B, the answer is, of course, 1 or 0 according whether *n* = *m* or not, for the only way to form an anagram without fixed letters is to exchange all the *A* with *B*, which is possible if and only if *n* = *m*. In the general case, for a word with *n*_{1} letters *X*_{1}, *n*_{2} letters *X*_{2}, ..., *n*_{r} letters *X*_{r} it turns out (after a proper use of the inclusion-exclusion formula) that the answer has the form:

for a certain sequence of polynomials *P*_{n}, where *P*_{n} has degree *n*. But the above answer for the case *r* = 2 gives an orthogonality relation, whence the *P*_{n}'s are the Laguerre polynomials (up to a sign that is easily decided).^{[6]}

## Computational complexity

It is NP-complete to determine whether a given permutation group (described by a given set of permutations that generate it) contains any derangements.^{[7]}

## References

- ↑ The name "subfactorial" originates with William Allen Whitworth; see {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ Ronald L. Graham, Donald E. Knuth, Oren Patashnik,
*Concrete Mathematics*(1994), Addison–Wesley, Reading MA. ISBN 0-201-55802-5 - ↑ de Montmort, P. R. (1708).
*Essay d'analyse sur les jeux de hazard*. Paris: Jacque Quillau.*Seconde Edition, Revue & augmentée de plusieurs Lettres*. Paris: Jacque Quillau. 1713. - ↑ Hassani, M. "Derangements and Applications." J. Integer Seq. 6, No. 03.1.2, 1–8, 2003
- ↑ See the notes for (sequence A000166 in OEIS).
- ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}. {{#invoke:citation/CS1|citation |CitationClass=citation }}.

## External links

- Template:Cite web
- Template:Cite web
- Template:Cite web
- Template:Cite web
- Template:Cite web
- Template:Cite web

es:Subfactorial fr:Analogues de la factorielle#Sous-factorielle