## 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 one-semester or full-year classes. Its emphasis on reasoning provides strong preparation for computer science or more advanced 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

#### LibraryThing Review

User Review - stevetempo - LibraryThingI love the layout and illustrations. 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

### Other editions - View all

### Common terms and phrases

1-equivalent 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 finite-state 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 next-state nonnegative integer notation number of edges number of elements obtained odd integer one-to-one 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