Counting: The Art of Enumerative Combinatorics

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

Full description

Bibliographic Details
Main Author: Martin, George E.
Format: eBook
Language:English
Published: New York, NY Springer New York 2001, 2001
Edition:1st ed. 2001
Series:Undergraduate Texts in Mathematics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02090nmm a2200325 u 4500
001 EB000631988
003 EBX01000000000000000485070
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781475748789 
100 1 |a Martin, George E. 
245 0 0 |a Counting: The Art of Enumerative Combinatorics  |h Elektronische Ressource  |c by George E. Martin 
250 |a 1st ed. 2001 
260 |a New York, NY  |b Springer New York  |c 2001, 2001 
300 |a XII, 252 p  |b online resource 
505 0 |a 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 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Statistics  
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Statistics 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Undergraduate Texts in Mathematics 
028 5 0 |a 10.1007/978-1-4757-4878-9 
856 4 0 |u https://doi.org/10.1007/978-1-4757-4878-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 
520 |a 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