Counting: The Art of Enumerative Combinatorics
By: by George E. Martin
Series: Undergraduate Texts in Mathematics; Undergraduate texts in mathematics
Publisher: Springer New York
Published: 2001
Place of publication: New York, NY
Language: eng
Format: [electronic resource] /
Number of pages: 252
ISBN-13: 9781441929150; 9781475748789
Subjects: Mathematics; Statistics; Combinatorial analysis; Computer science
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Elementary Enumeration; title: The Principle of Inclusion and Exclusion; title: Generating Functions; title: Groups; title: Actions; title: Recurrence Relations; title: Mathematical Induction; title: Graphs; title: The Back of the Book.