## 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 upper-level mathematics courses. |

### What people are saying - Write a review

#### LibraryThing Review

User Review - TheNinthwave - LibraryThingI found the layout to be confusing and the examples and explanations to be thin, what was not covered in the course was hard to glean directly from the book. This book should have included more of the ... Read full review

User Review - Flag as inappropriate

very good

### Contents

The Logic of Compound Statements | 1 |

The Logic of Quantified Statements | 75 |

Elementary Number Theory | 125 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

algebra algorithm answer argument array binary relation Boolean chosen co-domain commutative law contain contradiction contrapositive counterexample decimal defined definition denoted digits divisible domain equal equation equivalence classes equivalence relation Example F F F F T F factor false Figure Find finite finite-state automaton formal function given Hence Hint inductive hypothesis input inverse iteration language least Lemma length 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 one-to-one output partial order partition pigeonhole principle positive integer positive real numbers prime number probability proof property is true Prove rational number real numbers recurrence relation recursive reflexive 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