|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
商品の説明
内容説明
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 Plya’s counting theorem.
著者について
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.
登録情報
|
この商品にタグをつける(詳細)タグは、商品との関連性が非常に強いキーワードまたはラベルのようなものです。
タグにより、すべてのお客様がお気に入りの商品の整理と確認を行うことができます。 ※タグは初期設定で公開になっています。詳しくはこちら |
カスタマーレビュー
リストマニア
関連商品を探す
同じキーワードの商品を探す
フィードバック
- カタログ情報、または画像について報告
- 著者からのコメント
- 出版社からのコメント
|
