8 Jan
2004
8 Jan
'04
4:11 p.m.
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? Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com