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 $\displaystyle k$ find, in terms of $\displaystyle k$, the minimum value of $\displaystyle N$ for which there is a set of $\displaystyle 2k+1$ distinct positive integers that has sum greater than $\displaystyle N$ but every subset of size $\displaystyle k$ has sum at most $\displaystyle N/2$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

Invalid username
Login to AoPS