11 Jan
2004
11 Jan
'04
3:10 p.m.
At 11:09 PM 1/8/04 +0000, you wrote:
If we let S be a set of n integers, then how can we determine the lowest number x_k such that x_k is a sum of 1, 2, 3, ..., k distinct elements of S?
I must not be understanding the problem. What is wrong with simply adding up the k smallest elements of S? -A