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. |
Contents
Conditional statements The negation of a conditional statement | 25 |
The Logic of Quantified Statements | 75 |
Alternate forms for universal conditional statements Statements containing | 96 |
Copyright | |
19 other sections not shown
Common terms and phrases
a₁ adjacency matrix algebra algorithm answer argument array binary relation binary tree connected contain contradiction contrapositive counterexample defined denoted digits directed graph divisible endpoints equal equation equivalence classes equivalence relation Euler circuit EXAMPLE false Find finite-state automaton function given graph G Hamiltonian circuit Hasse diagram Hence Hint inductive hypothesis input input/output table isomorphic iteration k-equivalence 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 partial order relation partition pigeonhole principle positive integer prime number proof r₁ rational number real numbers recurrence relation reflexive sequence shown in Figure Solution statement step strings subset Suppose symbol symmetric terminal vertices Theorem total number transitive true truth table v₁ variable vertex ез