How to Count
An Introduction to Combinatorics, Second Edition
R.B.J.T. Allenby, Alan Slomson
- 444 Seiten
- English
- PDF
- Über iOS und Android verfügbar
How to Count
An Introduction to Combinatorics, Second Edition
R.B.J.T. Allenby, Alan Slomson
Über dieses Buch
Emphasizes a Problem Solving Approach
A first course in combinatorics
Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.
New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.
Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Polya's counting theorem.