Discrete Mathematics – Johnsonbaugh – 6th Edition


This and its were designed for an introductory course in Discrete Mathematics, the prerequisites of formal are minimal; no is required. There are no requirements of science. The includes examples, exercises, figures, tables, sections, sections containing suggestions for problem solving, review sections, notes, chapter review, self-assessments, and 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.

View more
  • 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.
  • Citation

Leave us a comment1 Comment

1 Comment
Inline Feedbacks
View all comments
15/03/2020 8:50 am

Thanks for the manual solution

Would love your thoughts, please comment.x