Master the art of counting through 24 interactive demonstrations. From basic counting principles and permutations to Catalan numbers, integer partitions, and generating functions.
See also: Graph Theory for counting problems on graphs and extremal combinatorics, Probability for the probabilistic method, and Algorithms for the recurrences and bounds powering algorithm analysis.
Product rule, sum rule, and the pigeonhole principle
Orderings, cycle decomposition, and fixed-point-free arrangements
Binomial coefficients, subsets, and the binomial theorem
Dyck paths, polygon triangulations, and balanced parentheses
Ferrers diagrams, conjugates, and Young tableaux
Venn diagrams, derangements, and Euler's totient function
Polynomial multiplication, Fibonacci, and coin counting
Vandermonde's identity, hockey stick, and stars and bars