Discrete Mathematics with ApplicationsSusanna Epp's Discrete Mathematics with Applications, Second Edition provides a clear introduction to discrete mathematics. Epp has always been recognized for her lucid, accessible prose that 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. The text is suitable for many course structures, including onesemester or fullyear classes. Its emphasis on reasoning provides strong preparation for computer science or more advanced mathematics courses. 
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  Trip  GoodreadsMakes the concepts easy to grasp. Read full review
Contents
The Logic of Compound Statements i  1 
The Logic of Quantified Statements  75 
Alternate forms for universal conditional statements Statements containing  96 
Copyright  
21 other sections not shown
Common terms and phrases
1equivalent adjacency matrix algebra algorithm answer array arrow diagram binary relation binary tree connected contain contradiction contrapositive counterexample defined definition denoted digits directed graph divisible endpoint equal equation equivalence classes equivalence relation Euler circuit EXAMPLE F F F F T F false Find finitestate automaton function given graph G Hamiltonian circuit Hasse diagram Hence Hint inductive hypothesis input input/output table isomorphic iteration least Lemma log2 logically equivalent loop mathematical induction matrix minimal spanning tree multiplication negation nextstate nonnegative integer notation number of edges number of elements obtained odd integer onetoone ordered pairs output partial order relation particular but arbitrarily partition pigeonhole principle positive integer prime number proof rational number real numbers recurrence relation reflexive sequence shown in Figure Solution statement strings subset Suppose symbol symmetric terminal vertices Theorem total number transitive true variable vertex