If is the number of ways five different employees can sit into four indistinguishable offices where any office may have any number of persons including zero, then is equal to:
This is the problem of partitioning a set of 5 distinct elements into or non-empty subsets (since offices are indistinguishable, we use Stirling numbers of the second kind, ).
• 1 office used:
• 2 offices used:
• 3 offices used:
• 4 offices used:
Total ways .
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.