Discrete mathematics with applications
Susanna 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
We haven't found any reviews in the usual places.
The Logic of Compound Statements
The Logic of Quantified Statements
Elementary Number Theory
12 other sections not shown
Other editions - View all
A U B algebra algorithm answer argument array binary relation Boolean chosen co-domain commutative law contain contradiction contrapositive counterexample defined definition denoted digits divisible 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 integer one-to-one output partial order partition pigeonhole principle positive integer positive real numbers prime number proof property is true Prove rational number real numbers recurrence relation recursive 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