Discrete Mathematics with Applications

Key differences between 4th and 3rd editions

• Period between current and previous editions: 7 years (2010 vs 2003).
• The First Ed. of Epp's Discrete Mathematics with Applications appeared in 1994.
• The Fourth Ed. is available in electronic book format.
• About 300 new exercises have been added to the Fourth Ed.
• Additional full answers have been incorporated into Appendix B "Solutions and Hints to Selected Exercises".
• Chapter 1 "Speaking Mathematically" introduces some of the precise language that is a foundation for much mathematical thought
• Variables
• The Language of Sets
• The Language of Relations and Functions
• Chapter 3
• New topic "Only If of Universal Conditional Statements"
• Chapter 4 includes new topics:
• Variations among Proofs
• Absolute Value and the Triangle Inequality
• Chapter 5 "Sequences, Mathematical Induction, and Recursion" covers material which in the previous edition was presented in two separate chapters "Sequences and Mathematical Induction" and "Recursion"
• Chapter 6:
• New discussion on Proof and Disproof
• Chapter 7:
• Increased coverage of functions of more than one variable and of functions acting on sets.
• Chapter 8 includes new topics:
• Extending the Euclidean Algorithm
• RSA Cryptography
• Chapter 10:
• New material on Dijkstra's Shortest Path Algorithm
• New exercises on o graph coloring.
• Updated terminology about traveling in a graph
• Chapter 11 "Analysis of Algorithm Efficiency" includes material from the former chapter "The Efficiency of Algorithms"
• New topic on Binary Search
• Chapter 12:
• New topic "The Language Defined by a Regular Expression"