Request for consultation

Thanks for your request. You’ll soon be chatting with a consultant to get the answers you need.
Your form is submitting...
{{formPostErrorMessage.message}} [{{formPostErrorMessage.code}}]
Email Address is required. 'Email Address' must contain at least 0 characters 'Email Address' cannot exceed 0 characters Please enter a valid Email Address
First Name is required. 'First Name' must contain at least 0 characters 'First Name' cannot exceed 0 characters Please enter a valid First Name
Last Name is required. 'Last Name' must contain at least 0 characters 'Last Name' cannot exceed 0 characters Please enter a valid Last Name
Institution is required.
Discipline is required.
Country is required. 'Country' must contain at least 0 characters 'Country' cannot exceed 0 characters Please enter a valid Country
Cengage, at your service! How can we best meet your needs? is required.
Why are you contacting us today? is required. 'Why are you contacting us today?' must contain at least 0 characters 'Why are you contacting us today?' cannot exceed 0 characters Please enter a valid Why are you contacting us today?

Discrete Mathematics with Applications, Metric Edition, 5th Edition

Susanna S. Epp

  • Copyright 2020
  • {{checkPublicationMessage('Published', '2019-01-11T00:00:00+0000')}}
Starting At £35.00 See pricing and ISBN options
Instructor Next Steps
Students: Buy now
Discrete Mathematics with Applications, Metric Edition 5th Edition by Susanna S. Epp
Quick Navigation

Overview

Known for its accessible, precise approach, Epp's DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition introduces discrete mathematics with clarity and precision. Coverage emphasizes the major themes of discrete mathematics as well as the reasoning that underlies mathematical thought. Students learn to think abstractly as they study the ideas of logic and proof. While learning about logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that ideas of discrete mathematics underlie and are essential to today’s science and technology. The author’s emphasis on reasoning provides a foundation for computer science and upper-level mathematics courses.

{{readMore['overview'] ? 'Read More' : 'Read Less'}}

Meet the Authors

{{collapseContainerClosed['meet-the-author'] ? 'Show More' : 'Show Less'}}

Susanna S. Epp

Susanna S. Epp received her Ph.D. in 1968 from the University of Chicago, taught briefly at Boston University and the University of Illinois at Chicago, and is currently Vincent DePaul Professor Emerita of Mathematical Sciences at DePaul University. After initial research in commutative algebra, she became interested in cognitive issues associated with teaching analytical thinking and proof and published a number of articles related to this topic, one of which was chosen for inclusion in The Best Writing on Mathematics 2012. She has spoken widely on discrete mathematics and organized sessions at national meetings on discrete mathematics instruction. In addition to Discrete Mathematics with Applications and Discrete Mathematics: An Introduction to Mathematical Reasoning, she is co-author of Precalculus and Discrete Mathematics, which was developed as part of the University of Chicago School Mathematics Project. The third edition of Discrete Mathematics with Applications received a Texty Award for Textbook Excellence in June 2005. Epp co-organized an international symposium on teaching logical reasoning, sponsored by the Institute for Discrete Mathematics and Theoretical Computer Science (DIMACS), and she was an associate editor of Mathematics Magazine from 1991 to 2001. Long active in the Mathematical Association of America (MAA), she is a co-author of the curricular guidelines for undergraduate mathematics programs: CUPM Curriculum Guide 2004. She received the Hay Award for Contributions to Mathematics Education in 2005 and the Award for Distinguished Teaching given by the Illinois Section of the MAA in 2010.

What's New

{{collapseContainerClosed['whats-new'] ? 'Show More' : 'Show Less'}}
  • Discussion of strings and graphs begins in Chapter 1 and is integrated with applications throughout the text. The handshake theorem, previously in Chapter 12, is now in Chapter 4.
  • New material was added on binary search trees, cryptographic hash functions, bound variables and scope in mathematics and computer programming, and the use of cryptography for message authentication.
  • Sections on quantifier use, the concept of mathematical proof, proof-writing advice, and set theory proofs were revised and expanded based on classroom experience, and new types of exercises were added.
  • The sections introducing mathematical induction were reorganized, discussion of structural induction was expanded, and additional applications of induction were provided.
  • Explanations for two’s complements and for O-, Ω-, and Θ-Notations were significantly simplified.
  • This title is now available with WebAssign, including innovative new exercise types that guide and assess students' abilities to complete proofs.

