Combinatorics – Pascal's Triangle

Goal

• Learn how to use Pascal's Triangle to count 'n choose k' (without calling it so, for now).
• Learn how to distinguish this type of problem from different types – for that purpose 'n choose k' problems are mixed with different types, like A×B×C or A×A×A.
• Note: We did not teach just how to do it mechanically – instead, we discussed why following the same number of green and red turns we end up at the same point, and why the number at this point tells us the number of ways to get there.

Download PDF

Full PDF is available for this topic.

Download: S23 - Combinatorics Pascal.pdf

Example Challenges