The number of derangements of small lengths is given in the table below.

The number of derangements of an n-element set (sequence A000166 in the OEIS) for small n

n 0 1 2 3 4 5 6 7 8 9 10 11 12 13

! 4 26 1,85 14,83 133,49 1,334,96 14,684,57 176,214,84 2,290,792,93

1 0 1 2 9
n 4 5 4 3 6 1 0 1 2

There are various other expressions for !n, equivalent to the formula given above. These include
 for 
and
 for 

where  is the nearest integer function and  is the floor function.[3][6]

Other related formulas include[7]
and
The following recurrence also holds: [6]
Derivation by inclusion–exclusion principle[edit]
One may derive a non-recursive formula for the number of derangements of
an n-set, as well. For  we define  to be the set of permutations of n objects
that fix the -th object. Any intersection of a collection of i of these sets fixes
a particular set of i objects and therefore contains  permutations. There
are  such collections, so the inclusion–exclusion principle yields
and since a derangement is a permutation that leaves none of
the n objects fixed, this implies

Growth of number of derangements

as n approaches ∞[edit]
From
and
by substituting  one immediately obtains that
This is the limit of the probability that a randomly
selected permutation of a large number of objects is a
derangement. The probability converges to this limit
extremely quickly as n increases, which is why !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.
Asymptotic expansion in terms of Bell
numbers[edit]
An asymptotic expansion for the number
of derangements in terms of Bell numbers is as
follows:
where  is any fixed positive integer, and  denotes
the -th Bell number. Moreover, the constant
implied by the big O-term does not exceed .[8]

Generalizations[edit]
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 n1 letters X1, n2 letters X2, ..., nr letters Xr it
turns out (after a proper use of the inclusion-
exclusion formula) that the answer has the
form:
for a certain sequence of polynomials Pn,
where Pn has degree n. But the above
answer for the case r = 2 gives an
orthogonality relation, whence the Pn's are
the Laguerre polynomials (up to a sign that
is easily decided).[9]

 in the complex plane.

In particular, for the classical

derangements

Computational
complexity[edit]
It is NP-complete to determine
whether a given permutation
group (described by a given set of
permutations that generate it) contains
any derangements.[10]

References[edit]
1. ^ 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  978161640
5717.
2. ^ Ronald L. Graham,
Donald E. Knuth, Oren
Patashnik, Concrete
Mathematics (1994),
Addison–Wesley,
Reading MA. ISBN 0-
201-55802-5
3. ^ Jump up to:a b Hassani,
M. "Derangements and
Applications." J. Integer
 Seq. 6, No. 03.1.2, 1–8,
2003
4. ^ 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.
5. ^ Scoville, Richard
(1966). "The Hat-Check
Problem".  American
Mathematical
Monthly.  73  (3): 262–
265.  doi:10.2307/23153
37.  JSTOR  2315337.
6. ^ Jump up
to:a b c Stanley,
Richard (2012).  Enumer
ative Combinatorics,
volume 1 (2 ed.).
Cambridge University
Press. Example
2.2.1.  ISBN  978-1-107-
60262-5.
7. ^ Weisstein, Eric
W.  "Subfactorial".  Math
World.
8. ^ Hassani, M.
"Derangements and
Alternating Sum of
Permutations by
Integration." J. Integer
Seq. 23, Article 20.7.8,
1–9, 2020
9. ^ Even, S.; J. Gillis
(1976).  "Derangements
and Laguerre
polynomials".  Mathemati
cal Proceedings of the
Cambridge
Philosophical
Society.  79  (1): 135–
143.  doi:10.1017/S0305
004100052154.
Retrieved 27
December 2011.
10. ^ Lubiw, Anna  (1981),
"Some NP-complete
problems similar to
graph
isomorphism", SIAM
Journal on
Computing,  10  (1): 11–
21,  doi:10.1137/021000
2, MR  0605600. Babai,
 László (1995),
"Automorphism groups,
isomorphism,
reconstruction",  Handbo
ok 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?.

External links[edit]

Look up derangement in Wiktionary, the

free dictionary.

 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.
Categories: 
 Permutations
 Fixed points (mathematics)