How many ways are there to place differently colored balls into identical urns if the urns can be empty?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Distinct Objects into Identical Bins
The problem can be modeled as "distinct objects into any number of identical bins." The answer will be the Bell number , B 5 .
This number can be found with: B 5 = k = 1 ∑ 5 S ( 5 , k ) Where S ( 5 , k ) is the number of distributions of 5 distinct objects into k identical non-empty bins.
S ( 5 , 1 ) = 1 , S ( 5 , 2 ) = 1 5 , S ( 5 , 3 ) = 2 5 , S ( 5 , 4 ) = 1 0 , and S ( 5 , 5 ) = 1
(These values can be found using the recurrence relation identity for Stirling numbers of the second kind )
Thus, B 5 = 1 + 1 5 + 2 5 + 1 0 + 1 = 5 2