2006 USAMO Problems/Problem 2
Revision as of 11:03, 12 July 2006 by Ragnarok23 (talk | contribs)
Problem
For a given positive integer k find, in terms of k, the minimum value of 
for which there is a set of 
distinct positive integers that has sum greater than but every subset of size k has sum at most 
.
