Number of the records: 1
Pearls of discrete mathematics
Title statement Pearls of discrete mathematics / Martin Erickson Personal name Erickson, Martin J., 1963-2013 (author) Publication Boca Raton : Taylor & Francis, 2010 Phys.des. 1 online zdroj (x, 270 stran) : ilustrace ISBN 9781439816172 (online ; pdf) 1439816174 Edition Discrete mathematics and its applications Internal Bibliographies/Indexes Note Obsahuje bibliografické odkazy a rejstřík Contents 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. Notes to Availability Přístup pouze pro oprávněné uživatele Note Způsob přístupu: World Wide Web Defekty eBooks on EBSCOhost Subj. Headings diskrétní matematika discrete mathematics * teorie grafů graph theory * teorie čísel number theory Form, Genre elektronické knihy electronic books Conspect 51 - Matematika UDC 51 , 519.17 , 511 , (0.034.2:08) Country Florika Language angličtina Document kind Electronic sources URL http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=342617 book
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.
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.
Number of the records: 1