Author | Martin, George E. author |
---|---|

Title | Counting: The Art of Enumerative Combinatorics [electronic resource] / by George E. Martin |

Imprint | New York, NY : Springer New York : Imprint: Springer, 2001 |

Connect to | http://dx.doi.org/10.1007/978-1-4757-4878-9 |

Descript | XII, 252 p. online resource |

SUMMARY

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 is adjacent to at least 1 green chip? There are no prerequisites for this course beyond mathematical maturity. The book can be used for a semester course at the sophomore level as introduction to discrete mathematics for mathematics, computer science, and statistics students. The first five chapters can also serve as a basis for a graduate course for in-service teachers

CONTENT

1. Elementary Enumeration -- 2. The Principle of Inclusion and Exclusion -- 3. Generating Functions -- 4. Groups -- 5. Actions -- 6. Recurrence Relations -- 7. Mathematical Induction -- 8. Graphs -- The Back of the Book

Mathematics
Computer science -- Mathematics
Discrete mathematics
Combinatorics
Statistics
Mathematics
Discrete Mathematics
Combinatorics
Mathematics of Computing
Statistics general