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

By Walter Hower

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.

Discrete Mathematics presents the material in a lively fashion, including topics which are usually not presented. Providing an annex with questions and solutions it offers the chance to the readers worldwide to grasp the subject in this handy and clearly arranged treatise.

• Format: Paperback
• Language: English
• ISBN: 3111206432
• ISBN13: 9783111206431
• Release Date: October 2025
• Publisher: de Gruyter
• Length: 152 Pages