I am thankful to Margaret Bayer for most of this list. p. 14 Solution of (6b) missing. It is as follows. The $n+1$ elements of $A$ can be considered as elements of an $n$-dimensional vector space over the binary field. Let $B$ be a linearly dependent subset of $A$, then the product of all elements of $B$ is a perfect square since all prime factors must occur in that product an even number of times. p. 52 (44) "students to form" should be "students form" p. 73 Fifth line from the bottom, "Multiplying ... by $n!$" should be "Multiplying ... by $(n-1)!$." And then, on the last line, the $n=0$ term needs to be separated out from the summation to avoid dividing by 0. That is, the summation should go for n\geq 1, not n\geq 0, and should be preceded by a 1. p. 77 (35) The term in the summation should have $i$ in place of $k$ p. 78 (37) The sum equals $-1/(n+1)$, not 0 p. 78 Remove the condition $t \ne -1$ p. 78 (41) The sum should start at $i = 0$. p. 87 (25) The summation sign is missing. p. 90 The second to last sentence before Corollary 5.4 should say "infinitely many weak compositions." p. 96 In line 8 of the proof of Theorem 5.18 the subscripts 1 should be 2. p. 125 In the solution of Exercise 3, c(5,2)=50, not 35. (Subtraction error.) p. 145 In the last sentence on the page, delete one of the "in"s in "in which we were not interested in" p. 161 Line 2 of the solution to Example 8.17 has an upside down question mark. p. 169 (24) The range for $n$ should be $n\ge 0$. p. 170 (30) "Set $g_c(n)=0$" should be "Set $g_\emptyset(n)=0$." Also, the displayed equation should begin with $G_C(x)$ (upper case C). p. 170 (32) "even" and "odd" did not come out correctly as subscripts in the third line of the exercise. p. 176 (9) In the third line of the solution, "upend" should be "append." p. 178 Fifth line from bottom: "Example 4.12" should be "Example 4.16." And then, the $n=0$ term needs to be separated out from the summation to avoid dividing by 0. p. 185 What is called a "walk" in this Chapter should rather be called a "trail". p. 189 Theorem 9.5 needs the hypothesis, $n\ge 3$. p. 190 Line -5: "head" and "tail" should be interchanged. p. 213 In the third line after the statement of Theorem 10.7, "shortest proof on books" should be "shortest proof on the books." p. 223 Here and wherever else it occurs "incidency matrix" should be "incidence matrix." p. 227 In line 3, "linearly independent" should be "linearly dependent." p. 230 (16) $t$ and $m$ should be the same letter. p. 231 (26) Assume that the tree has at least two vertices... p. 248 Paragraph (3), line 5, "m^2-1" edges, not vertices. p. 250 In Definition 11.11, "a bipartite a graph" should be "a bipartite graph." p. 260 (9) The row and column sums are equal to the same positive integer $r$, not necessarily 1. p. 261 (19) remove the "by" just after (b). p. 262 (28) "and edge cover" should be "an edge cover." p. 280 In the figure, the vertex y_2 is not shown correctly. It should be a neighbor of A. p. 281 The last word of the first sentence should be "colors", not "vertices". p. 282 Exercise 15, first line. Replace "face" by "faces". p. 300 (22) replace "exists" by "exist". p. 300 (29) replace "exist" by "exists". p. 434 In the sentence "The first factor A....", replace "A" by "S". p. 441 At the bottom of the page, replace the sentence "Given p...." by the following. " Given $p$, a witness $W(p)$ can be an integer $r$ and all the prime divisors $q$ of $p-1$. A Turing machine could then verify in polynomial time that $r$ satisfies the requirements with each $d=(p-1)/q$. Note that the number of distinct prime divisors $q$ of $p-1$ is less than $\log_2 p$, so $W(p)$ is of polynomial size in terms of the size of the input, which is $\log p$." p. 465 The first page number for the index entry "Catalan numbers" should be 178, not 179. p. 466 The page number for the index entry "incidency matrix" should be 223, not 221. p. 467 The page number for the index entry "inversion" should be 122, not 123.