000			a
999			_c32444 _d32444
008			230831b xxu||||| |||| 00| 0 eng d
020			_a9783319138435
082			_a511.6 _bBEE
100			_aBeeler, Robert A.
245			_aHow to count : an introduction to combinatorics and its applications
260			_bSpringer, _c2015 _aCham :
300			_axv, 361 p. ; _bill., _c25 cm
365			_b59.99 _cEUR _d94.90
504			_aIncludes bibliographical references and index.
520			_aProviding a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.
650			_aCombinatorial analysis
650			_aCombinatorics and graph theory
650			_aMathematics Combinatorics
650			_aProbability and Statistics General
942			_2ddc _cBK