Back to Search

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

AUTHOR Hower, Walter
PUBLISHER de Gruyter (07/21/2025)
PRODUCT TYPE Paperback (Paperback)

Description

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.

Show More
Product Format
Product Details
ISBN-13: 9783111206431
ISBN-10: 3111206432
Binding: Paperback or Softback (Trade Paperback (Us))
Content Language: English
More Product Details
Page Count: 134
Carton Quantity: 30
Product Dimensions: 6.69 x 0.29 x 9.61 inches
Weight: 0.50 pound(s)
Country of Origin: DE
Subject Information
BISAC Categories
Computers | Information Theory
Computers | Applied
Computers | Discrete Mathematics
Descriptions, Reviews, Etc.
publisher marketing

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.

Show More
List Price $58.99
Your Price  $58.40
Paperback