Revision as of 16:24, 5 October 2008 by Jahlborn (Talk)

How many ways are there to distribute five indistinguishable objects into three identical boxes?

So this means five objects into three boxes. It doesn't matter the order so we can count out our possibilities.


1.) 5-0-0

2.) 4-1-0

3.) 3-1-1

4.) 2-2-1

5.) 2-3-0


Now there are only five possibilities due to the fact that everything is indistinguishable. What i have shown is the out comes, all five objects into one box or four in one and one in another. ect


This is correct as far as I know. I really like your style, short and sweet. Though, I don't think you sufficiently explained why the order doesn't matter. Great work though! --Jahlborn 21:24, 5 October 2008 (UTC)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood