LEADER 03534nam  22006135  450 
001 9910299773403321
005 20251116134143.0
010   $a3-319-13844-8
024 7 $a10.1007/978-3-319-13844-2
035   $a(CKB)3710000000379578
035   $a(SSID)ssj0001465542
035   $a(PQKBManifestationID)11848976
035   $a(PQKBTitleCode)TC0001465542
035   $a(PQKBWorkID)11473245
035   $a(PQKB)11499849
035   $a(DE-He213)978-3-319-13844-2
035   $a(MiAaPQ)EBC6313062
035   $a(MiAaPQ)EBC5579806
035   $a(Au-PeEL)EBL5579806
035   $a(OCoLC)904980450
035   $a(PPN)184888646
035   $a(EXLCZ)993710000000379578
100   $a20150314d2015      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHow to Count $eAn Introduction to Combinatorics and Its Applications /$fby Robert A. Beeler
205   $a1st ed. 2015.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015.
215   $a1 online resource (XV, 361 p. 61 illus., 2 illus. in color.) 
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-319-13843-X 
320   $aIncludes bibliographical references and index.
327   $aPreliminaries -- Basic Counting -- The Binomial Coefficient -- Distribution Problems -- Generating Functions -- Recurrence Relations -- Advanced Counting - Inclusion and Exclusion -- Advanced Counting - Polya Theory -- Application: Probability -- Application: Combinatorial Designs -- Application: Graph Theory -- Appendices.
330   $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.
606   $aCombinatorial analysis
606   $aProbabilities
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004
615  0$aCombinatorial analysis.
615  0$aProbabilities.
615 14$aCombinatorics.
615 24$aProbability Theory and Stochastic Processes.
676   $a511.6
700   $aBeeler$b Robert A.$4aut$4http://id.loc.gov/vocabulary/relators/aut$0755548
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910299773403321
996   $aHow to count$91522543
997   $aUNINA