Discrete Mathematics

  • ISBN13:


  • ISBN10:


  • Edition: 7th
  • Format: Hardcover
  • Copyright: 12/29/2007
  • Publisher: Pearson
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $9.32
    Check/Direct Deposit: $8.88
  • eCampus.com Device Compatibility Matrix

    Click the device icon to install or view instructions

    Apple iOS | iPad, iPhone, iPod
    Android Devices | Android Tables & Phones OS 2.2 or higher | *Kindle Fire
    Windows 10 / 8 / 7 / Vista / XP
    Mac OS X | **iMac / Macbook
    Enjoy offline reading with these devices
    Apple Devices
    Android Devices
    Windows Devices
    Mac Devices
    iPad, iPhone, iPod
    Our reader is compatible
    Android 2.2 +
    Our reader is compatible
    Kindle Fire
    Our reader is compatible
    10 / 8 / 7 / Vista / XP
    Our reader is compatible
    Our reader is compatible
List Price: $192.20 Save up to $103.75
  • Buy Used
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Used and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Focused on helping readers understand and construct proofs and, generally, expanding their mathematical maturity this best-seller is an accessible introduction to discrete mathematics. Takes an algorithmic approach that emphasizes problem-solving techniques. Expands discussion on how to construct proofs and treatment of problem solving. Increases number of examples and exercises throughout. Updates textrs"s Web site athttp://condor.depaul.edu/tilde;rjohnson/dm7th.

Author Biography

Richard Johnsonbaugh is Professor Emeritus of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago. Prior to his 20-year service at DePaul University, he was a member and sometime chair of the mathematics departments at Morehouse College and Chicago State University. He has a B.A. degree in mathematics from Yale University, M.A. and Ph.D. degrees in mathematics from the University of Oregon, and an M.S. degree in computer science from the University of Illinois, Chicago. His most recent research interests are in pattern recognition, programming languages, algorithms, and discrete mathematics. He is the author or co-author of numerous books and articles in these areas. Several of his books have been translated into various languages. He is a member of the Mathematical Association of America.

Table of Contents

Sets and Logic
Conditional Propositions and Logical Equivalence
Arguments and Rules of Inference
Nested QuantifiersProblem-Solving Corner: Quantifiers
Mathematical Systems, Direct Proofs, and Counterexamples
More Methods of ProofProblem-Solving Corner: Proving Some Properties of Real Numbers
Resolution Proofs
Mathematical InductionProblem-Solving Corner: Mathematical Induction
Strong Form of Induction and the Well-Ordering Property Notes Chapter Review Chapter Self-Test Computer Exercises
Functions, Sequences, and Relations
FunctionsProblem-Solving Corner: Functions
Sequences and Strings
Equivalence RelationsProblem-Solving Corner: Equivalence Relations
Matrices of Relations
Relational Databases
Examples of Algorithms
Analysis of AlgorithmsProblem-Solving Corner: Design and Analysis of an Algorithm
Recursive Algorithms
Introduction to Number Theory
Representations of Integers and Integer Algorithms
The Euclidean AlgorithmProblem-Solving Corner: Making Postage
The RSA Public-Key Cryptosystem
Counting Methods and the Pigeonhole Principle
Basic PrinciplesProblem-Solving Corner: Counting
Permutations and CombinationsProblem-Solving Corner: Combinations
Generalized Permutations and Combinations
Algorithms for Generating Permutations and Combinations
Introduction to Discrete Probability
Discrete Probability Theory
Binomial Coefficients and Combinatorial Identities
The Pigeonhole Principle
Recurrence Relations
Solving Recurrence RelationsProblem-Solving Corner: Recurrence Relations
Applications to the Analysis of Algorithms
Graph Theory
Paths and CyclesProblem-Solving Corner: Graphs
Hamiltonian Cycles and the Traveling Salesperson Problem
A Shortest-Path Algorithm
Representations of Graphs
Isomorphisms of Graphs
Planar Graphs
Instant Insanity
Terminology and Characterizations of TreesProblem-Solving Corner: Trees
Spanning Trees
Minimal Spanning Trees
Binary Trees
Tree Traversals
Decision Trees and the Minimum Time for Sorting
Isomorphisms of Trees
Game Trees
Network Models
A Maximal Flow Algorithm
The Max Flow, Min Cut Theorem
MatchingProblem-Solving Corner: Matching
Boolean Algebras and Combinatorial Circuits
Combinatorial Circuits
Properties of Combinatorial Circuits
Boolean AlgebrasProblem-Solving Corner: Boolean Algebras
Boolean Functions and Synthesis of Circuits
Automata, Grammars, and Languages
Sequential Circuits and Finite-State Machines
Finite-State Automata
Languages and Grammars
Nondeterministic Finite-State Automata
Relationships Between Languages and Automata
Computational Geometry
The Closest-Pair Problem
An Algorithm to Compute the Convex Hull
Algebra Review
Hints and Solutions to Selected Exercises
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review