Discrete Mathematics

  • ISBN13:


  • ISBN10:


  • Edition: 8th
  • Format: Hardcover
  • Copyright: 3/10/2017
  • Publisher: Pearson
  • 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: $46.20
    Check/Direct Deposit: $44.00
List Price: $190.20 Save up to $4.71
  • Buy New
    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, Rental 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.


An algorithmic approach gives readers an accessible introduction to discrete mathematics.

Focused on helping readers understand and construct proofs, Discrete Mathematics takes an algorithmic approach to emphasize problem-solving techniques. An accessible introduction to discrete math, the best-selling text works to expand mathematical maturity. With nearly 4,500 exercises and almost 650 worked examples, the 8th Edition stresses the importance of reading and writing proofs in mathematics.

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

1.     Sets and Logic

2.     Proofs

3.     Functions, Sequences, and Relations

4.     Algorithms

5.     Introduction to Number Theory

6.     Counting Methods and the Pigeonhole Principle

7.     Recurrence Relations

8.     Graph Theory

9.     Trees

10.   Network Models

11.   Boolean Algebras and Combinatorial Circuits

12.   Automata, Grammars, and Languages

13.   Computational Geometry

Rewards Program

Write a Review