Basic Problemscountingpartitioncombinatorics
Ways to Partition a Set
Given a set of n distinct elements, count the number of ways to split it into exactly k non-empty, unordered subsets, known as the Stirling number of the second kind.
Do this lesson first: climbing stairsThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.