2006 USAMO Problems/Problem 2
Revision as of 19:24, 1 September 2006 by Boy Soprano II (talk | contribs)
Problem
For a given positive integer 
find, in terms of , the minimum value of 
for which there is a set of 
distinct positive integers that has sum greater than but every subset of size has sum at most 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
