#  Reviews and Errata for Lewis&Zax, Essential Discrete Mathematics for Computer Science 

 



## **Reviews**

1. [European Mathematical Society](https://euro-math-soc.eu/review/essential-discrete-mathematics-computer-science-0) (Narciso Marti Oliet)
2. [European Mathematical Society](https://euro-math-soc.eu/review/essential-discrete-mathematics-computer-science) (Adhemar Bultheel)
3. [SIGACT News](https://dl.acm.org/doi/10.1145/3406678.3406681) (Bill Gasarch)

### **Errata**

1. p. 47, Exercise 4.7. Assume that if p | q1…qn and p, q1, …, qn are all prime, then p = qi for some i.
2. p. 122, Exercise 12.6(a): Actually the formula is unsatisfiable, since the second conjunct is self-contradictory if u=v. Excercise 12.7: Change the first line to ∀x∀y(x≠y ⇒ (P(x,y) ⇔ P(y,x))).
3. p. 145. The term "equivalence class" is used in the statement of Theorem 14.2 but not defined until the summary on p. 147.
4. p. 195, caption of Figure 19.10. "NFA" -> "NDFA".
5. p, 299. Delete the word "Add" from the statement of Theorem 26.4.
6. p. 336, first line of equation (29.1). An equals sign is missing just before the large left parenthesis.

### **Errata in Polish edition**

1. Problem 1.2. The last sentence should read

> Podaj przykład **lub** wyjaśnij dlaczego jest to **niemożliwe**.