Revision as of 14:41, 5 October 2008 by Norlow (Talk | contribs)

This problem is quite easy to do by listing all the possible combinations since there are only 5 objects and 3 boxes.

5 0 0 4 1 0 3 2 0 3 1 1 2 2 1

These are the only distinguishable ways to put 5 indistinguishable objects into 3 indistinguishable objects and therefore the solution is: 5 ways.

  • ysuo@purdue.edu
  • --ysuo 18:17, 28 September 2008 (UTC)

I think this is good, but you didn't say how you know these are all the possible ways. I would say that is not as important as getting the right answer, but it would help.

I think it's nice overall though.

--Norlow 19:41, 5 October 2008 (UTC)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood