|
||||||||||||
|
||||||||||||
| ||||||||||||
Alfred, I am going to assume that the addends have to be positive integers. The easiest solution is to just count them. If the addends have to be positive integers then the least possible addend is 1. If one on them is 1 then the possibilities are
If none of the addends is a 1 then the smallest possible addend is a 2 and the possibilities are
If neither a 1 or 2 are addends then the smallest possible is 3 and the only possibility is
Harley | ||||||||||||
|
||||||||||||
Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences. |