001439709 000__ 03759cam\a2200529\i\4500
001439709 001__ 1439709
001439709 003__ OCoLC
001439709 005__ 20230309004516.0
001439709 006__ m\\\\\o\\d\\\\\\\\
001439709 007__ cr\un\nnnunnun
001439709 008__ 210917s2021\\\\sz\\\\\\ob\\\\001\0\eng\d
001439709 020__ $$a9783030722289$$q(electronic bk.)
001439709 020__ $$a3030722287$$q(electronic bk.)
001439709 020__ $$z9783030722272
001439709 020__ $$z3030722279
001439709 0247_ $$a10.1007/978-3-030-72228-9$$2doi
001439709 035__ $$aSP(OCoLC)1268326786
001439709 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCO$$dEBLCP$$dOCLCF$$dUKAHL$$dOCLCQ$$dCOM$$dOCLCO$$dSFB$$dOCLCQ
001439709 049__ $$aISEA
001439709 050_4 $$aQA164$$b.G65 2021
001439709 08204 $$a511/.6$$223
001439709 1001_ $$aGolomb, Solomon W.$$q(Solomon Wolf),$$eauthor.
001439709 24510 $$aSolomon Golomb's course on undergraduate combinatorics /$$cSolomon W. Golomb, Andy Liu.
001439709 24630 $$aCourse on undergraduate combinatorics
001439709 264_1 $$aCham :$$bSpringer,$$c[2021]
001439709 264_4 $$c©2021
001439709 300__ $$a1 online resource
001439709 336__ $$atext$$btxt$$2rdacontent
001439709 337__ $$acomputer$$bc$$2rdamedia
001439709 338__ $$aonline resource$$bcr$$2rdacarrier
001439709 504__ $$aIncludes bibliographical references and index.
001439709 5050_ $$a0. Basic Tools -- 1. Combinations -- 2. Recurrence Relations and Generating Functions -- 3. Permutations -- 4. Special Numbers -- 5. Counting Under Symmetries -- 6. Combinatorial Structures -- A. Additional Exercises -- B. Additional Examples -- C. Solutions to Odd-numbered Exercises -- Bibliography -- Index.
001439709 506__ $$aAccess limited to authorized users.
001439709 520__ $$aThis textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb's insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb's Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book's many entertaining challenges.
001439709 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 28, 2021).
001439709 650_0 $$aCombinatorial analysis.
001439709 650_6 $$aAnalyse combinatoire.
001439709 655_7 $$aLlibres electrònics.$$2thub
001439709 655_0 $$aElectronic books.
001439709 7001_ $$aLiu, A. C. F.$$q(Andrew Chiang-Fung),$$eauthor.
001439709 77608 $$iPrint version:$$aGolomb, Solomon W. (Solomon Wolf).$$tSolomon Golomb's course on undergraduate combinatorics.$$dCham : Springer, [2021]$$z3030722279$$z9783030722272$$w(OCoLC)1240306610
001439709 852__ $$bebk
001439709 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-72228-9$$zOnline Access$$91397441.1
001439709 909CO $$ooai:library.usi.edu:1439709$$pGLOBAL_SET
001439709 980__ $$aBIB
001439709 980__ $$aEBOOK
001439709 982__ $$aEbook
001439709 983__ $$aOnline
001439709 994__ $$a92$$bISE