Includes bibliographical references (p. [261]-262) and index
CONTENTS NOTE
Text of Note
I. Counting: Basic. Subsets of a set -- Pascal's triangle -- Binomial coefficient identities -- II. Counting: Intermediate Finding a polynomial -- The upward-extended pascal's triangle -- Recurrence relations and fibonacci numbers -- III. Counting: Advanced. Generating functions and making change -- Integer triangles -- Rook paths and queen paths -- IV. Discrete Probability. Probability spaces and distributions -- Markov chains -- Random tournaments -- V. Number Theory. Divisibility of factorials and binomial coefficients -- Covering systems -- Partitions of an integer -- VI. Information Theory What is surprise? -- A coin-tossing game -- Shannon's theorems -- VII. Games. A little graph theory background -- The ramsey game -- Tic-tac-toe and animal games -- VIII. Algorithms. Counters -- Listing permutations and combinations -- Sudoku solving and polycube packing
0
SUMMARY OR ABSTRACT
Text of Note
Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics. --from publisher description