Placeholder text

Go to cart

How to Count

By Allenby, R. B. J. T.

Product Image: How to Count

How to Count

By Allenby, R. B. J. T.

0 - Default Title
Description
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 P lya 's counting theorem.
Product details
Edition:
2
Number of Pages:
448
Release Date:
2010-08-13
Publication Date:
2010-08-12
Publisher:
Chapman and Hall/CRC
Languages:
Original: English
ISBN10:
1420082604
ISBN13:
9781420082609
GPSR Manufacturer Reference:
[email protected]
Weight:
1032 g
Height:
183 cm
Width:
260 cm
Thickness:
29 cm
Buy on Amazon
Currently sold out