Discrete and Combinatorial Mathematics: An Applied Introduction

Front Cover
Addison-Wesley Longman, 1999 - Computers - 791 pages
6 Reviews
*Appropriate for four different courses: Discrete Mathematics; Combinatorics; Graph Theory; Modern Applied Algebra. *Flexible, modular organization. *This text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications. *Carefully thought-out examples, including examples with computer science applications. Students can learn by reading the text. *The Fourth Edition has added more elementary problems, creating a larger variety of level within the problem sets which allows students to establish skills as they practice. *Chapter summaries allow the student to review what they have learned, while historical reviews and biographies bring a human element to their assignments. 1. Fundamentals of Discrete Mathematics. Fundamental Principles of Counting. The Rules of Sum and Product. Permutations. Combinations: . The Binomial Theorem. Combinations with Repetition: Distributions. An Application in the Physical Sciences (Optional). 2. Fundamentals of Logic. Basic Connectives and Truth Tables. Logical Equivalence: The Laws of Logic. Logical Implication: Rules of Inference. The Use of Quantifiers. Quantifiers, Definiti

From inside the book

What people are saying - Write a review

User ratings

5 stars
4 stars
3 stars
2 stars
1 star

Review: Discrete and Combinatorial Mathematics

User Review  - Goodreads

This book is amazing. It aroused in me a love of discrete mathematics. It has great coverage of combinatorics, set theory, graph theory, finite state machines. The examples are great although they ... Read full review

Review: Discrete and Combinatorial Mathematics

User Review  - Goodreads

good... Read full review


Fundamentals of Logic
Set Theory
Mathematical Induction

17 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information