Russell Merris, Combinatorics, PWS & Brooks/Cole, 1996, Errata

P13, 6th line of Exercise 19: number theorist Edouard Lucas ...

P36 Exercise 13 [Cynthia Johnson]: ... + n x (n+1) = ...

P54, Fig. 1.8.2, Caption [Dale Baxley]: The Partition Numbers ...

P65, lines 15 and 18: M_2(x,y,xz)^2

P69, line 4: we discussed some functions ...

P75, Exercise 7 [Margaret Slack]

  • line 2: S(n,1) = 1; S(n,r) = 0 if r < 1 or r > n; and
  • line 5: X(n,1) = n; X(n,r) = 0 if r < 1 or r > n; and

    • P80, first line of Theorem 2.2.7: ... recursion recurrence relation

    P92, line 4: A close parenthesis should follow (-1)^r+t.

    P96, line 17 [Cynthia Johnson]: ... calculus-type notations notions. If ...

    P104, line 5 [Cedide Olcay]: (2.26) s(3, 3 1 ) = (3-1)! = 2 ... (2.27), s(3, 1 3 ) = 1. ...

    P110, Exercise 12: If m > 1, Pprove ...

    P126, line 5: ... Therefore, G_x is a

    P126, line 9: ... a mental note not to forget the fixed points ...

    P126, line 15: ... G_5 = {e_m, (132), (123)}, and ...

    P133, line -10 [Cynthia Johnson]: ... Because m > 2 3, there ...

    P137, Exercise 16(b) [Cynthia Johnson]: (b) Explain why G[hat] = ...

    P151, line 6 [Cynthia Johnson]: ... is a system of distinct repre-

    P159, line 15 [Cynthia Johnson]: Delete the "hat" over the first subscripted "(i,j,k)".

    P164, Exercise 4(g) [Cynthia Johnson]: It should be W_D_5 (r,w,b,g), not W_D_5 (r + w + b + g).

    P164, Exercise 9: In order for the answer on page 349 to be correct, the question needs to be changed. Please replace the third line of Exercise 9 with "Express W_G (r,w,b) as a linear combination of minimal symmetric polynomials M_[alpha] (r,w,b)."

    P167, line -8 [Cynthia Johnson]: mial for s S ...

    P180: Replace the second line with

    Db_n = D(a_0 C(n,0)) + D(Da_0 C(n,1)) + D(D^2 a_0 C(n,2)) + ... + D(D^r a_0 C(n,r))

    P180, line 4: Replace "D^r-1 a_0 = 0" with "D(D^j a_0 C(n,j)) = D^j a_0 C(n,j-1)"

    P181, line 7 [Cynthia Johnson]: where S(r,t), l 1 ...

    P184, line -6: will discover, it can be useful to view ...

    P186, line -9: distributing disturbing part ...

    P188, line 18 [Ken Rebman]: For all n > 0 1. Therefore, the coefficients b_0 = [+]1, ...

    P190, second line after Equation (4.23) [Cynthia Johnson]: ... the radius the of convergence of

    P215, Exercise 12(a): the summand should be (-1)^r C(m+r-1,r)C(m,n-r)

    P217, line -7: ... French number theorist Edouard Lucas ...

    P227, second line of Exercise 15: The last subscript should be, not n-r, but (n-1)-r.

    P237, Exercise 27 [Mark Hunacek]: ... prove that the objects all weigh the same or that they can be divided into two piles of equal weight.

    P265, Exercise 14: ... = G for any connected plane graph G.

    P266, Exercise 19. Insert a new second sentence: "Suppose G - e is connected for all e in E(G)."

    P288, Exercise 8 [Cynthia Johnson]: Let T be a tree on n > 2 vertices ...

    P288, Exercise 11b [Cynthia Johnson]: ... chosen so that Q^tQ = 2I_m + A(G#), ...

    P298, second line of Definition 6.1.10(1): Q are both incident with both L.

    P303 [Ken Rebman]: Replace the last sentence of Exercise 8 with "Show that it is possible for the club pro to set up such a schedule, despite the nonexistence of a pair of orthogonal Latin squares of order 6."

    P305, second line of Exercise 18: of order 10.

    P321, line -11 [Glenn Orr]: ... confirm that vH = 0000000 000.

    P321, line -2: ... equivalent modulo ...

    P357 [insert new entry]: Catlin, P., 260

    P358: cycle, in the context of graphs, 250 249, 266

    P360: join of graphs, 250 249, ...

    P360: Lucas, Edouard, ...

    P362: Tarry, G., 297, 303

    Last updated: January 18, 2002

    Please send errata contributions to merris@csuhayward.edu.