Discrete mathematics with applications /
Epp, Susanna S.,
Discrete mathematics with applications / by Susanna S. Epp - FIFTH EDITION, METRIC EDITION - xxii, 871 pages, [A-141] : illustrations (some color) ; 27 cm
Includes index.
This book contains topics on: Speaking Mathematically, The Logic of Compound Statements, The Logic of Quantified Statements, Elementary Number Theory and Methods of Proof, Sequences, Mathematical Induction, and Recursion, Set Theory, Properties of Functions, Properties of Relations, Counting and Probability, Theory of Graphs and Trees, Analysis of Algorithm Efficiency, Regular Expressions and Finite-State Automata, Appendix A: Properties of the Real Numbers, and Appendix B: Solutions and Hints to Selected Exercises.
"This book 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." --Publisher
9780357114087 0357114086
2018953604
Mathematics.
QA39.3 / .E65 2020
510 / 510 Ep71 2021
Discrete mathematics with applications / by Susanna S. Epp - FIFTH EDITION, METRIC EDITION - xxii, 871 pages, [A-141] : illustrations (some color) ; 27 cm
Includes index.
This book contains topics on: Speaking Mathematically, The Logic of Compound Statements, The Logic of Quantified Statements, Elementary Number Theory and Methods of Proof, Sequences, Mathematical Induction, and Recursion, Set Theory, Properties of Functions, Properties of Relations, Counting and Probability, Theory of Graphs and Trees, Analysis of Algorithm Efficiency, Regular Expressions and Finite-State Automata, Appendix A: Properties of the Real Numbers, and Appendix B: Solutions and Hints to Selected Exercises.
"This book 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." --Publisher
9780357114087 0357114086
2018953604
Mathematics.
QA39.3 / .E65 2020
510 / 510 Ep71 2021