ABSTRACT
This is the first of four chapters on combinatorics topics. Here we have choice numbers (also known as binomial coefficients), which appear both in Pascal’s triangle and the binomial theorem, as well as arrangements (or permutations). Two counting techniques are introduced, namely overcounting and compensation, and combinatorial proof.
