咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >How to Count : An Introducti... 收藏

How to Count : An Introduction to Combinatorics, Second Edition

如何统计:组合数学介绍,第二版

丛 书 名:Discrete Mathematics and Its Applications

版本说明:2

作     者:Allenby, R.B.J.T. 

I S B N:(纸本) 9781420082609 

出 版 社:CRC Press 

出 版 年:2010年

学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学] 

摘      要: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 *** 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.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分