Discrete mathematics with applicationsSusanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book 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 the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upperlevel mathematics courses. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

User Review  Flag as inappropriate
very good
Review: Discrete Mathematics with Applications
User Review  Arvydas Sidorenko  GoodreadsThis is literally the best beginners book on discrete math you can find. I have looked into dozens of different materials and this one is proved to be the best. Very detailed and intuitive explanations, 2000+ exercises with answers in total. This is THE book on Discrete Mathematics! Read full review
Contents
The Logic of Compound Statements  1 
The Logic of Quantified Statements  75 
Elementary Number Theory  125 
Copyright  
11 other sections not shown
Common terms and phrases
A U B algebra algorithm answer argument array binary relation Boolean chosen codomain commutative law contain contradiction contrapositive counterexample defined definition denoted digits divisible equal equation equivalence classes equivalence relation Example F F F F T F factor false Figure Find finite finitestate automaton formal function given Hence Hint inductive hypothesis input inverse iteration language least Lemma log2 logically equivalent loop mathematical induction minimum spanning tree modulo modus ponens modus tollens multiplication negation nonnegative integer notation number of elements obtained odd integers onetoone output partial order partition pigeonhole principle positive integer positive real numbers prime number proof property is true Prove rational number real numbers recurrence relation recursive regular expression result Section sequence shown Solution spanning tree strings subsets substitution Suppose symbol Theorem total number transitive truth table truth values variables vertex vertices Write