DMWP: Errors Sorted by Date Posted

Date PostedPageLocationDescription of the Error (more serious errors are highlighted)Reported By
  5-14-2009589third paragraph under "Turing Machines and Neural Nets"change "Pitts showed" to "Pitts asserted"Eric Gossett
  9-04-200911third paragraph, line 2change "included" to "include"Eric Gossett
  9-16-200997Line 1 of footnote 15Should start as: "Since r2 - r3 < |b| - r3 ≤ |b| and r3 - r3 < |b| - r2 ≤ |b|"Eric Gossett
  9-17-2009124Example 3.32, line 6change "425 ≡ 5 (mod 5)" to "425 ≡ 42 (mod 5)"Eric Gossett
  9-23-2009131Exercise 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-24-2009136line 2 from the bottomchange "does produces" to "does produce"Kayse Lee
  9-27-200999Exercise 2aI did not write what I intended to write. Change "two distinct integers" to "two distinct positive integers"Rhianna Braaksma
11-02-2009365Quick Check 7.8The polynomial in both parts should be 6x2+13x-5Kayse Lee
11-14-2009551Exercise 9The leading quotation marks on "go to jail" and "get out of jail free" are facing the wrong direction.Kayse Lee
11-22-2009611Definition 10.15, line 4"a common j if and only there" should be "a common j if and only if there"Hannah Osborne
  9-08-2010769Exercise 3dThe web address should be www.mathcs.bethel.edu/~gossett/DiscreteMathWithProof/Rob Upcraft
  9-09-201042Exercise 11 (D)(ii)The condition should read "a textbook with more than 500 pages."Karl Johnson
11-16-2010350Exercise 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 Gossett
  2-03-2011391Section 7.4, line 3remove the braces (a sequence is not a set)Eric Gossett
  2-03-2011392Definition 7.20remove the braces in lines 1 and 4 (a sequence is not a set)Eric Gossett
  2-24-2011428Theorem 8.10 proof, first paragraphThe phrase "establishing the boundary conditions" should be near the end of the next paragraph.Eric Gossett
  3-03-2011435Exercise 27change "Table 8.54 on page 499" to "Table 8.7 on page 430"Kayse Lee
  3-12-2011461Definition 8.33there should not be a space in front of the first comma in line 1Eric Gossett
  3-28-2011512Theorem 8.70change "exits" to "exists"Eric Gossett
  3-31-2011151Table 3.14row 6 col 1 should be 22; row 1 col 5 should be 16Kayse Lee
  4-04-2011516Theorem 8.75, line 2The phrase "whenever the" should read "whenever |S| ≥ R(k1,k2,...,kn;m) and the"Eric Gossett
  4-04-2011518Exercise 21Should read "Prove R(m,k;m) ≥ k for k ≥ m ≥ 1"Isaac Livingston
  4-14-2011517Exercise 7dChange A3 from {a,d} to {a,c,d}Eric Gossett
  8-22-201113Table 1.7-1/1 is missing. Insert it by 3 and push the other entries downMichelle Nielsen
10-06-2011296Exercise 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 Nielsen
10-13-2011230Line 2 under the Permuations boxchange: there is a + 1    to: there is a "+ 1"Andrew Walker
10-26-2011330PascalTriangle, line 2The line should be indented two spaces.Michelle Nielsen
11-16-2011A70Exercises 9.4.3 Exercise 3Change to:    (^| )[aeiou][a-z]*[aeiou]($| )    or    (^| )(a|e|i|o|u)[a-z]*(a|e|i|o|u)($| )Curtis Heyda
11-30-2011640Figure 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 Heyda
11-30-2011640paragraph 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 Heyda
12-03-2011676Definition 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 Heyda
  3-02-2012A56Exercise 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
  5-08-2012627Definition 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
  9-10-201256the top expression It is missing a ] on the far right. It should be [P → Q] ⇔ [(P ∧ (¬ Q)) → (¬ P)]Dave Kilgore
  9-16-2012A42Exercises 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
