Typos in Kolman, Busby & Ross's book, Discrete mathematical structures (copyright 2000).

Ritter and IST 230 class, Spring 2001.

Last update 28 Mar. 2001

Mistakes caught are worth 0.1 points


There are just a few known typos/mistakes/errata at this point. They are mostly all minor and do not affect your reading of the text. Less modest problems are in RED.


p. 11, problem 7, the line across the top of AUB should be continuous. (12/1/01 -FER)

p. 18. 'cay' is not a non-word, it is a small island (15/1/01 -FER)

p. 32. Figure 1.20. The subscripts of the 'b' column that are multiplied are wrong. They should be: b1j, b2j, to bpj (29/1/01 -FER)

p. 47. In "Logical Connectives and Compound Statements", "p: The sun is shining today. q: It is cold." They then form a compound statement by adding an "and" between them: "p and q: The sun is shining and it is cold." The correct compound statement be: "p and q: The sun is shining _today_ and it is cold." (1/02/01 -Sweigard)

p. 55. Theorem 1, Distributive Properties, property 5 is missing a parentheses. It should read

"p OR (q AND r) == (p OR q) AND (p OR r)" (27/1/01 -Becker/Greiner)

p. 61, para. following the Soln. to Example 7, "We continue this process, producing... called steps in the proof, until we can finally shows that the conclusion..." should be "...until we can finally _show_ that...". (1/02/01 -Sweigard)

p.87, first full para. 'Then the set of all outcomes of this type become the sample space for the experiment.'
'Become' should be 'becomes'. (13/3/01 - Sweigard)

p. 95/p.464 problem 29 "(a) a 4 was tossed?". This would be much more clearly asked as "that at least one die had a '4' on it." (12/3/01 - La Corte)

p. 97,: "A pattern is emerging with these rewriting of [b sub n]."
This should be rewritten as: "A pattern is emerging with these rewritings of [b sub n]." (ironic, actually, having two of these patterns in a row, talking about patterns!). (13/3/01 - Sweigard)

p. 121. 5 lines from bottom: 'is irreflexive if a R a for every a a member of A.' The R should be well and clearly crossed out, and in the book the cross out is slight and overlaid on the upstroke of the R. (14/3/01 -FER)

p. 228. Figure 6.74. There are two periods ('.') and two slashes ('/') in the final equation on the righthand side. They are not needed, but parenthesis are needed. ( for . and ) for /. This is probabably a TeX problem. (28/3/01-FER)

p. 231. Figure 6.78 (a) line 1, x=0, y=0, should have f(x,y) be 0. (20/3/01 -FER)

p. 231. Figure 6.78 (b) line 3&4 of the table elements, x=0, y=1, z=0, should have f(x,y) be 0, and x=0, y=1, z = 1, should be 1. (20/3/01 -Becker)

p. 285 # 7, the answer in the back for a is incorrect, the degree of node a is 1. (3/5/01 -Pipino)

p. 285 # 9, the answer in the back includes a path abc. The path should be acb. (3/5/01 -Pipino)

p. 290. Fleury's algorithm. Step 1. I cannot see how you can remove the vertices from the graph while they still have edges attached to them. I think you only remove vertices when they have no edges left to be attached. Informally, however, the idea works.( 13/4/01 -FER)

p. 299. Labeling algorithm. Step 1. "Label each j in N1" should be "Label each node j in N1".

p. 399. self test 10. Number 3. the grammer allows for v1 to become just '2'. The BNF form does not allow this. (3/V/01 - Pipino).

p. 457. Number 27 from page 20 has the answers for (a), (e), and (c). (e) should obviously be (b). (23/1/01 -Pipino)