My question is based on problem 1 in https://projects.iq.harvard.edu/files/stat110/files/strategic_practice_and_homework_2.pdf
Is there a compact solution to the question below?
Given a set of size $n$, what is the probability that all $k$ partitions have at least one element?