Revision as of 14:29, 28 September 2008 by Kumar29 (Talk)

The total number of ways could be found by innumerating all the possible cases, which are B1 B2 B3

[5 0 0] [4 1 0] [3 2 0] [3 1 1] [2 2 1]

Hence 5 is the answer.

Alumni Liaison

Prof. Math. Ohio State and Associate Dean
Outstanding Alumnus Purdue Math 2008

Jeff McNeal