For a positive integer n, what is the largest k such that
the numbers 1,2, ... ,n can be put into k boxes so that
the sum of the numbers in each box is the same?
If k is even they can be put in k=n/2 boxes with 2 in each box:
If k is odd they can be put into k=(n+1)/2 boxes:
solution as for the next smaller even number but put the largest number in its own box.
Edited on February 11, 2016, 12:16 pm
Posted by Jer
on 2016-02-11 09:20:44