## 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 upper-level 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

#### 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

really helpfull i couldnt get it from any where thanks but one problem most the pages are omitted here plllzzzz also update those pages

### 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 |

### Other editions - View all

### Common terms and phrases

2010 Cengage Learning A U B algebra algorithm argument array binary Boolean co-domain 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 finite-state 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 one-to-one 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