Counting: The Art of Enumerative Combinatorics

by George E. Martin

Book Overview

Counting is hard. "Counting" is short for "Enumerative Combinatorics," which certainly doesn't sound easy. This book provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to... . At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip...

• Format: Paperback
• Language: English
• ISBN: 1441929150
• ISBN13: 9781441929150
• Release Date: December 2010
• Publisher: Springer
• Length: 252 Pages
• Weight: 0.83 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"

Customer Reviews

Interesting book on combinatorics

This is a charming text on elementary combinatorics. Counting, or enumerative combinatorics, is-as the writer says-hard, but after you have gone through this very readable book, it becomes less hard and more interesting-so much so that you will want more of it. The reader is very much helped by the Back of the Book section which provides answers and, in many cases, solutions as well.

Great Introduction on Counting

This book is a good introduction to counting (combinatoric type counting). The book has answers to most of it's problems and recommends you try the problems before looking at the answers. Most of the problems are simple, and hit hard on the idea the section of the book is trying to get across.It covers simple counting, groups, generating functions, recurrence relations and mathematical induction. The book concludes with graph theory. Some chapter sections get a little hard to understand, hence the 4 star and not 5 star rating (2 stars is what I'd give a decent book, so this one is a shining star). Most of the book is clear cut.