
- English
- PDF
- Available on iOS & Android
Discrete Mathematics with Applications, Metric Edition
About this book
DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Contents
- Preface
- Chapter 1: Speaking Mathematically
- Chapter 2: The Logic of Compound Statements
- Chapter 3: The Logic of Quantified Statements
- Chapter 4: Elementary Number Theory and Methods of Proof
- Chapter 5: Sequences, Mathematical Induction, and Recursion
- Chapter 6: Set Theory
- Chapter 7: Properties of Functions
- Chapter 8: Properties of Relations
- Chapter 9: Counting and Probability
- Chapter 10: Theory of Graphs and Trees
- Chapter 11: Analysis of Algorithm Efficiency
- Chapter 12: Regular Expressions and Finite-State Automata
- Appendix A: Properties of the Real Numbers
- Appendix B: Solutions and Hints to Selected Exercises
- Index