000 | a | ||
---|---|---|---|
999 |
_c30645 _d30645 |
||
008 | 220107b xxu||||| |||| 00| 0 eng d | ||
020 | _a9783030722272 | ||
082 |
_a511.6 _bGOL |
||
100 | _aGolomb, Solomon W. | ||
245 | _aSolomon Golomb's course on undergraduate combinatorics | ||
260 |
_bSpringer, _c2021 _aCham : |
||
300 |
_axviii, 458 p. ; _bill., _c25 cm |
||
365 |
_b59.99 _cEUR _d88.70 |
||
504 | _aIncludes bibliographical references and index. | ||
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. | ||
650 | _aCombinatorics | ||
650 | _aInclusion-Exclusion, Principle | ||
650 | _a Associative Property | ||
650 | _a Closure Property | ||
650 | _aDistribution problem | ||
650 | _a Euler phi-function | ||
650 | _aIsomophic groups | ||
650 | _aInverse Property | ||
650 | _aMobius mu-function(u) | ||
650 | _aTau-function(T) | ||
650 | _a Summation operator | ||
700 | _aLiu, Andy | ||
942 |
_2ddc _cBK |