Recall that aderangementof a set is a permutation of having no fixed points, i.e. . If the number of derangements of is , show that

.

Hint :

Spoiler:

Printable View

- February 9th 2010, 01:54 PMBruno J.Number of derangements of n objects
Recall that a

*derangement*of a set is a permutation of having no fixed points, i.e. . If the number of derangements of is , show that

.

Hint :

__Spoiler__:

- February 9th 2010, 02:02 PMwonderboy1953Question
Is the same as ?

- February 9th 2010, 02:03 PMBruno J.
No! is the factorial and is the number of derangements of a set having elements.

- February 9th 2010, 02:15 PMDrexel28
- February 9th 2010, 02:19 PMBruno J.
Haha... well yeah, that would certainly complete your proof! (Giggle)

- February 9th 2010, 02:30 PMPlato
- February 9th 2010, 02:30 PMDrexel28
- February 9th 2010, 02:48 PMBruno J.
- February 9th 2010, 09:02 PMBlack
__Spoiler__: - February 10th 2010, 07:18 AMBruno J.
Good job, Black! You are an impressive new member. (Bow) Are you a university student?

I will post another nice solution later today. - February 10th 2010, 08:16 AMBruno J.
Here is another proof.

First, I prove the statement in the hint that I gave. Consider the exponential generating function

of the sequence . By the basic properties of exponential generating functions, the product of the exponential generating functions of two sequences is the exponential generating function of their binomial convolution. So we have

and so . Extracting the coefficient of on both sides we obtain as required.

Now let us partition the set of permutations of as follows; let denote those permutations which have precisely fixed points, for . Clearly there are ways of picking the elements which are to be fixed, and the remaining elements have to be deranged. So . Since the are clearly distinct we have

because . Now just apply the binomial involution just proved!