102 A Walk Through Combinatorics

Divide and Conquer. Partitions 101

of partitions of n into distinct odd parts is equal to the number of partitions (9) Let H e a positive integer, and let q be a non-negative integer such
of n into distinct even parts as long as n is not pentagonal, and that these that q < k. Define Pk,q{r) = Pk(rk + q). Prove that Pk,g(r) is a
two numbers only differ by one if n is pentagonal. A precise statement polynomial function of r.
of this theorem and its detailed proof can be found in the undergraduate (10) Let m be a fixed positive integer. Prove that S(n, n — m) is a polyno-
textbook [6]. mial function of n. What is the degree of this polynomial?
(11) Prove that for all integers n > 2, the number p(n) — p(n — 1) is equal
to the number of partitions of n in which the two largest parts are
Exercises equal.
(12) Let n > 4. Find the number of partitions of n in which the difference
(1) Find a formula for S(n, 3). of the first two parts is
(2) Prove that if n > 3, then B(n) < n\. (a) at least three,
(3) Prove that if n > 2, then n! < 5(271,71) < (2n)!. (b) exactly three.
(4)(a) Let h(n) be the number of ways to place any number (including (13) Find a formula involving p(n) for the number of partitions of n in
zero) non-attacking rooks on the Ferrers shape of the "staircase" which the three largest parts are equal. (You can assume that n > 4.)
partition (n — 1, n — 2, • • • ,1). Prove that h(n) = B(n). (14) Prove that for all positive integers n,
(b) In how many ways can we place k non-attacking rooks on this
Ferrers shape? p(l) + p(2) + • • • + p(n) < p(2n).
(5) Let m and n be positive integers so that m > n. Prove that the (15) Our four friends from Exercise 16 of Chapter 3, A, B, C, and D
Stirling numbers of the second kind satisfy the recurrence relation organize a long jump competition every day until the final order of
m the four of them will be the same on two different days. At most
S(m,n) = 22S(m — i,n — l)n I _ 1 . how long will they have to wait for that to happen? (Each jump
i=\ is measured in centimeters, so all kinds of ties, twofold, threefold,
(6) Prove that the number of partitions of n into exactly k parts is equal fourfold, are possible.)
to the number of partitions of n in which the largest part is exactly k.
(7) Prove that the number of partitions of n into at most k parts is equal
to that of partitions of n + k into exactly k parts.
(8) The Durkee square of a partition p is the largest square that fits in Supplementary Exercises
the top left corner of the Ferrers shape of p. The Durkee square of
(16) A student has to take twelve hours of classes a week. Due to her
p = (5,3,2,2) has side length 2 as shown in the Figure 5.4.
extracurricular activities, she must take at least three hours of classes
on Monday, at least two on Thursday, and at least one on Friday.
(a) In how many ways can she do this?
(b) In how many ways can she do this if there is only one class on
Tuesday that she may take?
i i
(17) Find the number of compositions of ten into even parts.
Fig. 5.4 The Durkee square of the partition (5,3,2,2). (18) Find the number of weak compositions of 25 into five odd parts.
(19) A student has to take eight hours of classes a week. He wants to have
If we know the parts of a partition p, how can we figure out the side fewer hours on Friday than on Thursday. In how many ways can he
length of its Durkee square without drawing the Ferrers shape of pi do this?
 Divide and Conquer. Partitions 103

(20) Find a closed formula for S(n, 2) if n > 2.

(21) Find a closed formula for S(n, n - 2), for all n>2.
(22) Find a closed formula for S(n, n — 3), for all n > 3.
(23) Recall that Pk{n) is the number of partitions of the integer n into
exactly k parts.

(a) Prove that for all positive integers k < n, the inequality Pk(n) <
(n-k + I ) * " 1 holds.
(b) Is it true that pk (n) is a polynomial function of n?

(24) Prove that p(n) grows faster than any polynomial function of n. That
is, prove that if / is any polynomial function in n, then there exists
an integer N so that f(n) < p(n) for all n > N. Do not use formula
(5.4).
(25) Prove that for all positive integers n, the inequality p(n)2 < p(n2 + 2n)
holds.
(26) Let F(n) be the number of all partitions of [n] with no singleton blocks.
Prove that B(n) = F(n) + F(n + 1). A bijective proof is preferred.
(27) Find a recursive formula for the numbers F(ri) in terms of the numbers
F(i), with i < n — 1.
(28) Let Bk (n) be the number of partitions of [n] so that if i and j are in
the same block, then \i — j \ > k. Prove that Bk(n) = B(n — k), for all
n > k.
(29) Let an be the number of compositions of n into parts that are larger
than 1. Express an by an-i and a n _2.
(30) Let bn be the number of compositions of n into parts that are larger
than 2. Find a recurrence relation satisfied by bn, similar to the one
you found for an in the previous exercise.

Solutions to Exercises

(1) We can assume that n > 3. First we determine the number of sur-
jections / : [n] -> [3]. The number of all functions / : [n] -> [3] is
3 n . Three of these functions have an image of size one. Moreover, by
Exercise 20 and Corollary 5.9, 3 • 2 • ( 2 " _ 1 - 1) such functions have an
image of size two. Therefore, the number of all surjections / : [n] -> [3]