Home/Post-Secondary Mathematics/Combinatorics and Counting
Public · Sign in
MT
Discrete Mathematics · Data & Probability

Combinatorics and Counting

Combinatorics answers: how many ways? The pigeonhole principle — if more than n items go into n boxes, some box has two — is the simplest existence argument in mathematics.

WHAT STUDENTS WILL LEARN
Apply addition and multiplication principles
Count permutations and combinations
Apply the pigeonhole principle
Apply inclusion-exclusion
COURSE OUTLINE · CLICK A PART FOR RESOURCES