MAS 219

Assignment 4

Combinatorics
For handing in on 24 October 2007

Write your name and student number at the top of your assignment before handing it in. Staple all the pages together. Post the assignment in the RED post-box on the 2nd oor of the Maths building before 16:30 on Wednesday. 1 You are standing at the point (0, 0) in the plane, and you wish to reach the point (2n, 0). In one move you are allowed to go from (x, y) to either (x + 1, y + 1) or (x + 1, y 1): that is, one step in the north-east or south-east direction. However, you are not allowed to visit any point below the X-axis, that is, all points on the path have non-negative y-coordinate. The two possible paths for n = 2 are shown in the picture.
r r r  d d dr r r r r d  d dr r r r r r r r r r r r r r r r r  d  d d d dr dr r r r

(0, 0)

(4, 0) (0, 0)

(4, 0)

Let F(n) be the number of such walks, and let G(n) be the number of walks which do not touch the X-axis except at the start and end. The picture shows F(2) = 2 and G(2) = 1. (a) Show by drawing diagrams that F(3) = 5 and G(3) = 2. (b) By considering walks which after leaving the origin rst touch the X-axis at the point (2k, 0), show that F(n) =

k=1

G(k)F(n k),

where by convention we take F(0) = 1. [Hint: The rst 2k steps take us from (0, 0) to (2k, 0) without touching the axis except at the start and end; the last 2(n k) steps can be regarded as a walk from (0, 0) to (2(n k), 0), shifted right 2k places.] 1

(c) Show that G(n) = F(n 1). [Hint: Take any walk with 2(n 1) steps counted by F(n 1), say W . Now do the following. Start at (0, 0). Take one north-east step, reaching (1, 1); then follow the steps of the walk W , ending at (2n 1, 1); then take one south-east step, to (2n, 0). Show that this walk is one of those counted by G(n), and moreover every such walk arises in this way.] (d) Hence show that F(n) = Cn+1 , the (n + 1)st Catalan number, for n 0. [Hint: Induction.] 2 (a) Prove each of the following statements (i) by directly counting the partitions, (ii) by using the recurrence relation: S(n, 2) = 2n1 1 for n 2; S(n, n 1) = n for n 2. 2

(b) Find and prove a formula for S(n, n 2) for n 3. The following question is not for credit but I will be happy to look at and comment on solutions. 3 Let dn be the number of derangements of {1, 2, . . . , n}. (a) Prove that dn = ndn1 + (1)n for n 1. (b) Deduce the formula dn = n! (1)k k=0 k!
n

for n 0.

(c) Let D(x) =

dn x n ex . Prove that D(x) = . 1x n0 n!