• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Discrete Mathematics: Combinatorics, Counting, Proofs, Recurrences, Solutions

Discrete Mathematics: Combinatorics, Counting, Proofs, Recurrences, Solutions

Paperback

Series: de Gruyter Textbook

General ComputersGeneral Mathematics

Publisher Price: $58.99

ISBN10: 3111206432
ISBN13: 9783111206431
Publisher: de Gruyter
Published: Aug 21 2025
Pages: 134
Weight: 0.50
Height: 0.29 Width: 6.69 Depth: 9.61
Language: English

Discrete Mathematics presents the material in an easily accessible manner. Beside the usual content (expanded a little bit), a special writing style is used.

We start with the natural numbers, function and relations, as well as the powerset lattice. The second chapter illustrates set theory with its laws and the Generalized Continuum Hypothesis. Chapter 3 delivers Boolean Algebra, with the double exponential formula for the # different boolean functions. The next chapter covers the induction, direct, and indirect proof. Chapter 5 presents combinatorics: Rules of sum, product, quotient, the pigeonhole principle, in/exclusion, permutation and binomial coefficient, plus Stirling numbers of 1st and 2nd kind as well as the Bell number; additionally, the recurrence relation with back- and forward reasoning is offered. We conclude with general and conditional probability, incl. the Monty Hall problem.

Also from

Hower, Walter

Also in

General Computers