DMWP: Errors Sorted by Page Number

PageLocationDescription of the Error (more serious errors are highlighted)Reported ByDate Posted
11third paragraph, line 2change "included" to "include"Eric Gossett  9-04-2009
13Table 1.7-1/1 is missing. Insert it by 3 and push the other entries downMichelle Nielsen  8-22-2011
26Five lines above the Venn diagramsChange "The Venn diagrams have lead us" to "The Venn diagrams have led us"Eric Gossett  9-09-2013
42Exercise 11 (D)(ii)The condition should read "a textbook with more than 500 pages."Karl Johnson  9-09-2010
56the top expression It is missing a ] on the far right. It should be [P → Q] ⇔ [(P ∧ (¬ Q)) → (¬ P)]Dave Kilgore  9-10-2012
97Line 1 of footnote 15Should start as: "Since r2 - r3 < |b| - r3 ≤ |b| and r3 - r3 < |b| - r2 ≤ |b|"Eric Gossett  9-16-2009
99Exercise 2aI did not write what I intended to write. Change "two distinct integers" to "two distinct positive integers"Rhianna Braaksma  9-27-2009
114Phase 1, final rearranged equationq6 should be -q6Kayla Hewitt10-06-2014
123Example 3.30, line 6 "gcd(2,5) = 1" should be "gcd(3,5) = 1"Jason James  2-26-2014
124Example 3.32, line 6change "425 ≡ 5 (mod 5)" to "425 ≡ 42 (mod 5)"Eric Gossett  9-17-2009
131Exercise 12, line 6change "Table[(n,Mod[a n, 49]},{n,1,48}]" to "Table[{n,Mod[a n, 49]},{n,1,48}]"Rob Upcraft  9-23-2009
136line 2 from the bottomchange "does produces" to "does produce"Kayse Lee  9-24-2009
143The Chess Board TheoremThe theorem was first proved by S. W. Golomb: Checker Boards and Polyominoes, The American Mathematical Monthly, Vol. 61, No. 10 (Dec., 1954), pp. 675-682Susan Montgomery10-21-2013
151Table 3.14row 6 col 1 should be 22; row 1 col 5 should be 16Kayse Lee  3-31-2011
174list line in Example 4.5change "steps 2a and 2b are" to "step 2a is"Eric Gossett10-03-2015
179Exercise 7 Change "between 71° and 90°F" to "over 70° and not over 90°"Curtis Heyda10-01-2012
179Example 4.10, line 1change "algorithm preemtive" to "algorithm preemptive"Caleb Knox11-02-2013
228The Mutually Exclusive Tasks Principle"decomposed into two mutually exclusive tasks" should be "accomplished by completing exactly one of two mutually exclusive tasks,"C. Pandu Rangan11-04-2017
230Line 2 under the Permuations boxchange: there is a + 1    to: there is a "+ 1"Andrew Walker10-13-2011
238Exercise 28achange "10-key chords" to "10-key combinations"Anthony Colombo10-21-2013
2531 line above "The second enumeration"change "sum uses is" to "sum is"Dave Kilgore10-16-2012
255Theorem 5.19"For all positive integers n and r" should be "For all positive integers b and r"Ryan Hanson10-10-2017
296Exercise 23(a)It is clearer as: "What is the probability of choosing either a consonant in the first half of the alphabet or else a vowel?"Michelle Nielsen10-06-2011
330PascalTriangle, line 2The line should be indented two spaces.Michelle Nielsen10-26-2011
350Exercise 12(b)change to "What is the length of the longest sequence that can be generated starting at n ≤ 1000? What is the initial value of n?"Eric Gossett11-16-2010
353The n = 3 paragraphchange "peg 3" to "peg C"Madi Thull11-18-2016
362Footnote 35change "This idea is not a good, " to "This is not a good idea, "Ben Visness11-03-2014
365Quick Check 7.8The polynomial in both parts should be 6x2+13x-5Kayse Lee11-02-2009
372In step 3 of the box at the top of the pageδ2 is missing the subscriptJacob Heppner11-02-2014
391Section 7.4, line 3remove the braces (a sequence is not a set)Eric Gossett  2-03-2011
392Definition 7.20remove the braces in lines 1 and 4 (a sequence is not a set)Eric Gossett  2-03-2011
4206 lines from the bottom(1 + z2 + x4 + ⋅⋅⋅) should be (1 + z2 + z4 + ⋅⋅⋅)Nathan Gossett10-28-2012
423Quick Check 8.1 #1change "Show the" to "Show that"Annie Melling11-11-2013
426OI CI ∅ "can be all be" should be "can all be"Bailey Middendorf12-07-2017
428Theorem 8.10 proof, first paragraphThe phrase "establishing the boundary conditions" should be near the end of the next paragraph.Eric Gossett  2-24-2011
435Exercise 27change "Table 8.54 on page 499" to "Table 8.7 on page 430"Kayse Lee  3-03-2011
461Definition 8.33there should not be a space in front of the first comma in line 1Eric Gossett  3-12-2011
506First line after "Detour"change "m+1 ≤ k ≤ p" to "1 ≤ k ≤ p-m"Eric Gossett  4-13-2015
512Theorem 8.70change "exits" to "exists"Eric Gossett  3-28-2011
516Theorem 8.75, line 2The phrase "whenever the" should read "whenever |S| ≥ R(k1,k2,...,kn;m) and the"Eric Gossett  4-04-2011
517Exercise 7dChange A3 from {a,d} to {a,c,d}Eric Gossett  4-14-2011
518Exercise 21Should read "Prove R(m,k;m) ≥ k for k ≥ m ≥ 1"Isaac Livingston  4-04-2011
551Exercise 9The leading quotation marks on "go to jail" and "get out of jail free" are facing the wrong direction.Kayse Lee11-14-2009
555line 5 after Definition 9.8change "the third assumption" to "the fourth assumption"Claire Cornell12-10-2015
566line 1 of Figure 9.14change ⟨\TITLE⟩ to ⟨/TITLE⟩Brandon RichardWebster11-12-2012
568Exercise 1should end with: "that only uses concatenation and the * operator."Eric Gossett11-16-2016
589third paragraph under "Turing Machines and Neural Nets"change "Pitts showed" to "Pitts asserted"Eric Gossett  5-14-2009
603Definition 10.7"we say the" should be "we say that"Daniel Moliter11-29-2017
604Definition 10.9change "The line graph GL is" to "The line graph GL, is"Caleb Knox11-21-2013
610Definition 10.14 Alternative Notation"a simple graph with loops" would be better as "a simple graph with loops inserted"Daniel Moliter12-07-2017
611Definition 10.15, line 4"a common j if and only there" should be "a common j if and only if there"Hannah Osborne11-22-2009
617Exercises 11 and 12The calculator or software comment in part (b) should be in part (a)Curtis Heyda11-27-2012
619footnote 10change "in not in" to "is not in"Dave Kilgore11-25-2012
626Exercise 16Although correct as stated, it will be easier for the reader to change "is seated next to at least one friend." to "has a friend seated on both sides."Nathan Gossett11-28-2012
627Definition 10.34The definition gets more complex (and controversial) if loops are allowed. change to: "Let G = (V,E,θ) be a graph with no loops."Michelle Nilesen/Eric Gossett  5-08-2012
633Exercise 20"if and only of" should be "if and only if"Ben Visness12-05-2014
640Figure 10.67 The figure should include two additional multi-graphs having two vertices and two edges. One has two edges that connect the two vertices, the other has a loop at one vertex.Curtis Heyda11-30-2011
640paragraph 3 should read: After adding e2 to G1, the subgraph G2 will look like one of the graphs in Figure 10.67. The relationship ρ2 = ε2 - n2 + 2 is true.Curtis Heyda11-30-2011
656Table 10.6 caption"Djikstra's" should be "Dijkstra's"Nicolas Nytko  5-17-2017
676Definition 11.11, line 1There is an implicit assumption that m is at least 2. It is better to make it explicit. The new sentence is: "A rooted tree in which every node has at most m children is called an m-ary tree (m ≥ 2)."Curtis Heyda12-03-2011
676Definition 11.11, completeThe definition for a complete tree would be less ambiguous if it read "An m-ary tree of height h is called complete if it is a balanced tree having all levels filled except perhaps level h."Nathan Gossett12-07-2016
678The proof of Theorem 11.14Since i is already being used as the number of interior nodes, it is a poor choice for the summation index. Change the summation index to k.Liz LeGrand12-03-2012
690Exercise 4cchange "Bismark" to "Bismarck"Caleb Knox12-10-2013
769Exercise 3dThe web address should be Upcraft  9-08-2010
A38Exercises 2.3.4, Exercise 9(a)Should be "A ∧ B ∧ C ∧ (Di ∨ Dii) ∧ E ∧ F"Ike Goetzman  9-09-2015
A42Exercises 2.6.2 exercise 2.(b)It would be better to designate the universe of discourse as P and write ∃ pP in the final expression.Curtis Heyda  9-16-2012
A53Exercises 5.3.3 #11Change "differ by 1 from its two neighbors" to "differ by 1 from at least one neighbor"Annie Melling10-29-2013
A56Exercise 9CFive changes: change "C(6,2)" to "P(6,2)" (twice); change "without order" to "with order"; change "15 · 16" to "30 · 16"; change "256" to "128"; change ".059" to ".117"Michelle Nielsen  3-02-2012
A6917 (b)"Three state are sufficient." should be "Three states are sufficient."Ben Visness11-17-2014
A70Exercises 9.4.3 Exercise 3Change to:    (^| )[aeiou][a-z]*[aeiou]($| )    or    (^| )(a|e|i|o|u)[a-z]*(a|e|i|o|u)($| )Curtis Heyda11-16-2011

Last Updated (m-d-y): 12-21-2017

Back to the main error page