# Counting: The Art of Enumerative Combinatorics

€ 54,49

gebunden

Lieferbar innerhalb von 2-3 Tagen

Juni 2001

## Beschreibung

### Beschreibung

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

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

From the reviews:"Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called 'The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended." (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004)

"This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book." (W. Moser, Mathematical Reviews, Issue 2002 g)

"This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of 'easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems." (Péter L. Erdös, Zentralblatt MATH, Vol. 968, 2001)

"The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a 'Back of the Book' section rather than an Answers section." (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)

### Pressestimmen

From the reviews:"Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called 'The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended." (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004)

"This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book." (W. Moser, Mathematical Reviews, Issue 2002 g)

"This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of 'easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems." (Péter L. Erdös, Zentralblatt MATH, Vol. 968, 2001)

"The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a 'Back of the Book' section rather than an Answers section." (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)

EAN: 9780387952253

ISBN: 038795225X

Untertitel: 'Undergraduate Texts in Mathematics'.
2001. Auflage.
Book.
Sprache: Englisch.

Verlag: Springer

Erscheinungsdatum: Juni 2001

Seitenanzahl: 268 Seiten

Format: gebunden

Es gibt zu diesem Artikel noch keine Bewertungen.Kundenbewertung schreiben