248 Chapter 6 Generating Functions

(c) Unlimited amounts of pennies, nickels, dimes, and quarters.

(d) Seven types of lightbulbs with an odd number of the first and s~cond
types.
C!:) Build a generating function for a,, the number of distributions ofr identical
objects into:
(a) Five different boxes with at most four objects in each box.
(b) Four different boxes with between three and eight objects in each box.
(c) Seven different boxes with at least one object in each box.
(d) Three different boxes with at most five objects in the first box.
6.1 EXERCISES
5. Use a generating function for modeling the number of 5-combinations of
the letters M, A, T, H in which MandA can appear any number of times
Summary of Exercises The first 21 exercises involve simple but T and H appear at most once. Which coefficient in this generating
generating function modeling. The remaining problems involve more challeng- function do we want? .
ing modeling; Exercises 25-29 use multinomial generating functions.
6. Use a generating function for modeling the number of different selections
. 1. For each of the following expressions, list the set of all formal products of r hot dogs when there are five types of hot dogs.
in which the exponents sum to 4. 7. Use a generating function for modeling the number of distributions of 18
(a) (1 + x + x 2 )2(1 + x) 2 chocolate bunny rabbits into four Easter baskets with at least 3 rabbits in
(b) (1 + x + x 2 + x 3 + x 4)3 each basket. Which coefficient do we want?
(c) (1 + x 2 + x 4)\l + x + x 2 ) 2 (a) Use a generating function for modeling the number of different election
outcomes in an election for class president if 27 students are voting
(d) (1 + x + x 2 + x 3 + ? among four candidat~s. Which coefficient do we want?
(%: Build a generating function for a, the number of integer solutions to the (b) Suppose each student who is a candidate votes for herself or himself.
equations: Now what is the generating function and the required coefficient?
(a) e1 + ez + e3 + e4 + e5 = r, 0 :5 e; :5 4 (c) Suppose no candidate receives a majority of the vote. Repeat part (a).
(b) e1 + ez + e3 = r, 0 < e; < 4 9. Find a generating function for a, the number of r-combinations of an n-
(c) e1 + e2 + e3 + e4 = r, 2 :5 e; :5 8 e 1 even, ez odd set with repetition.
(d) e1 + ez + e3 + e4 = r, 0 :5 e; ((ID Given one each of u types of candy, two each of v types of candy, and
(e) e1 + e2 + e3 + e4 = r,. 0 < e;, ez, e4odd, e4 :53 three each of w types of candy, find a generating function for the number
of ways to select r candies.
~ Build a generating function for a., the number of r selections from a pile (!}:', Find a generating function for at. the number.of k-combinations of n types
of:
of objects with an even number of the first type, an odd number of the
(a) Three red, four black, and fol.JI white balls. second type, and any amount of the other types.
(b) Five jelly beans, three licorice sticks, eight lollipops with at least one 12. Find a generating function for a,, the number of ways to distribute r
of each candy. identical objects into q distinct boxes with an odd number between r 1 and
s 1 in the first box, an even number between r 2 and s 2 in the second box,
and at most three in the other boxes.
@ Find a generating function for a,, the number of ways n distinct dice can
show a sum of r.
14. Find a generating function for a, the number of ways a roll of six distinct
 6.1 Generating Function Models 249 6.2 Calculating CoeffiCients of Generating Fun~zrons 257

dice can show a sum of r if: i:JJ Find the coefficient of x 20

in (x + x 2 + x 3 + x 4 + x 5)(x 2 + x 3 + x 4 +
(a) The first three dice are odd and the second three even. . .. )5
7
C5~' Find the coefficient of x 18 in (x 2 + x 3 + x 4 + x 5 + x + x f.
6
(b) The ith die does not show a value of i:

@Build a generating function for a,, the number of integer solutions to e 1 + :tL> Find the coefficient of x 50 in (x 10 + x 11 + + x )(x + x 2
25
+ +
e2. + e3 + e4 = r, -3 :5 ej :5 3. - x l5)(x2o + ... + x45).

16. Find a generating function for the number of integers between 0 and 999,999 iJ) Find the coefficient of x 12 in:
whose sum of digits is r. x+3
17. Find a generating function for the number of selections of r sticks of
(d) 1- 2x + x2
chewing gum chosen from eight flavors if each flavor comes in packets of x 2 - 3x bmxm
five sticks. (b) (1 - x)4 (e) (1 - bx)m+I
18. (a) Use a generating function for modeling the number of distributions of (1 - x2)5
20 identical balls into five distinct boxes if each box has between 2 (c) (1 - ~)5
and 7 balls.
. 8. Give a formula similar to Eq. (1) for:
(b) Factor out an x 2 from each polynomial factor in part (a). Interpret this
revised generating function combinatorially.
(a) 1 + x4 + xs + ... + x24 (b) x2o + x4o + ... + x'so
4 55
19. Use a generating function for modeling the number of ways to select five 9. Find the coefficient of x 9 in (x 2 + x 3 + x + x ) .
integers from 1, 2, ... , n, no two of which are consecutive. Which coeffi- 10. Find the coefficient of x 18 in (1 + x 3 + x 6 + x 9 + ?.
cient do we want for n = 20? "For a general n? 11. Find the coefficient of x 12 in:
20. Explain why (1 + x + x2 + + x') 4 is not a proper generating function (a) (1 - x) 8 (d) (1 - 4x)- 5
for a,, the number of ways to select r objects from four types with repetition.
(b) (1 + xr' (e) (1 + X 3)- 4
What is the correct generating function?
(c) (1 + x)- 8
21. Explain why (1 + x + x 2 + x 3 + x 4Y is not a proper generating function
8 10
for the number of ways to distribute r jelly beans among r children with 12. Find the coefficient of x 25 in (1 + x 3 + x )
no child getting more than fou~ jelly beans. @>. Use generating functions to find the number of ways to select 10 balls
22. Show that the generating function for the number of integer solutions to from a large pile of red, white, and blue balls if:
e 1 + e2 + e 3 + e4 = r, 0 :5 e 1 :5 e2 :5 e3 :5 e4 , is (a) The selection has at least two balls of each color.
(1 + x + x 2 + )(1 + x 2 + x 4 + ) (b) The selection has at most two red balls.
(1 + x 3 + x 6 + )(1 + x 4 + x 8 + ) (c) The selection has an even number of blue balls.
23. Find a generating function for the number of ways to make r cents change (i2J.) Use generating functions to find the number of ways to distribute r jelly
in pennies, nickels, and dimes. beans among eight children if:
24. A national singing contest has 5 distinct entrants from each state. Use a (a) Each child gets at least one jelly bean.
generating function for modeling the number of ways to pick 20 semifinal- (b) Each child gets an even.number of beans.
ists if:
[5) How many ways are there to place an order for 12 c~ocolate sundaes if
(a) There is at most 1 person fro:rn each state.
there are 5 types of sundaes, and at most 4 sundaes of one type are allowed?
(b) There are at most 3 people from each state.
@ H~w many ways are there to paint the 10 identical rooms in a hotel with
25. Find a generating function g(x, y) whose coefficient of x'y' is the number five colors if at most three rooms can be painted green, at most three
of ways to distribute r chocolate bars and s lollipops among five. children painted blue, at most three red, and no constraint on the other two colors,
such that no child gets more than three lollipops. black and white?
258 Chi. ;r 6 Generating Functions
6.2 Calculating Coefficients of Generating Functions 259

@ How many ways are there to distribute 20 cents_ to n children and one 29. Use binomial expansions to evaluate:
parent if the parent receives either a nickel or a dime and:
(a) The children r~ceive any amounts?
(b) Each child rec~ives at most l?
()2:
a
m
k=o
(
m) ( n
k. r + k) (b) c-l)*(n)(
k=D k r- k
n)
@How many ways are there to get a sum of 25 when 10 distinct dice are
rolled?
19. How many ways are there to select 300 c~ocolate candies from seven types
30. (a). Evaluate i., (k; 5
). (b) Evalu~te ~ ( : =~).
if each type comes in boxes of 20 and if at least o?e but not more than
five boxes of each type -are chosen? (Hint: Solve rn terms of boxes of 31. (a) Show that~ "' (1)2 *( n + k-
k l) = 2". (b) "' (1)2
Evaluate~ k k.
chocolate.)
20. How many different committees of 40 Senators can be _forme~ if ~e tv;o 32. Why cannot one set x = -1 in formula (5) to "prove" that
Senators from the same state (50 states in all) are considered 1denucal.
21. How many ways are there to split 6 copies of one book, 7 of a copi~s
.(!)*
2
= _i (~ 1 )k(n + k- 1).
k=O k
d book and 11 copies of a third book between two teachers if each
secon , . f h b k? 33. If g(x) is the generating function for. a, then show that gC*l(O)/k! = ar.
teacher gets 12 books and each teacher gets at least 2 copies o eac oo .
22. How many ways are there to divide five pears, five ap~les, five doughnuts,
34. A probability generating function Px(t) for a discrete random variable X
five lollipops, five chocolate cats, and five candy rocks rnto two (unordered) has a polynomial expansion in which p,. the coefficient of tr, is equal to
the probability that X = r.
piles of 15 objects each? .
(a) If X is the number of heads that occur when a fair coin is flipped n
23. How many ways are there to collect $24 from 4 ~hildren and 6 adults if
times, show that Px(t) = (~)"(1 + t)".
each 'person gives at least $1, but each child can give at most $4 and each
adult at most $7? (b) If X is the number of heads that occur when a biased coin is flipped
n times with probability p of heads (and q = 1 - p), show that
24. If a coin is flipped 25 times with eight t_ails occurring, w~at is the probability
Px(t) = (q + pt)".
that no run of six (or more) consecuuve heads occurs.
25. If 10 steaks and 15 lobsters are distributed among four people, how m~y (c) If X is the number of times a fair coin is flipped until the fifth head
occurs, find Px(t).
ways are there to give each person at most 5 steaks and at most 5 l~bster~.
26 Show that (1 - x - x 2 - x 3 - x 4 - x 5 - x 6)- 1 is the generating functlon (d) Repeat part (c) until the mth head occurs and probability of a head is
p.
. for the number of ways a sum of r can occur if a die is rolled any number
of times. 35. (a) The expected value E(X) of a discrete random variable X is defined to
27. Use generating fullctions to show that
be 2.prr. Show that E(X) = p;(l), that is, :rPx(t), with t set equalto
(m) ( ~ )
k=D k r k
= (m + n)
r
1.
(b) Find E(X) for the random variables X in Exercise 34.
28. Use the equation
36: (a) The second moment E 2 (X) of a discrete random variable X is defined
(1 .:_ x2)n = (1 + x)" to be 2.prr 2 Show that. E 2 (X) = p;(l) + p;(l).
(1 - x)" (b) Find Ez(X) for the random variables X in Exercises 34(b) and 34(c).
to show that 37. Suppose a fair coin is flipped until the mth head occurs and suppose that
12 no more than s tails in a row occur. If X is the number of flips, find Px(t).

~( _
'"' 1) *(n)(n+m-2k-1)
k n-1
= (n)
m
m ::::; n and m even 38. Experiments A' and A" have probabilities p' and p" of success in each trial
and are performed n' and n" tinies, respectively. Let X' and X" be the
 258 Chapt.___ Generating Functions
6.2 Calculating Coefficients of Generating Fun'--._./ns 259

@ How many ways are there to_ distrib~te 20 cents. to n c~dren and one . 29. Use binomial expansions to evaluate:
parent if the parent receives either a mckel or a dime and.
(a) The children receive any amounts?
(b) Each child receives at most l?
()2:m (
m) ( n )
a k=o k. r+k (b)(- 1
k=o
)k(n)( n)
k r- k

@How many ways are there t~ get a sum of 25 when 10 distinct dice are
J; (k +k 5) . (b) Evaluate 2: (n-
k)
2
rolled? 30. (a). Evaluate . "

k
. m
k=o m-
19. How many ways are there to select 300 c~ocolate candies from seven types 1

if each type comes in boxes of 20 and ~ at least o~e but not more than
five boxes of each type -are chosen? (Hznt: Solve m terms of boxes of 31. (a) Show that~ "' (1)2 k(n + kk- 1) = 2". (b) Evaluate 2:"' (1)k
-2 k.
chocolate.) k=D

20. How many different committees of 40 Senators can be _forme~ if ~e r;o 32. Why cannot one set x = -1 in formula (5) to ''prove'' that
Senators from the same state (50 states in all) are considered Identical.
21. How many ways are there to split 6 copies of one book, 7 copie:s of a (.!.)
2
k = i: (_:_ 1) k(n + k-
k=O k
1)
second book, and 11 copies of a third book between tw~ teachers if eac~
teacher gets 12 books and each teacher gets at least 2 cop1es of each book. 33. If g(x) is the generating function for. a, then show that gCkl(O)/k! = ar.
2i. How many ways are there to divide five pears, five ap~les, five doughnuts, 34. A probability generating function Px(t) for a discrete random variable X
five lollipops, five chocolate cats, and five candy rocks mto two (unordered) has a polynomial expansion in which p, the coefficient of tr, is equal to
the probability that X = r.
piles of 15 objects each? .
23. How many ways are there to collect $24 from 4 ~hildren and 6 adults if (a) If X is the number of heads that occur when a fair coin is flipped n
times, show that Px(t) = (i)"(l + t)".
each person gives at least $1, but each child can .give at most $4 and each
adult at most $7? . (b) If X is the number of heads that occur when a biased coin is flipped
24. If a coin is flipped 25 times with eight t_ails occurring, w~at is the probability n times with probability p of heads (and q = 1 - p), show that
Px(t) = (q + pt)".
that no run of six (or more) consecutive heads occurs.
25. If 10 stl'!aks and 15 lobsters are distributed among four people, how m~y (c) If X is the number of times a fair coin is flipped until the fifth head
occurs, find px(t).
ways are there to give each person at most 5 steaks and at most 5 l!Jbsters.
26. Show that (1 - x - x 2 - x 3 - x 4 - x 5 - x 6)- 1 is ~~ generating function (d) Repeat part (c) until the mth head occurs and probability of a head is
p.
for the number of ways a sum of r can occur if a die IS rolled any number
of times. 35. (a) The expected value E(X) of a discrete random variable X is defined to
27. Use generating :fufictions to show that
be "i,prr. Show that E(X) = Prtl), that is, !Px(t), with t set equalto

~ (7)C~k) = (m;n) 1.
(b) Find E(X) for the random variables X in Exercise 34.
28. Use the equation
36.' (a) The second moment E 2 (X) of a discrete random variable X is defined
(1 .:..... x2)n = (1 + xY to be '$prr 2 Show that E 2(X) = Px0) + p;(1).
(1 - x)" (b) Find E 2(X) for the random variables X in Exercises 34(b) and 34(c).
to show that 37. Suppose a fair coin is flipped until the mth head occurs and suppose that

~(
mil _
1) k(n)(n+m-2k-1)
k n-1
= (n)
m m s n andm even
no more than s tails in a row occur. If X is the number of flips, find Px(t).
38. Experiments A' and A" have probabilities p' and p" of success in each trial
and are performed n' and n" tinies, respectively. Let X' and X" be the

'-- ~ Find a generating function for the number of integer solutions of 2x
3y + 7z = r with:
(a) X, y, Z ;;::: 0 (b) 0 $ Z $ 2 $ y $ 8 $ X
@ Find a generating function for the number of ways to make r cents change
in pennies, nickels, dimes, and quarters.
6. Find a generating function for the number of ways to distribute r identical
objects into:
(a) Three indistinguishable boxes.
(b) n indistinguishable boxes (n ::;; r).
7. (a) ~how that the number of partitions of 10 into distinct parts (integers)
equal to the number of partitions of 10 into odd parts by listing all
IS
partitions of these two types.
(b) Show algebraically that the generating function for partitions of r into
distinct parts equals the generating function for partitions of r into odd
parts, and hence the numbers of these two types of partitions are equal.
(ID Show w~~ g~nera~~ functions that every positive integer has exactly
one partitl~n mto distinct powers of 10; that is, it has a unique decimal
representation.
9. (a) Prove the result in Example 3 by induction.
(b) Prove the result of Example 3 directly by recursively substituting
(1 + xk) = (1 - x2k)/(l - xk) in g*(x).
10. The equation in Example 3, g*(x)(l- x) = 1, can be rewritten! - x =
1/g*(x). Use this latter equation to prove that among all partitions of an
integer r, r;::: 2, into powers of 2, there are as many such partitions with
an odd number of parts as with an even number of parts.
11. Let R(r, k) denote the number of partitions of the integer r into k parts.
(a) Show that R(r, k) = R(r - 1, k - 1) + R(r - k, k).
(b) Show that L~:. 1 R(n - r, k) = R(n, r).
12. yse a Ferrers diagr~ ~o show that the number of partitions of an integer
mto parts of even siZe 1s equal to the number of partitions into parts such
that each part occurs an even number of times.
13. Interpret the integer multiplie<ation mn, "m times n," to be the sum of m
ns. Prove that mn = nm.
14. Show that the num?~r of partiti.ons of the integer n into three parts equals
the number of partitions of 2n mto three parts of size <n.
15. Show that the number of partitions of n is equal to the number of partitions
of 2n into n parts. .
16. Show that any number of partitions of 2r + k into r + k parts is the same
+ for any k.
'17. Show that the number of partitio:q.s of r + k into k parts is equal to:
1
(a) The number of partitions of r + (k ; ) into k distinct parts.
(b) The number of partitions of r into parts of size ::= k.
18. Show that the number of ordered partitions of n is 2"- 1 For example, the
ordered partitions of 4 are: 4, 1 + 3, 2 + 2, 3 + 1, 1 + 1 + 2, 1 + 2 +
1, 2 + 1 + 1, 1+ 1 + 1 + 1. (Hint: Write n ls in a row and determine
all the ways to partition this sequence into clusters of ls.
19. (a) Find a generating function for a., the number of partitions that add up
to at most n.
(b) Find a generating function for a., the number of partitions of n into
three parts in which no part is larger than the sum of the other two.
(c) Find a generating function for a., the number of different (incongruent)
triangles with integral sides and perimeter n.
20. Show that 2(1 - x)- 3[(1 - x)- 3 + (1 + x)- 3] is the generating function
for the number of ways to toss r identical dice and obtain an even sum.
21. (a) A partition of an integer r is self-conjugate if the Ferrers diagram of
the partition is equal to its own transpose. Find a one-to-one correspon-
dence between the self-conjugate partitions of r and the partitions of
r into distinct odd parts.
(b) The largest square of dots in the upper left-hand comer of a Ferrers
diagram is called the Durfee square of the Ferrers diagram. Find a
generating function for the number of self-conjugate partitions of r
whose Durfee square is size k (a k X k array of dots). (Hint: Us.e a
2
1-1 correspondence between these and the partitions of r - k into
even parts of size at most 2k.)
(c) Show that
(1 + x)(1 + x 3)(1 + x 5 )
'" Xi?-
= 1 + ~ (1 - xz)(1 - x4 )(1 - x 6 ) (1 - x2k)
22. Let { ~} denote the number of partitions of n objects into k nonempty
subsets. Show that { n: 1
} = k{~} + {k ~ 1}
 ( EXERCISES

simi~
13. (a) Find the exponential generating functions for p, the r ,ability that
Fs:mmary of Exercises Mostofthe:first 15 exercises are the first two boxes each have at least one object when r c.,..._..dnct objects
lar to the examples in this section. Exercises 21 and 22 are a continuation of are randomly distributed into n distinct boxes.
the probability generating function exercises in Section 6.2. (b) Determine p,.

1. Find the exponential generating function for the number of arrangements 14. Find an exponential generating function for the number of distributions of
of r objects chosen from five different types with at most five of each type. r distinct objects into n different boxes with exactly m nonempty boxes.
2. Find the exponential generating function for the number of ways to distrib- 15. Find an exponential generating function with:
ute r people into six different rooms with between two and four in each (a) a, = 1/(r + 1) (b) a, = r!
room. 16. Show that if g(x) is the exponential generating function for a, then g(kl(O)
3. Find an exponential generating function for a., the number of r-letter words = ab where g(kl(x) is the kth derivative of g(x).
with no vowel used more than once (consonants can be repeated). 17. If
4. (a) Find the exponential generating function for sn,r. the number of ways ., r ., r

to distribute r distinct objects into n distinct boxes with no empty box. f(x) = 2: a,x,
r=o r.
g(x) = 2:: b, ~
Consider n a fixed constant. r=o r!
and
(b) Determine s.,,. The number sn,,n! is called a Stirling number of the
., r
second kind.
h(x) = f(x)g(x) = 2: c,~
r=o r!
5. Find the exponential generating function, and identify the appropriate coef-
then show that
ficient, for the number of ways to deal a sequence of 13 cards (from a

~ (~) akbr-k
. standard 52-card deck) if the suits are ignored and only the values of the
cards are noted. c, =
6. How many ways are there to distribute eight different toys among four
children if the first child gets at least two toys? 18. Show that eXeY = ex+y b formall . .
e' together. y y multiplymg the expansions of ex and
7. How many r-digit ternary sequences are there with:
(a) An even number of Os? 19. Find a combinatorial ar
is 4'-1. gument to show why the answer in Example 6
(b) An even number of Os and even number of ls?
20. Show that ex/(1 - x)n is the exponential .
8. How many ways are there to make an r-arrangement ofpennies, nickels, of ways to choose some subset (po 'blgeneratmg func~o~ for the number
dimes, and quarters with at least one penny and an odd number of quarters? distribute them into n diffi b ssi ! empty) of r distinct objects and
(Coins of the same denomination are identical.) erent axes With the order in each box counted.
9. How many 10-letter words are there in which each of the letters e, n, r, s
occur:
(a) At most once? (b) At least once?
,#'' 6.3 EXERCISES .

10. How many r-digit ternary sequences are there in which: ~ u m marY of .~X e r c 1 s e s Exercises 1-11 involve generating
(~) No digit occurs exactly twice? fun~tion m.o~els. for ~~tions. The next six exercises use Ferrers diagrams to
verify partition Identities. The next five exercises are more difficult partiti
(b) 0 and 1 each appear a positive even number of times? problems. on
11. How many r-digit quaternary sequences are there in which the total number CD List all partitions of the integer: (a)
4, (b) 6.
of Os and 1s is even?
(]) Find a generating fwiction for a, the number of partitions of r into:
12. Find the exponential generating function for the number of ways to distrib-
ute r distinct objects into five different boxes when b1 < b2 s 4, where (a) Even integers. (b) Distinct odd integers.
b" b2 are the numbers of objects in boxes 1 and 2, respectively. ~ Find a genera~~ ~ction for the number of ways to write the integer r
~ a sum of positive mtegers in which no integer appears more than three
times.
 CHAPTER SIX SOLUTIONS
Section 6.1
2 2 2
1 (a) 8 products-xxxx, .xllxx, x 2x1x, x 2xx1, 1x2.xx, .xx 1x, XX X1, .xlx
3
11{ 2
4
Cb) 3 22 3 4 2 3
15 products-ll.x\ 1.xx , 1x x , 1x x, 1x 1, X 1x2, X 1x, X 11, :X 1, ~ x21,
3 1 2xx xx2x xxx2 x1x3 (c) 10 products-x4111, tx411, x'x 11, x 1x 1, 13. (a) (x 2 + x 3 + x 4 + Y, C((10 - 6) + 3 - 1, (10 - 6)),
X X , X , , d 411 3 1
2 211 2 1x2x21 1x2.xx 1x21x2 11x2x 2, (d) 15 pro ucts-x , x x , (b) (1 + x + x 2)(1 + x + x 2 + )2, C(10 + 3 - 1, 10) -
X 1XX, X X , ' ' 4 3 1x2 2 1 3 11x4
X31x' x2x21 ' x2xx ' x21x2 ' .xx31 ' xx2x, .xxx2, x1x3,
3
1x 1, 1x x,
4)2
x ' xx ' . C(7 + 3 - 1, 7), (c) (l + x 2 + x 4 + )(1 + x + x 2 + ) 2 ,
3. (a) (1 + x + x2 + x3)(1 + x + x2 + x + x , :7 s I C((10 - 2k) + 2 - 1, (10 - k)). 15. C(12 + 5 - 1, 12) - 5 X
(b) (x + x2 + x3 + x4 + xs)(x + x2 + x3)(x + x2 + . . . + x + x ), C(7 + 5 - 1, 7) + C(5, 2) X C(2 + 5 - 1, 2);
2 2
(c) (1 +X+ x2 + .. )\ (d) (x + r + x 5 + .. ) (1 +X+ X + .. Y. 17. (a) C(15 + n - 1, 15) + C(10 + n - 1, 10), (b) C(n, 15) + C(n, 10).
5 (1 +X+ x 2 + ?(1 + X) , coef. of 2 r. 19. C(8 + 7- 1, 8)- 7 X C(3 + 7- 1, 3).
1: (x3 + x4 + xs + .. )\coefficient of x 18.
2
9. (1 + ~ + X +.~ 2 )". 21. C(6 + 3 - 1, 6) - q3 + 3 - 1, 3) - C(2 + 3 - 1, 2).
11. (1 + x2 + x4 + .. )(x + x3 + xs + .. )(1 + x + x + .. ) . 23. C(14 + 10 - 1, 14) - 4 X C(lO + 10 - 1, 10) + 6 X C(7 + 10 -
13. (x + x2 + x3 + x4 + xs + x6). 1, 7) + C(4, 2) X C(6 + 10 - 1, 6) + 4 X 6 X C(3 + 10 - 1, 3) + 4 X
15. (x-3 + x-2 + x-1 + 1 + X + X2 + X3)4. 2 3 C(2 + 10 - 1, 2) + C(6, 2). 25. {C(10 + 4 - 1, 10) - [4 X C(4 +
17 (1 + XS + X10 + .. )8 19. (1 + X + X2 + . )(x + X + X + 4 - 1, 4)] X C(15 + 4 - 1, 15) - 4 X C(9 + 4 - 1, 9)} + C(4, 2) X
f 15
... )4(1 + x + x 2 + ), coefficient o x , gener Y x
all n-5
C(3 + 4 - 1, 3)]. 29. (a) C(m + n, m + r),
21 Cannot have a variable number of factors. (b) 0, if r odd, C(n, r/2), r even, (c) 3". 31. (b) 2.
23.. (1 + X + X2 + ' ' )(1 . + X5 + . X 10 + )(1 + X 10 + X 20 + ) '
8
25. (1 + x + x 2 + Y(l + Y + y2 + y3) 5 1)m(1 - (t/2)'+l)m
27. (xy + xz + yz) 35. (b) n/2, pn, 10, m/p. 37. Px(t) = ( 2 1 _ (t/2 ) .
29. C(p, n), n!.

Section 6.2 Section 6.3

1. C(8 + n - 1, 8). 3. C(m, 9) + C(m, 7) + C(m, 5). 1. (a) 5 parti.tions-4, 3 + 1, 2 + 1 + 1, 2 + 2, 1 + 1 + 1 + 1
5. C(10 + 4 - 1, 10) - 4 X C(4 + 4 - 1, 4). (b) 11 parti.tions-6, 5 + 1, 4 + 2, 4 + 1 + 1, 3 + 3, 3 + 2 + 1, 3 +
7. (a) C(10 + 10 - 1, 10), 1 + 1 + 1, 2 + 2 + 2, 2 + 2 + 1 + 1, 2 + 1 + 1 + 1 + 1, 1 + 1 +
(b) C(10 + 4 - 1, 10) - 3 X C(11 + 4 - 1, 11), (c) Oi2 1+1+1+1.
(d) C(ll + 2 - 1, 11) + 3 X C(12 + 2 - 1, 12), (e) b ?< C(1~, m). 3. (1 + x + x 2 + x 3)(1 + x 2 + x 4 + x 6)(1 + x 3 + x 6 + x 9)
9. o. 11. (a) 0, (b) 1, (c) C(12 + 8 - 1, 12), 5. (1 - x)- 1(1 - r)- 1(1 - x 10)- 1(1 - x 25 )- 1 7. (b) (1 + x)(l + x 2)

(1 + x3) ... = e1 ~:)G =::)G =::)G =::) ... =(after

(d) 4 12 X C(12 + 5 - 1, 12), (e) C(4 + 4 - 1, 4).

Section 6.4 canceling) ( _ x)( _

1 1
~)( 1 _ xs) . . . 19. (a) Multiply the partition
1
generating function (given just before Example 1) times - ;
1 -x
(b) (1 - x)- 1(1 - x 2)- 1{(1 -=- x 3)- 1 - (1 - x 4)- 1}, (c) same as (b).
2 3 4 13 21. (a) Let the number of dots forming the first row and first column
5 1+ x + - x +x- +x-) coeffictento f x 13/13'.. 7 (a) 1/2(3' + 1) ( = 2k - 1 if first row and column have length k) in a self-conjugate Ferrers
. ( 2! 3! 4! ' 9 diagram be the length of the first row in the distfuct, odd-parts diagram;
(b) 1/4[3' + 2 + (-1)1. 9. (a) 2210 + 4 X P(10, 1t X 22 + 6 X delete the first row and colunn of the self-conjugate diagram and use the
P(10 2) x 228 + 4 X P(10, 3) X 227 + P.(10, 4) '{- 22, r
number of dots in the reduced self-conjugate diagram to define the second
10 1
b l6'o _ 4 X 25'o + 6 X 2410 - 4 X 23 + 22 . 11. i4
ii. (a) e" _ 2 X e(n-l).rln + e(n-2).rln, (b) ~~r -'- 2(n - 1)' + (n - 2)1/n .
r row of the distinct, odd-parts diagram, etc. .

15. (a) e"/x, (b) (1 - x)-'. 21. e"r.x l.