Revision as of 19:45, 28 September 2008 by Ysuo (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)

Alumni Liaison

Ph.D. 2007, working on developing cool imaging technologies for digital cameras, camera phones, and video surveillance cameras.

Buyue Zhang