## 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 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 |

### What people are saying - Write a review

#### LibraryThing Review

User Review - aethercowboy - LibraryThingI had the fortune to be educated in the ways of discrete mathematics by the author of this book. Dr. Grimaldi taught his class very well, and made the information within its pages stand out to the ... Read full review

#### LibraryThing Review

User Review - tjd - LibraryThingLots of content, and lots of exercises. It's a fifth edition, so it has stood the test of time and has relatively few errors or glaring flaws. But the writing is awful, and the presentation of somes ... Read full review

### Contents

Fundamentals of Logic | 47 |

Set Theory | 127 |

Mathematical Induction | 163 |

Copyright | |

17 other sections not shown

### Other editions - View all

Discrete and Combinatorial Mathematics: Pearson New International Edition Ralph P. Grimaldi No preview available - 2013 |

### 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 one-to-one 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