Date Posted | Page | Location | Description of the Error (more serious errors are highlighted) | Reported By |
---|---|---|---|---|

5-14-2009 | 589 | third paragraph under "Turing Machines and Neural Nets" | change "Pitts showed" to "Pitts asserted" | Eric Gossett |

9-04-2009 | 11 | third paragraph, line 2 | change "included" to "include" | Eric Gossett |

9-16-2009 | 97 | Line 1 of footnote 15 | Should start as: "Since r_{2} - r_{3} < |b| - r_{3} ≤ |b| and r_{3} - r_{3} < |b| - r_{2} ≤ |b|" | Eric Gossett |

9-17-2009 | 124 | Example 3.32, line 6 | change "42^{5} ≡ 5 (mod 5)" to "42^{5} ≡ 42 (mod 5)" | Eric Gossett |

9-23-2009 | 131 | Exercise 12, line 6 | change "Table[(n,Mod[a n, 49]},{n,1,48}]" to "Table[{n,Mod[a n, 49]},{n,1,48}]" | Rob Upcraft |

9-24-2009 | 136 | line 2 from the bottom | change "does produces" to "does produce" | Kayse Lee |

9-27-2009 | 99 | Exercise 2a | I did not write what I intended to write. Change "two distinct integers" to "two distinct positive integers" | Rhianna Braaksma |

11-02-2009 | 365 | Quick Check 7.8 | The polynomial in both parts should be 6x^{2}+13x-5 | Kayse Lee |

11-14-2009 | 551 | Exercise 9 | The leading quotation marks on "go to jail" and "get out of jail free" are facing the wrong direction. | Kayse Lee |

11-22-2009 | 611 | Definition 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-2010 | 769 | Exercise 3d | The web address should be www.mathcs.bethel.edu/~gossett/DiscreteMathWithProof/ | Rob Upcraft |

9-09-2010 | 42 | Exercise 11 (D)(ii) | The condition should read "a textbook with more than 500 pages." | Karl Johnson |

11-16-2010 | 350 | Exercise 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-2011 | 391 | Section 7.4, line 3 | remove the braces (a sequence is not a set) | Eric Gossett |

2-03-2011 | 392 | Definition 7.20 | remove the braces in lines 1 and 4 (a sequence is not a set) | Eric Gossett |

2-24-2011 | 428 | Theorem 8.10 proof, first paragraph | The phrase "establishing the boundary conditions" should be near the end of the next paragraph. | Eric Gossett |

3-03-2011 | 435 | Exercise 27 | change "Table 8.54 on page 499" to "Table 8.7 on page 430" | Kayse Lee |

3-12-2011 | 461 | Definition 8.33 | there should not be a space in front of the first comma in line 1 | Eric Gossett |

3-28-2011 | 512 | Theorem 8.70 | change "exits" to "exists" | Eric Gossett |

3-31-2011 | 151 | Table 3.14 | row 6 col 1 should be 22; row 1 col 5 should be 16 | Kayse Lee |

4-04-2011 | 516 | Theorem 8.75, line 2 | The phrase "whenever the" should read "whenever |S| ≥ R(k_{1},k_{2},...,k_{n};m) and the" | Eric Gossett |

4-04-2011 | 518 | Exercise 21 | Should read "Prove R(m,k;m) ≥ k for k ≥ m ≥ 1" | Isaac Livingston |

4-14-2011 | 517 | Exercise 7d | Change A_{3} from {a,d} to {a,c,d} | Eric Gossett |

8-22-2011 | 13 | Table 1.7 | -1/1 is missing. Insert it by 3 and push the other entries down | Michelle Nielsen |

10-06-2011 | 296 | Exercise 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-2011 | 230 | Line 2 under the Permuations box | change: there is a + 1 to: there is a "+ 1" | Andrew Walker |

10-26-2011 | 330 | PascalTriangle, line 2 | The line should be indented two spaces. | Michelle Nielsen |

11-16-2011 | A70 | Exercises 9.4.3 Exercise 3 | Change to: (^| )[aeiou][a-z]*[aeiou]($| ) or (^| )(a|e|i|o|u)[a-z]*(a|e|i|o|u)($| ) | Curtis Heyda |

11-30-2011 | 640 | Figure 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-2011 | 640 | paragraph 3 | should read: After adding e_{2} to G_{1}, the subgraph G_{2} will look like one of the graphs in Figure 10.67. The relationship ρ_{2} = ε_{2} - n_{2} + 2 is true. | Curtis Heyda |

12-03-2011 | 676 | Definition 11.11, line 1 | There 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-2012 | A56 | Exercise 9C | Five 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-2012 | 627 | Definition 10.34 | The 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-2012 | 56 | the top expression | It is missing a ] on the far right. It should be [P → Q] ⇔ [(P ∧ (¬ Q)) → (¬ P)] | Dave Kilgore |

