Chapter 1 – Counting Techniques

#
Topic 1.5

Combinations

This lesson develops an understanding of *Combinations* as they relate to *Permutations*. The connection between ordered lists (Permutations) and unordered sets (Combinations) is of fundamental importance and time should be spent developing this connection. The recursion of Pascal’s Triangle and its connection to the recursion for Combinations is presented here. That connection is also of fundamental importance in understanding probability. This idea is also used in the standard formula for calculating binomial probabilities (*i.e.* calculating using the Binomial Distribution).

Slideshow: Full– 4 per page – 9 per page