What you will learn:

3.01 Counting techniques
3.02 The pigeonhole principle
3.03 Factorial notation
3.04 Permutations
3.05 Combinations
3.06 Pascal’s triangle and binomial coefficients

Outcome:

• Use factorials and other counting techniques to find numbers of arrangements
• Use the pigeonhole principle to solve problems
• Distinguish between permutations and combinations and use them to find numbers of
arrangements and selections to calculate simple probabilities
• Identify the relationship between Pascal’s triangle and binomial coefficients