9-16-2012 | A42 | Exercises 2.6.2 exercise 2.(b) | It would be better to designate the universe of discourse as P and write ∃ p ∈ P in the final expression. | Curtis Heyda |

10-01-2012 | 179 | Exercise 7 | Change "between 71° and 90°F" to "over 70° and not over 90°" | Curtis Heyda |

10-16-2012 | 253 | 1 line above "The second enumeration" | change "sum uses is" to "sum is" | Dave Kilgore |

10-28-2012 | 420 | 6 lines from the bottom | (1 + z^{2} + x^{4} + ⋅⋅⋅) should be (1 + z^{2} + z^{4} + ⋅⋅⋅) | Nathan Gossett |

11-12-2012 | 566 | line 1 of Figure 9.14 | change ⟨\TITLE⟩ to ⟨/TITLE⟩ | Brandon RichardWebster |

11-25-2012 | 619 | footnote 10 | change "in not in" to "is not in" | Dave Kilgore |

11-27-2012 | 617 | Exercises 11 and 12 | The calculator or software comment in part (b) should be in part (a) | Curtis Heyda |

11-28-2012 | 626 | Exercise 16 | Although 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-2012 | 678 | The proof of Theorem 11.14 | Since 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-2013 | 26 | Five lines above the Venn diagrams | Change "The Venn diagrams have lead us" to "The Venn diagrams have led us" | Eric Gossett |

10-21-2013 | 143 | The Chess Board Theorem | The theorem was first proved by S. W. Golomb: Checker Boards and Polyominoes, The American Mathematical Monthly, Vol. 61, No. 10 (Dec., 1954), pp. 675-682 | Susan Montgomery |

10-21-2013 | 238 | Exercise 28a | change "10-key chords" to "10-key combinations" | Anthony Colombo |

10-29-2013 | A53 | Exercises 5.3.3 #11 | Change "differ by 1 from its two neighbors" to "differ by 1 from at least one neighbor" | Annie Melling |

11-02-2013 | 179 | Example 4.10, line 1 | change "algorithm preemtive" to "algorithm preemptive" | Caleb Knox |

11-11-2013 | 423 | Quick Check 8.1 #1 | change "Show the" to "Show that" | Annie Melling |

11-21-2013 | 604 | Definition 10.9 | change "The line graph G_{L} is" to "The line graph G_{L}, is" | Caleb Knox |

12-10-2013 | 690 | Exercise 4c | change "Bismark" to "Bismarck" | Caleb Knox |

2-26-2014 | 123 | Example 3.30, line 6 | "gcd(2,5) = 1" should be "gcd(3,5) = 1" | Jason James |

10-06-2014 | 114 | Phase 1, final rearranged equation | q_{6} should be -q_{6} | Kayla Hewitt |

11-02-2014 | 372 | In step 3 of the box at the top of the page | δ_{2} is missing the subscript | Jacob Heppner |

11-03-2014 | 362 | Footnote 35 | change "This idea is not a good, " to "This is not a good idea, " | Ben Visness |

11-17-2014 | A69 | 17 (b) | "Three state are sufficient." should be "Three states are sufficient." | Ben Visness |

12-05-2014 | 633 | Exercise 20 | "if and only of" should be "if and only if" | Ben Visness |

4-13-2015 | 506 | First line after "Detour" | change "m+1 ≤ k ≤ p" to "1 ≤ k ≤ p-m" | Eric Gossett |

9-09-2015 | A38 | Exercises 2.3.4, Exercise 9(a) | Should be "A ∧ B ∧ C ∧ (Di ∨ Dii) ∧ E ∧ F" | Ike Goetzman |

10-03-2015 | 174 | list line in Example 4.5 | change "steps 2a and 2b are" to "step 2a is" | Eric Gossett |

12-10-2015 | 555 | line 5 after Definition 9.8 | change "the third assumption" to "the fourth assumption" | Claire Cornell |

11-16-2016 | 568 | Exercise 1 | should end with: "that only uses concatenation and the * operator." | Eric Gossett |

11-18-2016 | 353 | The n = 3 paragraph | change "peg 3" to "peg C" | Madi Thull |

12-07-2016 | 676 | Definition 11.11, complete | The 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-2017 | 656 | Table 10.6 caption | "Djikstra's" should be "Dijkstra's" | Nicolas Nytko |

10-10-2017 | 255 | Theorem 5.19 | "For all positive integers n and r" should be "For all positive integers b and r" | Ryan Hanson |

11-04-2017 | 228 | The 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-2017 | 603 | Definition 10.7 | "we say the" should be "we say that" | Daniel Moliter |

12-07-2017 | 426 | OI CI ∅ | "can be all be" should be "can all be" | Bailey Middendorf |

12-07-2017 | 610 | Definition 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