Discrete Mathematics with Applications

  • ISBN13:


  • ISBN10:


  • Edition: 4th
  • Format: Hardcover
  • Copyright: 8/4/2010
  • Publisher: Cengage Learning

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $52.50
    Check/Direct Deposit: $50.00
  • Complimentary 7-Day eTextbook Access - Read more
    When you rent or buy this book, you will receive complimentary 7-day online access to the eTextbook version from your PC, Mac, tablet, or smartphone. Feature not included on Marketplace Items.
  • eCampus.com Device Compatibility Matrix

    Click the device icon to install or view instructions

    Apple iOS | iPad, iPhone, iPod
    Android Devices | Android Tables & Phones OS 2.2 or higher | *Kindle Fire
    Windows 10 / 8 / 7 / Vista / XP
    Mac OS X | **iMac / Macbook
    Enjoy offline reading with these devices
    Apple Devices
    Android Devices
    Windows Devices
    Mac Devices
    iPad, iPhone, iPod
    Our reader is compatible
    Android 2.2 +
    Our reader is compatible
    Kindle Fire
    Our reader is compatible
    10 / 8 / 7 / Vista / XP
    Our reader is compatible
    Our reader is compatible
List Price: $388.99 Save up to $363.99
  • Rent Book $25.00
    Add to Cart Free Shipping


    7-Day eTextbook Access 7-Day eTextbook Access


Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Susanna 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.

Table of Contents

Speaking Mathematically
The Language of Sets
The Language of Relations and Functions
The Logic of Compound Statements
Logical Form and Logical Equivalence
Conditional Statements
Valid and Invalid Arguments
Application: Digital Logic Circuits
Application: Number Systems and Circuits for Addition
The Logic of Quantified Statements
Predicates and Quantified Statements I
Predicatesand Quantified Statements II
Statements with Multiple Quantifiers
Arguments with Quantified Statements
Elementary Number Theory and Methods of Proof
Direct Proof and Counterexample I: Introduction
Direct Proof and Counterexample II: Rational Numbers.
Direct Proof and Counterexample III: Divisibility
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem
Direct Proof and Counterexample V: Floor and Ceiling
Indirect Argument: Contradiction and Contraposition
Indirect Argument: Two Classical Theorems
Application: Algorithms
Sequences, Mathematical Induction, and Recursion
Mathematical Induction I
MathematicalInduction II
Strong Mathematical Induction and the Well-Ordering Principle
Application: Correctness of Algorithms
Defining Sequences Recursively
Solving Recurrence Relations by Iteration
Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients
General Recursive Definitions and Structural Induction
Set Theory
Set Theory: Definitions and the Element Method of Proof
Set Identities
Disproofs and Algebraic Proofs
Boolean Algebras, Russell's Paradox, and the Halting Problem
Properties of Functions
Functions Defined on General Sets
One-to-one, Onto, Inverse Functions
Composition of Functions
Cardinality, Sizes of Infinity, and Applications to Computability
Properties of Relations
Relations on Sets (add material about relational databases)
Reflexivity, Symmetry, and Transitivity
Equivalence Relations
Modular Arithmetic with Applications to Cryptography
Partial Order Relations
Counting and Probability
The Multiplication Rule
Counting Elements of Disjoint Sets: The Addition Rule
The Pigeonhole Principle
Counting Subsets of a Set: Combinations. r-Combinations with Repetition Allowed
Pascal's Formula and the Binomial Theorem
Probability Axioms and Expected Value
Conditional Probability, Bayes' Formula, and Independent Events
Graphs and Trees
Graphs: An Introduction
Trails, Paths, and Circuits
Matrix Representations of Graphs
Isomorphisms of Graphs
Trees: Examples and Basic Properties
Rooted Trees
Spanning Trees and a Shortest Path Algorithm
Analyzing Algorithm Efficiency
Real-Valued Functions of a Real Variable and Their Graphs
O-, ?-, and ?-Notations
Application: Efficiency of Algorithms I. Exponential and Logarithmic Functions: Graphs and Orders
Application: Efficiency of Algorithms II
Regular Expressions and Finite State Automata
Formal Languages and Regular Expressions
Finite-State Automata
Simplifying Finite-State Automata
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review