9781337694193

Discrete Mathematics with Applications

Susanna S. Epp

5th Edition

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students

4.1

Direct Proof and Counterexample I: Introduction

Exercise Set

p.171

4.2

Direct Proof and Counterexample II: Writing Advice

Exercise Set

p.181

4.3

Direct Proof and Counterexample III: Rational Numbers

Exercise Set

p.187

4.4

Direct Proof and Counterexample IV: Divisibility

Exercise Set

p.197

4.5

Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem

Exercise Set

p.209

4.6

Direct Proof and Counterexample VI: Floor and Ceiling

Exercise Set

p.217

4.7

Indirect Argument: Contradiction and Contraposition

Exercise Set

p.225

4.8

Indirect Argument: Two Famous Theorems

Exercise Set

p.233

4.9

Application: The Handshake Theorem

Exercise Set

p.242

4.10

Application: Algorithms

Exercise Set

p.255

5.1

Sequences

Exercise Set

p.273

5.2

Mathematical Induction I: Proving Formulas

Exercise Set

p.286

5.3

Mathematical Induction II: Applications

Exercise Set

p.297

5.4

Strong Mathematical Induction and the Well-Ordering Principle for the Integers

Exercise Set

p.310

5.5

Application: Correctness of Algorithms

Exercise Set

p.323

5.6

Defining Sequences Recursively

Exercise Set

p.337

5.7

Solving Recurrence Relations by Iteration

Exercise Set

p.350

5.8

Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients

Exercise Set

p.362

5.9

General Recursive Definitions and Structural Induction

Exercise Set

p.374

9.1

Introduction to Probability

Exercise Set

p.571

9.2

Possibility Trees and the Multiplication Rule

Exercise Set

p.585

9.3

Counting Elements of Disjoint Sets: The Addition Rule

Exercise Set

p.599

9.4

The Pigeonhole Principle

Exercise Set

p.614

9.5

Counting Subsets of a Set: Combinations

Exercise Set

p.630

9.6

r-Combinations with Repetition Allowed

Exercise Set

p.640

9.7

Pascal's Formula and the Binomial Theorem

Exercise Set

p.653

9.8

Probability Axioms and Expected Value

Exercise Set

p.660

9.9

Conditional Probability, Bayes' Formula, and Independent Events

Exercise Set

p.673

10.1

Trails, Paths, and Circuits

Exercise Set

p.693

10.2

Matrix Representation of Graphs

Exercise Set

p.710

10.3

Isomorphisms of Graphs

Exercise Set

p.719

10.4

Trees: Examples and Basic Properties

Exercise Set

p.731

10.5

Rooted Trees

Exercise Set

p.741

10.6

Spanning Trees and a Shortest Path Algorithm

Exercise Set

p.757

11.1

Real-Valued Functions of a Real Variable and Their Graphs

Exercise Set

p.767

11.2

Big-O, Big-Omega, and Big-Theta Notations

Exercise Set

p.784

11.3

Application: Analysis of Algorithm Efficiency I

Exercise Set

p.796

11.4

Exponential and Logarithmic Functions: Graphs and Orders

Exercise Set

p.811

11.5

Application: Analysis of Algorithm Efficiency II

Exercise Set

p.825