Revision as of 18:34, 28 September 2008 by Jahlborn (Talk)

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


It seems it is this problem is easy enough to write out all the possibilities.

poss 1. (5)(0)(0) This stands for all five items in any of the three boxes because they are indistinguishable poss 2. (4)(1)(0) This stands for four items in one of the three boxes and the remaining item in one of the remaining two boxes. poss 3. (3)(2)(0) Same reasoning poss 4. (3)(1)(1) poss 5. (2)(2)(1)


--Jahlborn 22:34, 28 September 2008 (UTC)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood