Discrete and Combinatorial Mathematics: An Applied IntroductionThis 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 applicationsmaking this the ideal text for preparing students for advanced study. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

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  123 
Relations and Functions  247 
Copyright  
15 other sections not shown
Other editions  View all
Common terms and phrases
addition algorithm apply binary operation Boolean algebra called Chapter coefficient colors column Consequently consider contains count the number countable defined Definition denote determine diagram distinct divisors edges elements equation equivalence relation EXAMPLE Exercise Figure finite state machine four function gcd(a given graph G Hamilton cycle Hasse diagram Hence input integer integral domain inverse isomorphic label Latin squares Let G loopfree Mathematical Induction matrix multiplication n e Z+ onetoone palindromes partial order partition path permutations polynomial poset positive integer Pr(A Pr(B Pr(X primitive statements Principle of Mathematical problem proof prove random variable real numbers recurrence relation result ring root sample space Section sequence shown in Fig solution spanning tree step strings subgraph subset summand Table Theorem theory true truth value undirected graph vertex vertices write wxyz