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

26 | Five lines above the Venn diagrams | Change "The Venn diagrams have lead us" to "The Venn diagrams have led us" | Eric Gossett | 9-09-2013 |

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

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

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 |

151 | Table 3.14 | row 6 col 1 should be 22; row 1 col 5 should be 16 | Kayse Lee | 9-16-2012 |

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

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

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

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-04-2017 |

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

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

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

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

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

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

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

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

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

461 | Definition 8.33 | there should not be a space in front of the first comma in line 1 | Eric Gossett | 9-16-2012 |

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

512 | Theorem 8.70 | change "exits" to "exists" | Eric Gossett | 9-16-2012 |

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 | 9-16-2012 |

518 | Exercise 21 | Should read "Prove R(m,k;m) ≥ k for k ≥ m ≥ 1" | Isaac Livingston | 9-16-2012 |

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

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

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

589 | third paragraph under "Turing Machines and Neural Nets" | change "Pitts showed" to "Pitts asserted" | Eric Gossett | 9-16-2012 |

603 | Definition 10.7 | "we say the" should be "we say that" | Daniel Moliter | 11-29-2017 |

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

610 | Definition 10.14 Alternative Notation | "a simple graph with loops" would be better as "a simple graph with loops inserted" | Daniel Moliter | 12-07-2017 |

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

619 | footnote 10 | change "in not in" to "is not in" | Dave Kilgore | 11-25-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 | 11-28-2012 |

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

656 | Table 10.6 caption | "Djikstra's" should be "Dijkstra's" | Nicolas Nytko | 5-17-2017 |

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 | 12-07-2016 |

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 | 12-03-2012 |

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

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

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 | 9-16-2012 |

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 | 10-29-2013 |

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

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