Scribd
Upload
291 views2 pages

Derangements

The document discusses derangements, which are permutations where no element remains in its original position. It provides several theorems and formulas for calculating the number of derangements of a set of size n. It also discusses nonconsecutive permutations, where no adjacent elements remain in order, and provides formulas to calculate these. Finally, it discusses surjective functions from one set to another and provides a formula for calculating the number of surjective functions.

Uploaded by

Chatchawan Panraksa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
291 views2 pages

Derangements

The document discusses derangements, which are permutations where no element remains in its original position. It provides several theorems and formulas for calculating the number of derangements of a set of size n. It also discusses nonconsecutive permutations, where no adjacent elements remain in order, and provides formulas to calculate these. Finally, it discusses surjective functions from one set to another and provides a formula for calculating the number of surjective functions.

Uploaded by

Chatchawan Panraksa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Derangements

October 29, 2008

A permutation i1 i2 . . . in of {1, 2, . . . , n} is called a derangement if ik 6= k for any


1 ≤ k ≤ n (no number remains in its position).
Theorem 1. For n ≥ 1, the number Dn of derangements of {1, 2, . . . , n} is given by
1 1 1 1
Dn = n!(1 − + − + · · · + (−1)n ).
1! 2! 3! n!
Corollary 2. limn→∞ Dn!n = e−1 .
Here are a few derangement numbers:

D1 = 0, D2 = 1, D3 = 2, D4 = 9, D5 = 44, D6 = 265.

Proposition 3. The derangement sequence Dn satisfies the recurrence relation

Dn = (n − 1)(Dn−1 + Dn−2 ), n≥3

with the initial condition D1 = 0, D2 = 1.


Proposition 4. The derangement sequence Dn satisfies the recurrence relation

Dn = nDn−1 + (−1)n , n≥2

with the initial condition D1 = 0.

Problems
1. How many ways can a hatcheck girl hand back the n hats of n gentlemen, one to
each gentleman, with no man gettnig his hat?

2. Determine the number of permutations of {1, 2, . . . , n} in which no even integer is


in its natural position.

3. Determine the number of permutations of {1, 2, . . . , n} with exactly k numbers


displaced.

1
Nonconsecutive permutations
A permutation of {1, 2, . . . , n} is called nonconsecutive if none of 12, 23, . . . , (n − 1)n
occurs.
Theorem 5. For n ≥ 1, the number Qn of nonconsecutive permutations of {1, 2, . . . , n}
is given by
n−1  
k n−1
X
Qn = (−1) (n − k)!
k=0
k
Proposition 6. For n ≥ 2,

Qn = Dn + Dn−1 .
A circular permutation of {1, 2, . . . , n} is called nonconsecutive if none of 12, 23, . . . , (n−
1)n, n1 occurs.
Theorem 7. For n ≥ 1, the number Cn of nonconsecutive circular permutations of
{1, 2, . . . , n} is given by
n−1  
k n
X
Cn = (−1) (n − k − 1)! + (−1)n
k=0
k

Problems
1. n camels march in the desert in a caravan. Their journey is very uneventful, and the
camels are tired of always watching the same animals in front of them. Therefore
their owner wants to rearrange them so that every camel has a different camel in
front of it (the position of the original first camel is arbitrary). How many possible
rearrangements are there?
2. How many ways are there for 8 children on a merry-go-round to change places so
that somebody new is in front of each child? (The horses are indistinguishable and
in a circle.)

Surjective Functions
Let X be a set with m objects and let Y be a set with n objects.
The number of all functions from X to Y equals nm .
n

The number of injective functions from X to Y equals m m! = P (n, m).
Theorem 8. The number S(m, n) of surjective functions from X to Y is given by
n  
k n
X
S(m, n) = (−1) (n − k)m .
k
k=0
  n  
X m X
k n
= (−1) (n − k)m .
i1 +i2 +···+in =m,i1 ,i2 ,...,in ≥1
i1 , i2 , . . . , in k=0
k

You might also like