(0) items

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Discrete and Combinatorial Mathematics,9780201726343
This item qualifies for

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Discrete and Combinatorial Mathematics



Pub. Date:
List Price: $204.59

Rent Textbook


Buy Used Textbook

Usually Ships in 2-3 Business Days

Buy New Textbook

Currently Available, Usually Ships in 24-48 Hours


We're Sorry
Not Available

More New and Used
from Private Sellers
Starting at $90.17

Questions About This Book?

Why should I rent this book?

Renting is easy, fast, and cheap! Renting from can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.

How do rental returns work?

Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!

What version or edition is this?

This is the 5th edition with a publication date of 7/17/2003.

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 CDs, lab manuals, study guides, etc.
  • The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

  • Student Solutions Manual for Discrete and Combinatorial Mathematics
    Student Solutions Manual for Discrete and Combinatorial Mathematics
  • Discrete and Combinatorial Mathematics : An Applied Introduction
    Discrete and Combinatorial Mathematics : An Applied Introduction


This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.

Table of Contents

Fundamentals of Discrete Mathematics
Fundamental Principles of Counting
The Rules of Sum and Product
Combinations: The Binomial Theorem
Combinations with Repetition
The Catalan Numbers (Optional)
Summary and Historical Review
Fundamentals of Logic
Basic Connectives and Truth Tables
Logical Equivalence: The Laws of Logic
Logical Implication: Rules of Inference
The Use of Quantifiers
Quantifiers, Definitions, and the Proofs of Theorems
Summary and Historical Review
Set Theory
Sets and Subsets
Set Operations and the Laws of Set Theory
Counting and Venn Diagrams
A First Word on Probability
The Axioms of Probability (Optional)
Conditional Probability: Independence (Optional)
Discrete Random Variables (Optional)
Summary and Historical Review
Properties of the Integers: Mathematical Induction
The Well-Ordering Principle: Mathematical Induction
Recursive Definitions
The Division Algorithm: Prime Numbers
The Greatest Common Divisor: The Euclidean Algorithm
The Fundamental Theorem of Arithmetic
Summary and Historical Review
Relations and Functions
Cartesian Products and Relations
Functions: Plain and One-to-One
Onto Functions: Stirling Numbers of the Second Kind
Special Functions
The Pigeonhole Principle
Function Composition and Inverse Functions
Computational Complexity
Analysis of Algorithms
Summary and Historical Review
Languages: Finite State Machines
Language: The Set Theory of Strings
Finite State Machines: A First Encounter
Finite State Machines: A Second Encounter
Summary and Historical Review
Relations: The Second Time Around
Relations Revisited: Properties of Relations
Computer Recognition: Zero-One Matrices and Directed Graphs
Partial Orders
Table of Contents provided by Publisher. All Rights Reserved.

Please wait while the item is added to your cart...