How to Count
An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)
(Hardcover)

5 products added to cart in last 30 minutes
MRP: ₹8,107.00 | Saved: ₹7 (88%) ₹1,695.00 @ Amazon Last Updated: 16-May-2018 06:11:18 pm
✅ Lowest price available on Amazon
✅ Usually dispatched within 1-2 business days
✅ Total 6 new items found

Related Categories

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.

AuthorR.B.J.T. Allenby
BindingHardcover
EAN9781420082609
Edition2
FormatImport
ISBN1420082604
Height1025 mm
Length700 mm
Width100 mm
Weight211 g
LanguageEnglish
Language TypePublished
Number Of Items1
Number Of Pages444
Package Quantity1
Product GroupBook
Publication Date2010-09-02
PublisherChapman and Hall/CRC
StudioChapman and Hall/CRC
Sales Rank354979

Bestsellers in Operating Systems

Trending Products at this Moment

General information about How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)