- Paperback: 1026 pages
- Publisher: Pearson Education; 5 edition (2006)
- Language: English
- ISBN-10: 8177584243
- ISBN-13: 978-8177584240
- Package Dimensions: 25 x 21 x 4.4 cm
- Average Customer Review: 4 customer reviews
- Amazon Bestsellers Rank: #3,059 in Books (See Top 100 in Books)
Discrete and Combinatorial Mathematics Paperback – 2006
The order quantity for this product is limited to 2 units per customer
Please note that orders which exceed the quantity limit will be auto-canceled. This is applicable across sellers.
Frequently bought together
Customers who bought this item also bought
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter mobile phone number.
Customers who viewed this item also viewed
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Most helpful customer reviews on Amazon.com
I'm in my first course of Combinatorics with a teacher that assumes we know alot more calculus than we do. We use Tucker's Applied combinatorics 5th, and I was cruising along just fine until we hit Generating Functions. Brick wall. Rosen's book didn't cover it (well; there's a great page of known identities, but not an intro-level version), neither did Epp, so I dusted this tome off my shelf and cracked it open... section 9.1 presents Generating functions on such an easy to use language and analytic explanation that I went from getting every problem wrong in Tucker's book to getting them all right; all due to the clarity of exposition.
I've also found that as my 'mathematical maturity' has grown in the last year, so has the comprehensibility of this text. It may be too deep for a beginner--I would agree that it would be too much for all but your brightest minus an excellent teacher--but this book teaches 'real math' and does so *very* well.
In conclusion, if you have the available student loan $$ and want a very good supplementary book that you really can take with you to higher classes, put this at the top of your list.
I also own Epp and Rosen's discrete math texts, and have to say that for me ultimately I needed all three as a beginner; plus a few extra books from the library for special topics. But what I learned stayed with me and all three have their positives and negatives, but if I were to choose only one to stay on my shelf, THIS would be the one.
I used this book as a supplement to my discrete math class in summer and as a supplement for a combinatorics class this past fall.
My mathematical 'maturity' when approaching discrete math was business calculus. (Yeah, I know that sucks, and all you mathematicians and engineers can laugh your hind off about it. Don't remind me.) So basically, I was behind the class in both this and in the combinatorics class this fall.
This book is best approached if you take the explanations it uses *while trying to solve the problems.* It seemed pitched high to me because Epp is focused on giving you concepts and Rosen is concerned with making sure you learn theory.
Grimaldi is interested in teaching you to solve problems.
This book also has the one of the *best* sections on recurrence relations. I thought Chen's book was king here, but this book, when working through gobs of problems, helps you learn them inside and out. It has two charts detailing what happens in a non-homegeneous recurrence relation, one that states general solutions, another that gives you a relation, its homogeneous counterpart, and changes the NH part and shows you how the general form changes.
Brilliant, and blows Tucker's "Applied Combinatorics" out of the water in clarity when solving recurrence relations.
Best book in its class.
(Got an A- and a B in those classes, for the results-minded.)
This is where this book became the holy grail.