Discrete Mathematics – Johnsonbaugh – 6th Edition


This book and its solution were designed for an introductory course in Discrete Mathematics, the prerequisites of formal mathematics are minimal; no calculation is required. There are no requirements of computer science. The book includes examples, exercises, figures, tables, problem solving sections, sections containing suggestions for problem solving, review sections, notes, chapter review, self-assessments, and computer exercises to help the student to master discrete mathematics.

This edition, like the previous ones, includes topics like algorithms, combinatorics, sets, functions and mathematical induction to cover the needs of these groups. It also takes into account the understanding and construction of evidence and, in general, the reinforcement of mathematic maturity.

Table of Contents

1. Logic and Proofs.
2. The Language of Mathematics
3. Relations.
4. Algorithms.
5. Introduction to Number Theory.
6. Counting Methods and the Pigeonhole Principle.
7. Recurrence Relations.
8. Graph Theory.
9. Trees.
10. Network Models.
11. Boolean Algebras and Combinatorial Circuits.
12. Automata, Grammars, and Languages.
13. Computational Geometry.

No Comments

  • And now, tell us what you think about this publication. Have you found it useful? Which of the topics in the book did you find most helpful? Tell us your opinion! And please, remember that keeping this site updated so you can enjoy the content requires time and effort 😉.

Notify of

Send this to a friend