| eBook ISBN: | 978-0-88385-930-8 |
| Product Code: | NML/15.E |
| List Price: | $50.00 |
| MAA Member Price: | $37.50 |
| AMS Member Price: | $37.50 |
| eBook ISBN: | 978-0-88385-930-8 |
| Product Code: | NML/15.E |
| List Price: | $50.00 |
| MAA Member Price: | $37.50 |
| AMS Member Price: | $37.50 |
-
Book DetailsAnneli Lax New Mathematical LibraryVolume: 15; 1965; 202 pp
Counting lies at the heart of much mathematics, and Niven's subtitle is How to Count Without Counting. This is the whole art of combinatorics: permutations, combinations, binomial coefficients, the inclusion-exclusion principle, combinatorial probability, partitions of numbers, generating polynomials, the pigeonhole principle, and much more.
-
Table of Contents
-
Chapters
-
Chapter 1. Introductory Questions
-
Chapter 2. Permutations and Combinations
-
Chapter 3. Combinations and Binomial Coefficients
-
Chapter 4. Some Special Distributions
-
Chapter 5. The Inclusion-Exclusion Principle ; Probability
-
Chapter 6. Partitions of an Integer
-
Chapter 7. Generating Polynomials
-
Chapter 8. Distribution of Objects Not All Alike
-
Chapter 9. Configuration Problems
-
Chapter 10. Mathematical Induction
-
Chapter 11. Interpretations of a Non-Associative Product
-
Miscellaneous Problems
-
-
Reviews
-
This text is an engaging, even addictive, introduction to basic combinatorics. Written in a fun and inviting manner, reader interest is amplified by the author's infectious enthusiasm. This is an excellent introduction to combinations and permutations. First published in 1975, before computers and calculators were assumed to be at hand, the exercises in this book can all be done by hand on paper. Students finishing high school or in their first year of college will find this work an excellent adjunct to textbooks and lectures.
Tom Schulte, MAA Reviews
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Reviews
- Requests
Counting lies at the heart of much mathematics, and Niven's subtitle is How to Count Without Counting. This is the whole art of combinatorics: permutations, combinations, binomial coefficients, the inclusion-exclusion principle, combinatorial probability, partitions of numbers, generating polynomials, the pigeonhole principle, and much more.
-
Chapters
-
Chapter 1. Introductory Questions
-
Chapter 2. Permutations and Combinations
-
Chapter 3. Combinations and Binomial Coefficients
-
Chapter 4. Some Special Distributions
-
Chapter 5. The Inclusion-Exclusion Principle ; Probability
-
Chapter 6. Partitions of an Integer
-
Chapter 7. Generating Polynomials
-
Chapter 8. Distribution of Objects Not All Alike
-
Chapter 9. Configuration Problems
-
Chapter 10. Mathematical Induction
-
Chapter 11. Interpretations of a Non-Associative Product
-
Miscellaneous Problems
-
This text is an engaging, even addictive, introduction to basic combinatorics. Written in a fun and inviting manner, reader interest is amplified by the author's infectious enthusiasm. This is an excellent introduction to combinations and permutations. First published in 1975, before computers and calculators were assumed to be at hand, the exercises in this book can all be done by hand on paper. Students finishing high school or in their first year of college will find this work an excellent adjunct to textbooks and lectures.
Tom Schulte, MAA Reviews
