| 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 r2 - r3 < |b| - r3 ≤ |b| and r3 - r3 < |b| - r2 ≤ |b|" | Eric Gossett |
| 9-17-2009 | 124 | Example 3.32, line 6 | change "425 ≡ 5 (mod 5)" to "425 ≡ 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 6x2+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(k1,k2,...,kn;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 A3 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 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-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 + z2 + x4 + ⋅⋅⋅) should be (1 + z2 + z4 + ⋅⋅⋅) | 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 |
| 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, GL is" to "The line graph, GL, 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 | q6 should be -q6 | 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 possibly 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 |
| 9-17-2018 | 25 | line 1 below Definition 2.14 | "there are finitely many sets in the" should be "finitely many sets go into the production of the" | John Bretscher |
| 9-18-2018 | 121 | Example 3.28, line 6 | "There should 3 liters left" should be "There should be 3 liters left" | Anit Chumber |
| 9-23-2018 | 42 | Exercise 6d | "complementary" should be "complimentary" | John Bretscher |
| 9-23-2018 | 45 | Example 2.20 lines 4 and 8 | change "I am a teacher if and only if" to "I am an employed teacher if and only if" | John Bretscher |
| 9-23-2018 | 45 | Example 2.20 lines 6 and 8 | change "I have students" to "I have paying students" | John Bretscher |
| 9-23-2018 | A41 | Exercises 2.5.3 #5 | Delete the sentence "Prove one of these; then use the duality principle." | John Bretscher |
| 10-01-2018 | A42 | Exercises 3.1.3 \#4(a) | change "Propositions, Theorems, Lemmas, and Corollaries" to "A Brief Sermon about Definitions" | John Bretscher |
| 10-01-2018 | 96 | Last line | change "positive" to "nonnegative" | John Bretscher |
| 10-01-2018 | A43 | Exercercises 3.3.10 \#3 | "There are no even primes" should be "There are no even primes greater than 2" | John Bretscher |
| 10-01-2018 | 117 | Example 3.23 | The sequence using 7xn+1 does not include 9. I should have used xn+1 = xn+8 mod 11. This will change the sequence starting with x0 = 0 to 0,8,5,2,10,7,4,1,9,6,3 and the sequence with x0 = 4 to 4,1,9,6,3,0,8,5,2,10,7. Figure 3.4 will need to be updated | John Bretscher |
| 10-01-2018 | 164 | Quick Check 3.8 \#1 | "2, 3, and 5" should be "3, 5, and 7" | John Bretscher |
| 10-01-2018 | 128 | Paragraph 3 | "Proposition 3.12" should be "Theorem 3.12" | John Bretscher |
| 10-01-2018 | 127 | Sixth paragraph, sentence 1 | Missing the closing parenthesis. | John Bretscher |
| 10-02-2018 | 148 | Proposition 3.68 | "unique" would be better as "predetermined" | John Bretscher |
| 10-02-2018 | 149 | Conclusion, line 2 | change "by the inductive step)" to "(by the initial conditions)" | John Bretscher |
| 10-02-2018 | 160 | Penultimate line | remove the second comma | John Bretscher |
| 10-02-2018 | 162 | Exercise | change "integers where" to "integers with prime factorizations" | John Bretscher |
| 10-02-2018 | A47 | Exercise 37, the last two simplifications | "3k2+k" should be "3k2+5k" | John Bretscher |
| 10-02-2018 | 127 | line 2 | Swap "encryption key" and "decryption key". It should read: "decryption key is kept secret. Both the encryption key …" | John Bretscher |
| 10-02-2018 | 127 | paragraph 3, line 2 | swap private key and public key | John Bretscher |
| 10-02-2018 | 131 | Exercise 23 | "d=5" should be "e=5" | John Bretscher |
| 10-02-2018 | 131 | Exercise 24 | "d=5" should be "e=5" | John Bretscher |
| 10-02-2018 | 131 | Exercise 25 | "d=403" should be "e=403" | John Bretscher |
| 10-02-2018 | A44 | Exercise 23(c) | The exponents on the left should all be 29, not 5. Delete the middle column. | John Bretscher |
| 10-06-2018 | 131 | Exercise 24(b) | Replace "299 359 90 174 241 35" with "92 53 199 242 388 256" | Eric Gossett |
| 10-06-2018 | 189 | Definition 4.9, line 2 | "It is defined" would be clearer as "It exists" | Eric Gossett |
| 10-07-2018 | 174 | Example 4.6 | "i=0" should be "i==0" | John Bretscher |
| 10-07-2018 | 178 | Comment in line 4 of threes | change "0 to 2*max" to "0 to 2*i" | John Bretscher |
| 10-07-2018 | 215 | Quick Check 4.15 | change "every man who does not shave himself" to "every man who does not shave himself, and only those men" | John Bretscher |
| 10-07-2018 | 219 | line 3 | The second factor should be "n-((5-sqrt(41))/2)" - change the two + signs to - signs | John Bretscher |
| 10-15-2018 | 232 | The line above Example 5.18 | Exercise 43 is actually on page 239 | John Bretscher |
| 10-15-2018 | 242 | Quick Check 5.6 #4 | My intent is clearer if "loyal to one election-day source for listening": is changed to "loyal to one election-day source for listening (once a choice is made)" | John Bretscher |
| 10-15-2018 | 247 | Exercise 33 | To avoid ambiguity, change "bring a date" to "bring a female date" | John Bretscher |
| 10-15-2018 | 258 | Last line of exercise 22 | "b < a" should be "a < b" | John Bretscher |
| 10-15-2018 | 266 | Exercise 23 | My intention is clearer if "have eight consecutive 0s" is changed to "have at least eight consecutive 0s" | John Bretscher |
| 10-15-2018 | 271 | Notation table, n! | change "footnote 3.20" to "Definition 3.20" | John Bretscher |
| 10-16-2018 | A90 | Column 3 | I added an index entry (pointing to page 203) for the visible space character, ␣ | Eric Gossett |
| 10-19-2018 | A53 | Exercises 5.2.3 #15 | I should have explicitly mentioned the Independent Tasks Principle when forming the products k C(n,k) and n 2n-1. | Eric Gossett |
| 10-27-2018 | 428 | line 4 from the bottom of the proof of Theorem 8.10 | It would be clearer if "at least one object" is changed to "at least one other object" | Eric Gossett |
| 10-29-2018 | 332 | Figure 7.3, line 5 | should be "return 1·factorial(0)" | John Bretscher |
| 10-29-2018 | 338 | SubsetSum algorithm | lines 15 and 16 should be swapped (to match the explanation at the top of the page) | John Bretscher |
| 10-29-2018 | 340 | colorSquare line 7 | "region" should be "current_region" | John Bretscher |
| 10-29-2018 | A59 | Page 5: [3.25,5.5] | line 2 should be "S(f, 3.25, 4.375)" | John Bretscher |
| 10-29-2018 | 351 | Line 1 of Example 7.14 | "Definition 3.56" should be "definition 3.57" | John Bretscher |
| 10-29-2018 | 353 | Line 2 from the bottom | Change 'The answer is yes.' to 'The answer is often "yes'." | John Bretscher |
| 10-29-2018 | 365 | The final sentence of Example 7.27 | Would be clearer as "The proof by mathematical induction is still needed (recall a similar need at the end of Example 3.38). | John Bretscher |
| 10-29-2018 | 369 | Example 7.31, line 1 | change "A linear homogeneous recurrence relation" to "A degree 3 linear homogeneous recurrence relation" | John Bretscher |
| 10-29-2018 | A60 | Exercises 7.2.5 4(c), line 5 | delete the "+(n-2))" at the front of that line | John Bretscher |
| 10-29-2018 | A60 | Exercise 7.2.5 4(c), final expression in column 2 | the coefficient of the final summation (k = 1 to 1) should be 1/5^(n-1), not 1/5^n | John Bretscher |
| 10-29-2018 | 381 | The second equation from the bottom | change "4f(n/4^4)" to "4g(n/4^4)" | John Bretscher |
| 10-29-2018 | A62 | Exercises 7.4.1 5. (b) | "The series starts" should be in front of the word "as" near the bottom | John Bretscher |
| 10-29-2018 | A62 | Exercises 7.4.1 9. (b) line 1 | the word "so" should be in front of "A(z) - a0 = " in line 4 | John Bretscher |
| 10-29-2018 | A63 | Exercises 7.4.1 18. (a), final generating function | Change "+(-1)^n" to "-(-1)^n" on both sides of the equation | John Bretscher |
| 10-29-2018 | 415 | In step 3 of the box at the bottom of the page | δ2 is missing the subscript | John Bretscher |
| 10-29-2018 | 386 | Under case 2, the first line of a=bk | nν should be (bk)ν: f(bk) = d ak + c (bk)ν k | John Bretscher/Eric Gossett |
| 10-29-2018 | 387 | the line below a > bν | should be f(n) < α a mlogb(a) - β bν mν < α a mlogb(a) < α a nlogb(a) | John Bretscher/Eric Gossett |
| 10-29-2018 | 387 | the first line below a < bν | f(n) = should be f(n) < | John Bretscher |
| 10-29-2018 | 387 | the sixth line below a < bν | f(n) ≥ should be f(n) > | Eric Gossett |
| 10-29-2018 | 388 | top left margin | f(n) ≥ should be f(n) > | Eric Gossett |
| 10-29-2018 | 388 | lines 2 and 8 | f(n) ≥ (line 2) and f(n) = (line 8) should both be f(n) > | John Bretscher/Eric Gossett |
| 11-04-2018 | A71 | Exercises 10.1.3 # 2(a) | Gn,m is also bipartite if either n = 1 or m = 1 | John Bretscher |
| 11-04-2018 | 608 | Exercises 10.1.3 # 21(b) | cycle has not yet been defined. Look at Definition 10.14 for that definition. | John Bretscher |
| 11-04-2018 | 619 | In the captions and discussion of Figures 10.5 and 10.6 | change "and vertices" to "(and their incident vertices)" | John Bretscher |
| 11-04-2018 | 619 | Line 1 of the final paragraph | Change "The only remaining" to "One remaining" | John Bretscher |
| 11-04-2018 | 647 | Line 2 under The c1--c3 chain anchored at v1 includes v3 | "Figure 10.77" should be "Figure 10.79" | John Bretscher |
| 11-04-2018 | 653 | Line 1 in Definition 10.64 | There is a missing space before the word if | John Bretscher |
| 11-04-2018 | A74 | Exercises 10.6.3 # 12(a) | The vertex labels under P are missing | John Bretscher |
| 11-04-2018 | 606 | The Family of Hypercubes, line 1 | Change "hypercube on n vertices" to "hypercube of dimension n" | John Bretscher |
| 11-04-2018 | 671 | Hn | Change "hypercube on n vertices" to "hypercube of dimension n" | John Bretscher |
| 11-09-2018 | 691 | Exercise 10, line 1 | Change "infix-to-prefix" to "infix-to-postfix" | John Bretscher |
| 11-09-2018 | 692 | Line 2 under Parse Trees | Change "derivations consist" to "a derivation consists" | John Bretscher |
| 11-09-2018 | 699 | Quick Check 11.7 1(a) | "constant width encoding" should be "constant-width encoding" | John Bretscher |
| 11-09-2018 | 701 | Character Data, last line of paragraph 1 | Change 'between the "paragraph elements' to 'between the opening and closing "paragraph" element tags' | John Bretscher |
| 11-09-2018 | 714 | Figure 11.49 | The "10" line should be bolded. | John Bretscher |
| 11-09-2018 | 729 | m | This symbol was introduced on page 676, not 677 | John Bretscher |
| 11-09-2018 | 729 | h | This symbol was introduced on page 675, not 677 | John Bretscher |
| 11-09-2018 | 709 | Exercise 10 | "constant width encoding" should be "constant-width encoding" | John Bretscher |
| 11-09-2018 | 709 | Exercise 11 | The "i" over 001 should be italicised | John Bretscher |
| 11-10-2018 | 675 | Line 1 of Definition 11.9 | Change "The height of a rooted tree" to "The height, h, of a rooted tree" | Eric Gossett |
| 11-10-2018 | 518 | Exercise 19, Proposition 8.76 | Change R(1,j;2) to R(1,k;2) | Eric Gossett |
| 11-16-2018 | A78 | Exercises 12.2.3 #7(a), reflexive closure and transitive closure | (b,d) should be (b,c) | John Bretscher |
| 11-16-2018 | A79 | Exercises 12.3.6 #6(a) | The title should be "Yearbook*Newspaper" | John Bretscher |
| 11-16-2018 | 771 | Exercise 11(d) | Joaquín Rodrigo was born in 1901 | John Bretscher |
| 11-16-2018 | 782 | Line 4 after "another 10 steps" | The second occurrence of x2⋅x1⋅x3⋅x4 should be x2⋅x1⋅x3⋅x4 | John Bretscher |
| 11-16-2018 | 782 | Line 4 after "the individual terms can now" | The second occurrence of x1⋅x2⋅x3⋅x4 should be x1⋅x2⋅x3⋅x4 | John Bretscher |
| 11-16-2018 | 783 | Line 4 after "that expression is repeated here" | The second occurrence of x1⋅x2⋅x3⋅x4 should be x1⋅x2⋅x3⋅x4 | John Bretscher |
| 11-16-2018 | 783 | Line 5 after "the minterms can be sorted" | The second occurrence of x1⋅x2⋅x3⋅x4 should be x1⋅x2⋅x3⋅x4 | John Bretscher |
| 11-16-2018 | A80 | Exercises 12.4.4 14(b), third line from the bottom | Insert a "+" between x3 and x1 | John Bretscher |
| 11-16-2018 | A81 | Second line from the bottom. | Change to "There are no duplicate minterms to remove." | John Bretscher |
| 11-16-2018 | A83 | Exercise 13, line 5 | "value 0 if person" should be "value 0 if the person" | John Bretscher |
| 11-16-2018 | A83 | Exercise 13, Phase 2, the -11 line in the table | The Xs should be under 1 and 3, not 2 and 3 | John Bretscher |
| 11-27-2018 | 631 | Exercises 10.4.3 #1(e) | Add a note: "There is no incidence matrix for part (e)." | Blake Burgstahler |
| 11-27-2018 | 630 | bottom line | v0 should be v1 | Anit Chumber |
| 11-28-2018 | 323 | Quick Check 6.4 #4, parenthetical remark | Should be "There are two situations where the subjective probability becomes precise: If you are the only student and all four of your grandparents are currently living(deceased), the probability is 1(0)." | John Bretscher |
| 11-28-2018 | A54 | Exercises 6.1.3 #10 | The title should be "Rolling a Pair of Dice" | John Bretscher |
| 11-28-2018 | 287 | Section 6.2.2, paragraph 2, lines 3 and 4 | The sentence is clearer if stated as: "For example, if A and B are events, the event A∧B is the logic operator notation for the collection of outcomes in which both the event A and the event B occur." | John Bretscher/Eric Gossett |
| 11-28-2018 | 287 | Section 6.2.2, paragraph 2, line6 | Clearer if stated as: "event A∨B is the logic operator notation for the collection of outcomes in which one (or both) of the events occur." | Eric Gossett |
| 11-28-2018 | 290 | Quick Check 6.7 #4 | "scissor" should be "scissors" | John Bretscher |
| 11-28-2018 | 301 | Exercise 20(d) | The two middle sentences should be punctuated as: "If doubles occur, player A wins. If the sum of the digits on the two dice is either 3 or 9, player B wins." | John Bretscher |
| 11-28-2018 | 325 | Quick Check 6.10 # 2. | There were some mysterious font changes in the diagram. The "1s" floating between arrows should be plus signs. The numbers 250, 225, and 27.5 should be -50, -25, -7.5 (so minus signs became 2s). | John Bretscher/Eric Gossett |
| 11-28-2018 | 310 | Section 6.5, paragraph 2, the e4nd of line 4 | "denote" should be "denoted" | John Bretscher |
| 11-28-2018 | 311 | Example 6.45 | "scissor" should be "scissors" | John Bretscher |
| 11-28-2018 | 326 | Quick Check 6.14 #3, line 2 | change "$100 prize" to "$500 prize" | John Bretscher |
| 11-28-2018 | 327 | Quick Check 6.16 #2, parts (b) and (c) | The numerator in part (b) should be P(B2)P(A | B2), the numerator in part (c) should be P(B3)P(A | B3) | John Bretscher |
| 11-28-2018 | A59 | Exercises 6.6.1 # 19(c) | The numerator should be "P(O)⋅P(L|O)" | John Bretscher |
| 11-28-2018 | 327 | Section 6.8.1, paragraph 2, line 2 | Change "independence" to "outcome" | John Bretscher |
| 12-19-2018 | 443 | Line 1 | remove the comma | John Bretscher |
| 12-19-2018 | 463 | Line 4 | change "in three lines each day" to "in the prescribed mix each week" | John Bretscher |
| 12-19-2018 | 463 | Second to last line | change "40" to "20" | John Bretscher |
| 12-19-2018 | 478 | line 5 | append ", else 0" to the end of the comment | John Bretscher |
| 12-19-2018 | A66 | Exercise 10, first table | "jean skirt" should be "skirt" | John Bretscher |
| 12-19-2018 | 491 | Decoding, line 3 | Remove the comma after "but x6" | John Bretscher |
| 12-19-2018 | 491 | Line 4 from the bottom | change "Table 8.42" to "Table 8.48" | John Bretscher |
| 12-19-2018 | 492 | Line 5 in first full paragraph | change "Table 8.42" to "Table 8.48" | John Bretscher |
| 12-19-2018 | 528 | Quick Check 8.18, second to last line | "212 + 211" should be "212 · 211" | John Bretscher |
| 12-19-2018 | A67 | Exercise 18(a) | "8192/235" to "16384/470" | John Bretscher |
| 12-19-2018 | 515 | Example 8.58, last paragraph, line 2 | "C3" should be "C{3}" | John Bretscher |
| 12-19-2018 | 446 | (5 or 6) → 1, line 2 | It is clearer to change "It must contain at least 2 points." to "It must contain at least 3 points (Lemma 8.24)." | John Bretscher |
| 12-26-2018 | 548 | Example 9.11 | The input symbol "0" should be removed (and the corresponding input columns as well) | John Bretscher |
| 12-26-2018 | 548 | Figure 9.8 | The input symbol "0" should be removed from the 6 loops | John Bretscher |
| 12-26-2018 | 549 | Figure 9.9 | The start state should be labeled as "S∅" | John Bretscher |
| 12-26-2018 | 553 | Exercise 20 | Change "third letter" to "third character" | John Bretscher |
| 12-26-2018 | A69 | Exercise 9.3.2 # 13, second paragraph | Change "s is the concatenation if n strings" to "s is the concatenation of n strings" | John Bretscher |
| 12-26-2018 | 565 | Second to last paragraph | Change "It will then match an arbitrary" to "It will then match rate and an arbitrary" | John Bretscher |
| 12-26-2018 | 585 | Example 9.37, line 2 | There should be a closing parenthesis after "(for example Ab" | John Bretscher |
| 9-14-2019 | 89 | Example 3.4 | "immediate consequence of Theorem 3.73" should be "immediate consequence of Lemma 3.75" | Eric Gossett |
| 10-10-2019 | 204 | Line 9 of text from the bottom (the first bullet point) | change "the second position of the pattern" to "the second position of the text" | Eric Gossett |
| 10-16-2019 | 218 | Quick Check 4.4, third line from bottom | "if n > 5" should be "if n ≥ 5" | Cody Anderson |
| 10-16-2019 | 219 | Quick Check 4.4, line 1 | "Definition 4.2" should be "Definition 4.3" | Cody Anderson |
| 9-12-2020 | 65 | The line above Definition 2.32 | "Proposition 2.18 (page 30)" should be "Proposition 2.20 (page 31)" | Jed Yang |
| 9-17-2020 | 90 | Proof of Theorem W | Insert between lines 2 and 3: "Point C is not on line AB (Axiom 2)."; change: "The line through C and parallel to AB contains a second point" to "The line through C and parallel to AB contains a point other than C" | Jed Yang |
| 9-17-2020 | 90 | Proof of Theorem X | change: "Thus there are at least six lines." to "Thus there are at least six lines (using Axiom 2 to assert that they are distinct)." | Jed Yang |
| 9-18-2020 | 99 | Definition 3.21 | The definitions would be clearer if "the largest integer" were changed to "the only integer" in both definitions. | Jed Yang |
| 9-22-2020 | 114 | Example 3.21 | Add this sentence to the end of the paragraph at the top of "phase 2": "The equations expand the GCD (5) into 245(s)+90(t) = 245(7) + 90(-19)." | Jed Yang/Eric Gossett |
| 9-22-2020 | 120 | Theorem 3.44 part 1. | replace "if gcd(a,m) > 1, a has no inverse, mod m" with if gcd(a,m) > 1, then a has no inverse, mod m" | Jed Yang |
| 10-03-2020 | 190 | Line 12 of the proof | change "is a positive number (true in" to "is a positive number -- assuming ak > 0 (true in" | Jed Yang |
| 10-31-2020 | 258 | Exercise 23 | "n choose 2" should be "n+1 choose 2" | Jed Yang |
| 10-31-2020 | 262 | Theorem 5.27, line 5 of the proof | The summation should start with i=1, not i=0 | Jed Yang |
| 11-09-2020 | 555 | Definition 9.8 | Bullet points 1,2 and 4: change "An" or "A" to "A finite" | Jed Yang |
| 11-09-2020 | 543 | Definition 9.3 | Bullet point 2: change "A set" to "A finite set" | Jed Yang |
| 11-11-2020 | 579 | Second paragraph under "Proof Highlights" | change "A_X, A_Y, and so on. that can be" to "A_X, A_Y, and so on that can be" (remove the extraneous period) | Jed Yang |
| 11-11-2020 | 585 | Example 9.37, line 2 | replace "are the N" with "are denoted α at the top of Table 9.9" | Jed Yang |
| 11-11-2020 | 588 | Several changes | Jed Yang noticed that the Turing machine listed here will incorrectly accept strings like abcabc or aabbccabc. A new state, s4 is needed. Once the final sweep commences (there are no more as), enter that state and look for a valid end of input. In the final list of productions, delete the third and fourth productions for s0. Then add the following productions: <s0, B, B, R, s4>, <s4, B, B, R, s4>, <s4, C, C, R, s4> <s4, λ, λ, S, f>. The corrected page is available. | Jed Yang |
| 11-12-2020 | A70 | Exercises 9.4.3 #18 | Delete the first sentence. Replace the final paragraph with "A regular expression that ensures a string is not present is beyond this brief introduction. Here is Jed Yang's solution: ^([^P]|P((e(r(c(i(va?)?)?)?)?)?P)*([^Pe]|e[^Pr]|er[^Pc]|erc[^Pi]|erci[^Pv]|erciv[^Pa]|erciva[^Pl]))*(P((e(r(c(i(va?)?)?)?)?)?P)*(e(r(c(i(va?)?)?)?)?)?)?$ | Jed Yang |
| 11-17-2020 | 623 | the second full paragraph | After "middle of the cycle).", insert the sentence "For notational convenience, make the identification wn+1 = w1." | Jed Yang |
| 11-20-2020 | 639 | Definition 10.45 | change "vertices, edges, and faces" to "vertices, edges, and polygons, called faces" | Jed Yang |
| 11-20-2020 | 639 | Definition 10.46 | change "A polyhedron is regular if" to "A convex polyhedron is regular if" and change "The faces are all congruent" to "the faces are all congruent regular polygons" | Jed Yang |
| 11-20-2020 | 643 | The comments below Definition 10.49 | Insert the following sentence at the front of the paragraph: "Two vertices in V* will share multiple edges in E* if there are multiple edges in E that separate their respective regions in G." | Jed Yang |
| 11-21-2020 | 383 | The comments below Theorem 7.16 | Delete the second comment; change "Three" to "Two" and change "third" to "second") | Jed Yang |
| 11-25-2020 | 675 | Definition 11.10 | insert " (see Definition 11.11 on page 676)" after "For binary trees". | Jed Yang |
| 11-25-2020 | 678 | Corollary 11.15 | the title should be "Complete m-ary Trees" | Jed Yang |
| 11-25-2020 | 686 | The sentence before Theorem 11.25 | Drop the phrase "in a best case situation" | Jed Yang |
| 11-25-2020 | 686 | Theorem 11.25 | In line 1, change "Θ(log2 n)" to "O(log2 n)". In line 2, change "Θ(nlog2 n)" to "Ω(nlog2 n)" | Jed Yang |
| 11-25-2020 | 687 | line 4 from the bottom | change "Θ(nlog2(n))" to "Ω(nlog2(n))" | Jed Yang |
| 11-25-2020 | 687 | line 8 from the bottom | change "less" to "fewer" | Jed Yang |
| 12-01-2020 | 127 | the beginning of line 2 of paragraph 5 | Italicize the words "private" and "encrypt" | Jed Yang |
| 12-01-2020 | 129 | lines 7, 8, 11, 12 | Some subscripts at the start of the lines are incorrect. Should be c2=m2e; c3=m3e; m2=c2d; m3=c3d | Jed Yang |
| 12-03-2020 | 692 | Line 4 in section 11.3.1 | "𝒢={Σ, Δ, S, Π}" should be "𝒢=(Σ, Δ, S, Π)" | Jed Yang |
| 12-03-2020 | 693 | Examples 11.12 and 11.13 | "𝒢={Σ, Δ, S, Π}" should be "𝒢=(Σ, Δ, S, Π)" | Jed Yang |
| 12-03-2020 | 708 | Exercises 1 and 3 | "𝒢={Σ, Δ, S, Π}" should be "𝒢=(Σ, Δ, S, Π)" | Jed Yang |
| 12-03-2020 | 709 | Exercises 4, 5, and 6 | "𝒢={Σ, Δ, S, Π}" should be "𝒢=(Σ, Δ, S, Π)" | Jed Yang |
| 12-03-2020 | 721 | Paragraph 2, line 2 | change "four-sided cycle" to "newly-created cycle" | Jed Yang |
| 12-15-2020 | 655 | Line 1 of section 10.6.2, sentence 1 | Change "contain numeric labels" to "contain nonnegative numeric labels" | Jed Yang |
| 12-15-2020 | 660 | Add a sentence to the end of the first paragraph (above "Inductive Hypothesis"): | Define v1 = | Jed Yang |
| 12-18-2020 | 660 | The first bullet point under "Inductive Step" | Insert after sentence 1: "Hypothesis 2 from the previous iteration implies that d(a,vj) ≤ d(a,r). Thus, a path from a to u cannot be the shortest path if it includes r in a position that is not adjacent to u." | Jed Yang |
| 12-18-2020 | 661 | The first bullet point | Replace it with: "For u ∉ B, d(a,u) is the distance for an actual path a v2 · vk u, which is at least the distance of the initial segment a v2 · vi, stopping at the first vertex vi not in B-{x}. This initial segment has distance at least dn(vi) by the first inductive assertion (already proven). The choice of x in line 19 ensures that dn(vi) ≥ dn(x). Finally, the estimated length dn(x) is constructed by successively adding actual edge weights (line 14), so dn(x) represents the distance for an actual path, so dn(x) ≥ d(a,x). Thus, d(a,u) ≥ dn(vi)) ≥ dn(x) ≥ d(a,x), completing the proof of the second inductive hypothesis. " | Jed Yang |
| 4-13-2021 | 669 | The table in Quick Check 10.15, line 3, the two c columns | Insert an 8 below the 9 and an e below the d | Grace Hsieh |
| 9-14-2021 | 62 | Line 14 | delete the phrase "or by the biconditional ↔" | Jed Yang |
| 11-24-2021 | 618 | Definition 10.25 | Add footnote a to "without loops.": Loops could be allowed. When a vertex with loops is encountered, traverse all of them before moving to another vertex. Loops do not change the existence or non-existence of Euler trails and circuits. | Jed Yang |
| 9-14-2022 | A42 | Exercises 2.6.2, Exercise 9(b) | The first line is incorrect. It should look like the final line. | Caden DeWall |
| 10-03-2022 | A52 | Exercise 30(b) | Replace lines 2 and 3 with: "The empty set and one-person subsets are not really teams. There are thus 2n - n - 1 ∈ O(2n) possible teams." | Michael Opheim |
Last Updated (m-d-y): 10-4-2022