## Request for consultation

## Overview

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.

- A new Chapter 1 introduces students to some of the precise language that is a foundation for much mathematical thought, and is intended as a warm-up before addressing topics in more depth later on.
- New material on the definition of sound argument, trailing quantifiers, infinite unions and intersections, and Dijkstra's shortest path algorithm.
- Expanded discussion of writing proofs and avoiding common mistakes in proof-writing.
- Increased coverage of functions of more than one variable and functions acting on sets.
- New margin notes are provided to provide better context-sensitive help highlighting issues of particular importance.

- Features, definitions, theorems, and exercise types are clearly marked and easily navigable, making the book an excellent reference that students will want to keep and continually refer back to in their later courses.
- Epp addresses inherent difficulties in understanding logic and language with very concrete and easy-to-conceptualize examples, an approach that helps students with a variety of background better comprehend basic mathematical reasoning, and enables them to construct sound mathematical arguments.
- Around 2500 exercises providing ample practice for students, with numerous applied problems covering an impressive array of applications.
- Over 500 worked examples in problem-solution format. Proof solutions are intuitively developed in two steps, a discussion on how to approach the proof and a summary of the solution, to allow students the choice or quicker or more deliberate instruction depending on how well they understand the problem.
- Flexible organization, allowing instructors the ability to mix core and optional topics easily to suit a wide variety of discrete math course syllabi and topic focus.

Variables. The Language of Sets. The Language of Relations and Functions.

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

3. THE LOGIC OF QUANTIFIED STATEMENTS.

Predicates and Quantified Statements I. Predicates and Quantified Statements II. Statements with Multiple Quantifiers. Arguments with Quantified Statements.

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

5. SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.

Sequences. Mathematical Induction I. Mathematical Induction 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.

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

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

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

9. COUNTING.

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.

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

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

12. REGULAR EXPRESSIONS AND FINITE STATE AUTOMATA.

Formal Languages and Regular Expressions. Finite-State Automata. Simplifying Finite-State Automata.

Cengage provides a range of supplements that are updated in coordination with the main title selection. For more information about these supplements, contact your Learning Consultant.

### FOR INSTRUCTORS

#### Solution Builder

ISBN: 9780495826149

This flexible, personalized online tool lets you easily build and save your own personal solution sets either for printing or posting on password-protected class websites.

#### Solution Builder

ISBN: 9780495826194

#### Student Solutions Manual Instant Access Code, Chapters 7-12

ISBN: 9781111942403

#### Student Solutions Manual Instant Access Code, Chapters 1-

ISBN: 9781111864378

### FOR STUDENTS

#### Student Solutions Manual and Study Guide for Epp's Discrete Mathematics with Applications, 4th

ISBN: 9780495826132

#### Web Site

ISBN: 9780495826156

#### Student Solutions Manual and Study Guide for Epp's Discrete Mathematics: Introduction to Mathematical Reasoning

ISBN: 9780495826187

#### Student Solutions Manual Instant Access Code, Chapters 7-12

ISBN: 9781111942403

#### Student Solutions Manual Instant Access Code, Chapters 1-

ISBN: 9781111864378