10-01-2012179Exercise 7 Change "between 71° and 90°F" to "over 70° and not over 90°"Curtis Heyda
10-16-20122531 line above "The second enumeration"change "sum uses is" to "sum is"Dave Kilgore
10-28-20124206 lines from the bottom(1 + z2 + x4 + ⋅⋅⋅) should be (1 + z2 + z4 + ⋅⋅⋅)Nathan Gossett
11-12-2012566line 1 of Figure 9.14change ⟨\TITLE⟩ to ⟨/TITLE⟩Brandon RichardWebster
11-25-2012619footnote 10change "in not in" to "is not in"Dave Kilgore
11-27-2012617Exercises 11 and 12The calculator or software comment in part (b) should be in part (a)Curtis Heyda
11-28-2012626Exercise 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 Gossett
12-03-2012678The 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 LeGrand
  9-09-201326Five lines above the Venn diagramsChange "The Venn diagrams have lead us" to "The Venn diagrams have led us"Eric Gossett
10-21-2013143The 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 Montgomery
10-21-2013238Exercise 28achange "10-key chords" to "10-key combinations"Anthony Colombo
10-29-2013A53Exercises 5.3.3 #11Change "differ by 1 from its two neighbors" to "differ by 1 from at least one neighbor"Annie Melling
11-02-2013179Example 4.10, line 1change "algorithm preemtive" to "algorithm preemptive"Caleb Knox
11-11-2013423Quick Check 8.1 #1change "Show the" to "Show that"Annie Melling
11-21-2013604Definition 10.9change "The line graph GL is" to "The line graph GL, is"Caleb Knox
12-10-2013690Exercise 4cchange "Bismark" to "Bismarck"Caleb Knox
  2-26-2014123Example 3.30, line 6 "gcd(2,5) = 1" should be "gcd(3,5) = 1"Jason James
10-06-2014114Phase 1, final rearranged equationq6 should be -q6Kayla Hewitt
11-02-2014372In step 3 of the box at the top of the pageδ2 is missing the subscriptJacob Heppner
11-03-2014362Footnote 35change "This idea is not a good, " to "This is not a good idea, "Ben Visness
11-17-2014A6917 (b)"Three state are sufficient." should be "Three states are sufficient."Ben Visness
12-05-2014633Exercise 20"if and only of" should be "if and only if"Ben Visness
  4-13-2015506First line after "Detour"change "m+1 ≤ k ≤ p" to "1 ≤ k ≤ p-m"Eric Gossett
  9-09-2015A38Exercises 2.3.4, Exercise 9(a)Should be "A ∧ B ∧ C ∧ (Di ∨ Dii) ∧ E ∧ F"Ike Goetzman
10-03-2015174list line in Example 4.5change "steps 2a and 2b are" to "step 2a is"Eric Gossett
12-10-2015555line 5 after Definition 9.8change "the third assumption" to "the fourth assumption"Claire Cornell
11-16-2016568Exercise 1should end with: "that only uses concatenation and the * operator."Eric Gossett
11-18-2016353The n = 3 paragraphchange "peg 3" to "peg C"Madi Thull
12-07-2016676Definition 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 Gossett
  5-17-2017656Table 10.6 caption"Djikstra's" should be "Dijkstra's"Nicolas Nytko
10-10-2017255Theorem 5.19"For all positive integers n and r" should be "For all positive integers b and r"Ryan Hanson
11-04-2017228The Mutually Exclusive Tasks Principle"decomposed into two mutually exclusive tasks" should be "accomplished by completing exactly one of two mutually exclusive tasks,"C. Pandu Rangan
11-29-2017603Definition 10.7"we say the" should be "we say that"Daniel Moliter
12-07-2017426OI CI ∅ "can be all be" should be "can all be"Bailey Middendorf
12-07-2017610Definition 10.14 Alternative Notation"a simple graph with loops" would be better as "a simple graph with loops inserted"Daniel Moliter


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

Back to the main error page