Secure Checkout

Discrete Mathematics, 8th edition

  • Richard Johnsonbaugh

Your access includes:

  • Search, highlight, and take notes
  • Easily create flashcards
  • Use the app for access anywhere
  • 14-day refund guarantee

$10.99per month

4-month term, pay monthly or pay $43.96

Looking for your MyLab or Mastering eTextbook? Find it hereOpens in an new tab

Learn more, spend less

  • Special partners and offers

    Enjoy perks from special partners and offers for students

  • Find it fast

    Quickly navigate your eTextbook with search

  • Stay organized

    Access all your eTextbooks in one place

  • Easily continue access

    Keep learning with auto-renew

Overview

Hallmark features of this title

  • Problem Solving Corners help students attack and solve problems, and show them how to do proofs.
  • Strong emphasis on reading and writing proofs illustrates most proofs of theorems with annotated figures to provide additional explanation and insight into the proofs.
  • Extensive discussion of algorithms, recursive algorithms, and the analysis of algorithms: Algorithms are written in a flexible form of pseudocode resembling languages such as C, C++ and Java.
  • Figures and tables illustrate concepts, show how algorithms work, elucidate proofs, and motivate the material.
  • Short URLs give easy access to corresponding web pages, especially with a mobile device.

Published by Pearson (June 1st 2023) - Copyright © 2023

ISBN-13: 9780137848577

Subject: Advanced Math

Category: Discrete Math

Table of contents

1. Sets and Logic

  • 1.1 Sets
  • 1.2 Propositions
  • 1.3 Conditional Propositions and Logical Equivalence
  • 1.4 Arguments and Rules of Inference
  • 1.5 Quantifiers
  • 1.6 Nested Quantifiers
  • Problem-Solving Corner: Quantifiers

2. Proofs

  • 2.1 Mathematical Systems, Direct Proofs, and Counterexamples
  • 2.2 More Methods of Proof
  • Problem-Solving Corner: Proving Some Properties of Real Numbers
  • 2.3 Resolution Proofs
  • 2.4 Mathematical Induction
  • Problem-Solving Corner: Mathematical Induction
  • 2.5 Strong Form of Induction and the Well-Ordering Property

3. Functions, Sequences, and Relations

  • 3.1 Functions
  • Problem-Solving Corner: Functions
  • 3.2 Sequences and Strings
  • 3.3 Relations
  • 3.4 Equivalence Relations
  • Problem-Solving Corner: Equivalence Relations
  • 3.5 Matrices of Relations
  • 3.6 Relational Databases

4. Algorithms

  • 4.1 Introduction
  • 4.2 Examples of Algorithms
  • 4.3 Analysis of Algorithms
  • Problem-Solving Corner: Design and Analysis of an Algorithm
  • 4.4 Recursive Algorithms

5. Introduction to Number Theory

  • 5.1 Divisors
  • 5.2 Representations of Integers and Integer Algorithms
  • 5.3 The Euclidean Algorithm
  • Problem-Solving Corner: Making Postage
  • 5.4 The RSA Public-Key Cryptosystem

6. Counting Methods and the Pigeonhole Principle

  • 6.1 Basic Principles
  • Problem-Solving Corner: Counting
  • 6.2 Permutations and Combinations
  • Problem-Solving Corner: Combinations
  • 6.3 Generalized Permutations and Combinations
  • 6.4 Algorithms for Generating Permutations and Combinations
  • 6.5 Introduction to Discrete Probability
  • 6.6 Discrete Probability Theory
  • 6.7 Binomial Coefficients and Combinatorial Identities
  • 6.8 The Pigeonhole Principle

7. Recurrence Relations

  • 7.1 Introduction
  • 7.2 Solving Recurrence Relations
  • Problem-Solving Corner: Recurrence Relations
  • 7.3 Applications to the Analysis of Algorithms

8. Graph Theory

  • 8.1 Introduction
  • 8.2 Paths and Cycles
  • Problem-Solving Corner: Graphs
  • 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem
  • 8.4 A Shortest-Path Algorithm
  • 8.5 Representations of Graphs
  • 8.6 Isomorphisms of Graphs
  • 8.7 Planar Graphs
  • 8.8 Instant Insanity

9. Trees

  • 9.1 Introduction
  • 9.2 Terminology and Characterizations of Trees
  • Problem-Solving Corner: Trees
  • 9.3 Spanning Trees
  • 9.4 Minimal Spanning Trees
  • 9.5 Binary Trees
  • 9.6 Tree Traversals
  • 9.7 Decision Trees and the Minimum Time for Sorting
  • 9.8 Isomorphisms of Trees
  • 9.9 Game Trees

10. Network Models

  • 10.1 Introduction
  • 10.2 A Maximal Flow Algorithm
  • 10.3 The Max Flow, Min Cut Theorem
  • 10.4 Matching
  • Problem-Solving Corner: Matching

11. Boolean Algebras and Combinatorial Circuits

  • 11.1 Combinatorial Circuits
  • 11.2 Properties of Combinatorial Circuits
  • 11.3 Boolean Algebras
  • Problem-Solving Corner: Boolean Algebras
  • 11.4 Boolean Functions and Synthesis of Circuits
  • 11.5 Applications

12. Automata, Grammars, and Languages

  • 12.1 Sequential Circuits and Finite-State Machines
  • 12.2 Finite-State Automata
  • 12.3 Languages and Grammars
  • 12.4 Nondeterministic Finite-State Automata
  • 12.5 Relationships Between Languages and Automata

13. Computational Geometry

  • 13.1 The Closest-Pair Problem
  • 13.2 An Algorithm to Compute the Convex Hull

Appendices

  • A. Matrices
  • B. Algebra Review
  • C. Pseudocode

References

Hints and Solutions to Selected Exercises

Index

Your questions answered

Pearson+ is your one-stop shop, with eTextbooks and study videos designed to help students get better grades in college.

A Pearson eTextbook is an easy‑to‑use digital version of the book. You'll get upgraded study tools, including enhanced search, highlights and notes, flashcards and audio. Plus learn on the go with the Pearson+ app.

Your eTextbook subscription gives you access for 4 months. You can make a one‑time payment for the initial 4‑month term or pay monthly. If you opt for monthly payments, we will charge your payment method each month until your 4‑month term ends. You can turn on auto‑renew in My account at any time to continue your subscription before your 4‑month term ends.

When you purchase an eTextbook subscription, it will last 4 months. You can renew your subscription by selecting Extend subscription on the Manage subscription page in My account before your initial term ends.

If you extend your subscription, we'll automatically charge you every month. If you made a one‑time payment for your initial 4‑month term, you'll now pay monthly. To make sure your learning is uninterrupted, please check your card details.

To avoid the next payment charge, select Cancel subscription on the Manage subscription page in My account before the renewal date. You can subscribe again in the future by purchasing another eTextbook subscription.

Channels is a video platform with thousands of explanations, solutions and practice problems to help you do homework and prep for exams. Videos are personalized to your course, and tutors walk you through solutions. Plus, interactive AI‑powered summaries and a social community help you better understand lessons from class.

Channels is an additional tool to help you with your studies. This means you can use Channels even if your course uses a non‑Pearson textbook.

When you choose a Channels subscription, you're signing up for a 1‑month, 3‑month or 12‑month term and you make an upfront payment for your subscription. By default, these subscriptions auto‑renew at the frequency you select during checkout.

When you purchase a Channels subscription it will last 1 month, 3 months or 12 months, depending on the plan you chose. Your subscription will automatically renew at the end of your term unless you cancel it.

We use your credit card to renew your subscription automatically. To make sure your learning is uninterrupted, please check your card details.