Discrete Mathematics with ApplicationsSusanna Epp's DISCRETE MATHEMATICS WITH APPLICATIONS, FOURTH 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. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

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
Review: Discrete Mathematics with Applications
User Review  Saad  GoodreadsBest book on discrete math. Learnt a lot! Will also come handy for reference. Read full review
Contents
SPEAKING MATHEMATICALLY  1 
THE LOGIC OF COMPOUND STATEMENTS  23 
THE LOGIC OF QUANTIFIED STATEMENTS  96 
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF  145 
SEQUENCES MATHEMATICAL INDUCTION AND RECURSION  227 
SET THEORY  336 
FUNCTIONS  383 
RELATIONS  442 
COUNTING AND PROBABILITY  516 
Common terms and phrases
2010 Cengage Learning A U B algebra algorithm argument array binary Boolean codomain contain contradiction contrapositive copied Copyright 2010 Cengage counterexample defined definition denoted digits divisible domain Due to electronic duplicated eBook and/or eChapter(s electronic rights equal equation equivalence classes Example exercise factor false Figure Find finite finitestate automaton given Hence Hint inductive hypothesis input inverse iteration least log2 logically equivalent loop mathematical induction multiplication negation nonnegative integer notation number of elements obtained odd integer onetoone ordered pairs output particular but arbitrarily pigeonhole principle positive integer positive real numbers prime number proof rational number real numbers recurrence relation recursively regular expression Rights Reserved scanned Section sequence shown Solution spanning tree square strings subsets Suppose suppressed symbol Theorem third party content total number transitive truth table truth values variables vertex vertices whole Write