Line 2: Line 2:
 
which are
 
which are
 
B1 B2 B3
 
B1 B2 B3
 +
 
[5  0  0]
 
[5  0  0]
 
[4  1  0]
 
[4  1  0]

Revision as of 14:29, 28 September 2008

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

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood