Combinatorics and Probability

  • Răzvan Gelca
  • Titu Andreescu


We conclude the book with combinatorics. First, we train combinatorial skills in set theory and geometry, with a glimpse at permutations. Then we turn to some specific techniques: generating functions, counting arguments, the inclusion-exclusion principle. A strong accent is placed on binomial coefficients.

This is followed by probability, which, in fact, should be treated separately. But the level of this book restricts us to problems that use counting, classical schemes such as the Bernoulli and Poisson schemes and Bayes’ theorem, recurrences, and some minor geometric considerations. It is only later in the development of mathematics that probability loses its combinatorial flavor and borrows the analytical tools of Lebesgue integration.


Positive Integer Exclusion Principle Convex Polyhedron Combinatorial Identity Catalan Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Răzvan Gelca
    • 1
  • Titu Andreescu
    • 2
  1. 1.Department of Mathematics and StatisticsTexas Tech UniversityLubbockUSA
  2. 2.School of Natural Sciences and MathematicsUniversity of Texas at DallasRichardsonUSA

Personalised recommendations