Math 2.0

Combinatorics Definition

Number of derangements

Definition

The derangement numbers DnD_n, for natural numbers nn, are defined by the recursion D0=1,D1=0,Dn+2=(n+1) (Dn+Dn+1).D_0 = 1, \qquad D_1 = 0, \qquad D_{n+2} = (n + 1)\,(D_n + D_{n+1}).

Remarks

The first values, for n=0,1,…,6n = 0, 1, \dots, 6, are 1,0,1,2,9,44,2651, 0, 1, 2, 9, 44, 265. The value DnD_n is the number of derangements of an nn-element set. The node the derangement numbers count derangements states this. Another notation is !n!n, the subfactorial of nn.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Derangement, Counting derangements
About this page
Tag03WY4HHMT1
URIm2://03WY4HHMT1
Kinddefinition
WritingW0 stub
MSC05A05
DefinesNumber of derangements

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by