Discrete and Combinatorial Mathematics: An Applied Introduction*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 thoughtout 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 
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  Bart  GoodreadsThis 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  Citra Puspita  Goodreadsgood... Read full review
Contents
Fundamentals of Logic  47 
Set Theory  127 
Mathematical Induction  163 
Copyright  
17 other sections not shown
Common terms and phrases
A U B addition algorithm binary operation Boolean algebra called Chapter code words coefficient colors column Consequently consider contains count the number countable defined Definition denote Determine distinct divisors edges elements equation equivalence relation EXAMPLE EXERCISES Figure finite state machine four function G Z+ given graph G Hamilton cycle Hasse diagram Hence input integer integral domain inverse isomorphic labeled Latin squares Let G Mathematical Induction matrix multiplication obtain onetoone open statement ordered pairs partial order partition path permutations pigeonhole principle polynomial poset positive integer primitive statements problem proof prove real numbers recurrence relation relation 2ft result ring root Section sequence shown in Fig solution spanning tree step string subgraph subset summand symbols Table Theorem theory tion true truth value undirected graph universe variables Verify vertex vertices write wxyz