Generating Functions Homework

(edited by E.T.)

January 29, 2015

Problem 1. Prove that for the Fibonacci Sequence {Fn }n≥0 , we have

F0 + F1 + F2 + . . . + Fn = Fn+2 − 1, n ∈ N

This is immediate by the very definition of the Fibonacci Sequence. For the sake of the method,
redo the proof via generating functions. Thus,

(a) Compute the generating function of the Fibonacci Sequence, based on the recursion which
defines this sequence.

(b) If G(x) is the generating function of a sequence {an }n≥0 , whose generating function is the
series H(x) := G(x)
1−x ?

(c) Compute the generating function of the right hand-side of the given equality.

Conclude the given equality, as stated.

Problem 2. Determine the number of permutations of n objects, without fixed points. In other
words, the number of bijections f : {1, 2, . . . , n} −→ {1, 2, . . . , n}, such that f (i) 6= i.

(a) Let Dn be the number of permutations of n objects, with no fixed points. Let
∞
X Dn
D(x) := xn
n!
n=0

the associated ”exponential” generating function (i.e., one which lists n! explicitly in the
denominator of its coefficients). Argue that the number of permutations of n objects, having
precisely k fixed points (0 ≤ k ≤ n) is
 
n
Dn−k .
k

(b) Prove the identity

n  
X n
n! = Dn−k .
k
k=0

1
 (c) Interpret the previous equality in terms of (”exponential”) generating functions, in order to
conclude that
1 1
= ex D(x); from here D(x) = e−x
1−x 1−x
(d) Conclude that
1 1 1 1
Dn = n!( − + − . . . + (−1)n )
2! 3! 4! n!

Lemma. If  is an arbitrary (complex) root of unity of order r (that is, of the equation
xr − 1 = 0), then

X r, if r|n
n =
r
0, otherwise
 =1

where the sum extends over all roots  of the equation xr − 1 = 0.

For example, for r = 4, we have S = {1, i, −1, −i} is the set of all complex roots of unity of
order four. Then

X
n n n n n 4, if 4|n
 = 1 + i + (−1) + (−i) =
4
0, otherwise
 =1

Hint: Fix a root 0 of the given equation. Let S := { : r = 1} What can you say about the
set T := {0  :  ∈ S} ?

Problem 3. Evaluate  
X
k n
(−1) ,
3k
k

by following the steps below.

(a) Consider the generating function

X n 
F (x) := x3k
3k
k

Also consider the function

C(x) := (1 + x)n

Using the above lemma, argue that

C(x) + C(x) + C(2 x)

F (x) = .
3
Clearly, F (−1) is the desired result.

Now use a similar technique, in order to determine the following combinatorial sums

2
(b)
X n         
n n n n
= + + + + ...
2k 0 2 4 6
k

(c)
X n
        
n n n n
= + + + + ...
2k + 1 1 3 5 7
k

(d)
X n         
n n n n
= + + + + ...
3k 0 3 6 9
k

(e)
X n
        
n n n n
= + + + + ...
3k + 1 1 4 7 10
k

f)
X n
        
n n n n
= + + + + ...
3k + 2 2 5 8 11
k

How would you generalize this ?