Features

{{collapseContainerClosed['features'] ? 'Show More' : 'Show Less'}}
  • 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.
  • A large number of computer science applications are included, both to motivate students and to ease their transition into more advanced computer science 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 backgrounds better comprehend basic mathematical reasoning, and enables them to construct sound mathematical arguments.
  • More than 2500 exercises provide ample practice for students, with numerous applied problems covering an impressive array of applications.
  • Over 500 worked examples in problem-solution format guide students in building a conceptual understanding of how to solve problems. Proof solutions are intuitively developed in two steps, a discussion on how to approach the proof and a summary of the solution, allowing students the choice of faster 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.

Table of Contents

{{collapseContainerClosed['table-of-contents'] ? 'Show More' : 'Show Less'}}
1. SPEAKING MATHEMATICALLY.
Variables. The Language of Sets. The Language of Relations and Functions. The Language of Graphs.
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: Writing Advice. Direct Proof and Counterexample III: Rational Numbers. Direct Proof and Counterexample IV: Divisibility. Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem. Direct Proof and Counterexample VI: Floor and Ceiling. Indirect Argument: Contradiction and Contraposition. Indirect Argument: Two Famous Theorems. Application: Algorithms.
5. SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Sequences. Mathematical Induction I: Proving Formulas. Mathematical Induction II: Applications. 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. Properties of Sets. 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, and Inverse Functions. Composition of Functions. Cardinality with Applications to Computability.
8. PROPERTIES OF RELATIONS.
Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations. Modular Arithmetic with Applications to Cryptography. Partial Order Relations.
9. COUNTING AND PROBABILITY
Introduction. Possibility Trees and 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. THEORY OF GRAPHS AND TREES.
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. ANALYSIS OF ALGORITHM EFFICIENCY.
Real-Valued Functions of a Real Variable and Their Graphs. O-, -, and -Notations. Application: Analysis of Algorithm Efficiency I. Exponential and Logarithmic Functions: Graphs and Orders. Application: Analysis of Algorithm Efficiency II.
12. REGULAR EXPRESSIONS AND FINITE STATE AUTOMATA.
Formal Languages and Regular Expressions. Finite-State Automata. Simplifying Finite-State Automata.

Compare Buying Options

{{collapseContainerClosed['compare-buying-options'] ? 'Show More' : 'Show Less'}}

WebAssign Options

{{collapseContainerClosed['detail_1'] ? 'Show More' : 'Show Less'}}
WebAssign
Each WebAssign online product offers the full textbook combined with a flexible and fully customizable online instructional assignments and tools.

Cengage provides a seamless user experience for Learning Management Systems (LMS) integration. Please contact your Cengage Learning Consultant for ordering information and visit our Learning Management System Integration web page on WebAssign for general information.

Standalone Digital Access — Ultimate Value

Recommended and most popular

  • ISBN-10: 0357121007
  • ISBN-13: 9780357121009
  • RETAIL £35.00
Instructor Next Steps
Students: Buy now

Textbook Only Options

Traditional eBook and Print Options

{{collapseContainerClosed['detail_0'] ? 'Show More' : 'Show Less'}}

  • ISBN-10: 035724561X
  • ISBN-13: 9780357245613
  • RETAIL £0.00

  • ISBN-10: 035769645X
  • ISBN-13: 9780357696453
  • RETAIL £51.50

  • ISBN-10: 0357114086
  • ISBN-13: 9780357114087
  • RETAIL £67.99
Instructor Next Steps
Students: Buy now

Supplements

{{collapseContainerClosed['supplements'] ? 'Show More' : 'Show Less'}}

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 STUDENTS

International Metric WebAssign Instant Access for Epp's Discrete Mathematics with Applications, 5th, Metric Edition

ISBN: 9780357121009
International Metric WebAssign for Epp's Discrete Mathematics with Applications, 5th Edition, Metric Edition is a flexible and fully customizable online instructional solution that puts powerful tools in the hands of instructors, empowering you to deploy assignments, instantly assess individual student and class performance, and help your students master the course concepts. With WebAssign’s powerful digital platform and Discrete Mathematics with Applications specific content, you can tailor your course with a wide range of assignment settings, add your own questions and content, and access student and course analytics and communication tools.