This page uses content from Wikipedia and is licensed under CC BY-SA.

In combinatorial mathematics, a **derangement** is a permutation of the elements of a set, such that no element appears in its original position.
In other words, derangement is a permutation that has no fixed points.

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

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.

Suppose that a professor gave a test to 4 students – A, B, C, and D – and wants to let them 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:

ABCD, ABDC, ACBD, ACDB, ADBC, ADCB, BACD, BADC, BCAD, BCDA, BDAC, BDCA, CABD, CADB, CBAD, CBDA, CDAB, CDBA, DABC, DACB, DBAC, DBCA, DCAB, DCBA.

there are only 9 derangements (shown in blue italics above). In every other permutation of this 4-member set, at least one student gets his or her own test back (shown in bold red).

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.

Suppose that there are *n* people who are 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 the same number as their 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.

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

where is the nearest integer function and 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 the OEIS).

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

A well-known method of counting derangements uses the inclusion–exclusion principle: counting all arrangements, subtracting those that fix at least one element and permute the rest in any way, then adding back those that fix at least two elements, etc.

Factoring out *n*! gives the formula above,

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.

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 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 to 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]}

In particular, for the classical derangements

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]}

**^**The name "subfactorial" originates with William Allen Whitworth; see Cajori, Florian (2011),*A History of Mathematical Notations: Two Volumes in One*, Cosimo, Inc., p. 77, ISBN 9781616405717.**^**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 the OEIS).**^**Even, S.; J. Gillis (1976). "Derangements and Laguerre polynomials".*Mathematical Proceedings of the Cambridge Philosophical Society*.**79**(01): 135–143. doi:10.1017/S0305004100052154. Retrieved 27 December 2011.**^**Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism",*SIAM Journal on Computing*,**10**(1): 11–21, doi:10.1137/0210002, MR 0605600. Babai, László (1995), "Automorphism groups, isomorphism, reconstruction",*Handbook of combinatorics, Vol. 1, 2*(PDF), Amsterdam: Elsevier, pp. 1447–1540, MR 1373683,A surprising result of Anna Lubiw asserts that the following problem is NP-complete: Does a given permutation group have a fixed-point-free element?

.

Look up in Wiktionary, the free dictionary.derangement |

- Baez, John (2003). "Let's get deranged!" (PDF).
- Bogart, Kenneth P.; Doyle, Peter G. (1985). "Non-sexist solution of the ménage problem".
- Dickau, Robert M. "Derangement diagrams".
*Mathematical Figures Using*Mathematica*.* - Hassani, Mehdi. "Derangements and Applications". Journal of Integer Sequences (JIS), Volume 6, Issue 1, Article 03.1.2, 2003.
- Weisstein, Eric W. "Derangement". MathWorld–A Wolfram Web Resource.