Počet záznamů: 1  

Pearls of discrete mathematics

  1. Údaje o názvuPearls of discrete mathematics / Martin Erickson
    Osobní jméno Erickson, Martin J., 1963-2013 (autor)
    NakladatelBoca Raton : Taylor & Francis, 2010
    Fyz.popis1 online zdroj (x, 270 stran) : ilustrace
    ISBN9781439816172 (online ; pdf)
    1439816174
    EdiceDiscrete mathematics and its applications
    Poznámky o skryté bibliografii a rejstřícíchObsahuje bibliografické odkazy a rejstřík
    Úplný obsahI. 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.
    Poznámky k dostupnostiPřístup pouze pro oprávněné uživatele
    PoznámkyZpůsob přístupu: World Wide Web
    DefektyeBooks on EBSCOhost
    Předmět.hesla diskrétní matematika discrete mathematics * teorie grafů graph theory * teorie čísel number theory
    Forma, žánr elektronické knihy electronic books
    Konspekt51 - Matematika
    MDT 51 , 519.17 , 511 , (0.034.2:08)
    Země vyd.Florika
    Jazyk dok.angličtina
    Druh dok.Elektronické zdroje
    URLhttp://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=342617
    kniha

    kniha


    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.

Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.