Discrete Mathematics – Johnsonbaugh – 6th Edition


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

This edition, like the previous ones, includes topics like , 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 Content

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

  • Feedback: Leave your comments here!

    Your opinions and comments would be greatly appreciated.
    If you have comments or questions we've added this section so that we might have a dialogue with you.

Complete all fields

6 − 4 =