How to Count : An Introduction to Combinatorics, Second Edition

R. B. J. T. Allenby

ISBN 10: 1420082604 / ISBN 13: 9781420082609

Published by Chapman And Hall/CRC, 2010

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely 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 EditionThis 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.

Seller Inventory # 9781420082609

Bibliographic Details

• Title: How to Count : An Introduction to Combinatorics, Second Edition
• Publisher: Chapman And Hall/CRC
• Publication Date: 2010
• Language: English
• ISBN 10: 1420082604
• ISBN 13: 9781420082609
• Binding: Buch
• Edition: 2nd Edition
• Condition: Neu
• Dimensions: 260W x 183H x 29D millimeters 260 millimeters width by 183 millimeters height by 29 millimeters depth
• Weight: 1032 grams

About this title

Synopsis

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.

About the Author

Alan Slomson taught mathematics at the University of Leeds from 1967 to 2008. He is currently the secretary of the United Kingdom Mathematics Trust.

R.B.J.T. Allenby taught mathematics at the University of Leeds from 1965 to 2007.