Page 54, Solution of Exercise 5. {17 \choose 2}" is 136, rather than 126,
 and the difference between {22 \choose 2} and {17 \choose 2} becomes 95,
 rather than 105; thus, the journalist was mistaken when she was saying
 that more than 100 translators will be needed. (Thanks to Claudiu Litan for
pointing this out.)

Page 56, solution of problem 15. The inequalities in the displayed
equation are strict, except for the last one. The number 95 should be
105-24=81. So the final answer is {81\choose 5}.


Page 60, problem 23,  8! = 40320, not 5040. 

Page 66, Theorem 4.2.  Replace "i" by "k" and "non-negative" by "positive".

Page 68, eq. (4.5),   replace "k=1" by "k=0".

Page 75, exercises 13, 14. Assume that k<2^m. 


Page 77 Exercise 25 is stated incorrectly.
Replace "i" by "1" below the summation sign.

page 79 Exercise 51. The denominator of f_n should be 2n+1. 

p. 83, solution to (10):
 "$a_1! a_2! a_k!$" should be "$a_1! a_2! \cdots a_k!$"

p. 89: "Alice only gets only one ball" -> "Alice only gets one ball"
(remove the second "only")

Page 94 Example 5.14. Replace {...} by (...). 

Page 101 problem 8,  second sentence. Replace "Durkee" by "Durfee".

Page 104, solution of Exercise 4(a). Fourth line. Remove "and only if". 

page 109 Exercise 11 should be Exercise 12.

Page 114, at the bottom of the page, 
 the equality a_{n,k}=(n-1)a_{n-1,k-1}+a_{n-1,k} shoud read
 a_{n,k}=a_{n-1,k-1}+(n-1)a_{n-1,k}.


Page 119, Proof of Theorem 6.25. It is better to tell this proof by inserting
1 instead of inserting m+1 since that way the canonical notation is preserved.
Accordingly, the gap positions should be AHEAD of each element, and ON THE 
LEFT of the first cycle, in a new 1-cycle. 

Page 119, in example 6.26,  the 6th gap position of (42)(513) should be
 written outside of the last cycle.  i.e., (|4|2)(|5|1|3)|

Page 135 Last paragraph. Replace "D_n" by "D(n)".

p. 141, answer to chapter 7 # (7):
"As exactly one integer in p is divisible by p"
Put brackets around the first "p":
"As exactly one integer in [p] is divisible by p"

Page 150 Step 2, displayed formula at end:
... -500x/(1-x): the "-500" should be "+500"
and in (8.7), the - between the two terms should be a +
It appears you switched back to the correct sign after that for the rest
of the problem.

Page 155 First displayed equation. Change "(1-3x)" to "(1-x)" (twice)

Page 192, next to last line. The "x" should be removed from the cycle
starting that line, since it is not sure that Z contains more than one
vertex.

Page 202, solution of Exercise 8b. The solution I give is valid if
n is at least 3. Otherwise, it is trivially n.  

Page 204, solution of exercise 204. When v=11, we want a circle on 11
vertices, not 22. 

Psge 222. Remove Corollary 10.18.

Page 236. The Pigeon-hole principle part of the solution is incorrect. Instead, consider the following argument for the induction step. Let G have n+1 vertices and {n\choose 2}+1 edges. 
If G has a vertex of degree n, we are done. If not, remove a vertex and all its edges. Show that the remaining graph has at least {n-1\choose 2}+1 edges, and hence the induction hypothesis can be applied to it.  

Page 384 Corollary 16.16. In the displayed equality, a minus sign is missing
right before the summation sign.