| Line 1: | Line 1: | ||
| − | The total number of ways could be found by | + | The total number of ways could be found by enumerating all the possible cases, |
which are | which are | ||
| Line 15: | Line 15: | ||
Hence 5 is the answer. | Hence 5 is the answer. | ||
| + | |||
| + | ---- | ||
| + | |||
| + | '''Comments:''' | ||
| + | |||
| + | Hi, the only addition that I would make to your solution is to demonstrate why B1 >= B2 >= B3. Otherwise, it isn't clear why [1 4 0] is not a possible case. | ||
| + | |||
| + | :--[[User:Nclaus|Nathan Claus]] 12:21, 5 October 2008 (UTC) | ||
Latest revision as of 07:21, 5 October 2008
The total number of ways could be found by enumerating 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.
Comments:
Hi, the only addition that I would make to your solution is to demonstrate why B1 >= B2 >= B3. Otherwise, it isn't clear why [1 4 0] is not a possible case.
- --Nathan Claus 12:21, 5 October 2008 (UTC)
