Derangement

Revision as of 17:15, 13 November 2006 by Mysmartmouth (talk | contribs)

A derangement is a permutation with no fixed points. A derangement can also be thought of as a permutation in which none of the objects are in their original space. For example, the derangements of $(1,2,3)$ are $(2, 3, 1)$ and $(3, 1, 2)$. The number of derangements of a set of x objects is denoted !x, and is given by the formula:


$\displaystyle !x = x! \sum_{k=1}^{n} \frac{-1^k}{k!}$


This article is a stub. Help us out by expanding it.

Invalid username
Login to AoPS