9780495391326

Discrete Mathematics with Applications

Epp

4th Edition

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 de

4.1

Direct Proof and Counterexample I: Introduction

Exercise Set

p.161

4.2

Direct Proof and Counterexample II: Rational Numbers

Exercise Set

p.168

4.3

Direct Proof and Counterexample III: Divisibility

Exercise Set

p.177

4.4

Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theoerem

Exercise Set

p.189

4.5

Direct Proof and Counterexample V: Floor and Ceiling

Exercise Set

p.197

4.6

Indirect Argument: Contradiction and Contraposition

Exercise Set

p.205

4.7

Indirect Argument: Two Classical Theorems

Exercise Set

p.212

4.8

Application: Algorithms

Exercise Set

p.225

5.1

Sequences

Exercise Set

p.242

5.2

Mathematical Induction I

Exercise Set

p.256

5.3

Mathematical Induction II

Exercise Set

p.266

5.4

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

Exercise Set

p.277

5.5

Application: Correctness of Algorithms

Exercise Set

p.288

5.6

Defining Sequences Recursively

Exercise Set

p.302

5.7

Solving Recurrence Relations by Iteration

Exercise Set

p.314

5.8

Second-Order Linear Homogenous Recurrence Relations with Constant Coefficients

Exercise Set

p.326

5.9

General Recursive Definitions and Structural Induction

Exercise Set

p.334

9.1

Introduction

Exercise Set

p.523

9.2

Possibility Trees and the Multiplication Rule

Exercise Set

p.536

9.3

Counting Elements of Disjoint Sets: The Addition Rule

Exercise Set

p.549

9.4

The Pigeonhole Principle

Exercise Set

p.563

9.5

Counting Subsets of a Set: Combinations

Exercise Set

p.581

9.6

r-Combinations with Repetition Allowed

Exercise Set

p.590

9.7

Pascal's Formula and the Binomial Theorem

Exercise Set

p.603

9.8

Probability Axioms and Expected Value

Exercise Set

p.610

9.9

Conditional Probability, Bayes' Formula, and Independent Events

Exercise Set

p.622

10.1

Graphs: Definitions and Basic Properties

Exercise Set

p.639

10.2

Trails, Paths, and Circuits

Exercise Set

p.657

10.3

Matrix Representations of Graphs

Exercise Set

p.673

10.4

Isomorphisms of Graphs

Exercise Set

p.681

10.5

Trees

Exercise Set

p.693

10.6

Rooted Trees

Exercise Set

p.700

Exercise Set

p.715

11.1

Real-Valued Functions of a Real Variable and Their Graphs

Exercise Set

p.724

11.2

O-, Ω-, and Θ-Notations

Exercise Set

p.736

11.3

Application: Analysis of Algorithm Efficiency I

Exercise Set

p.748

11.4

Exponential and Logarithmic Functions: Graphs and Orders

Exercise Set

p.762

11.5

Application: Analysis of Algorithm Efficiency II

Exercise Set

p.777