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 $N$ for which there is a set of $2k+1$ distinct positive integers that has sum greater than $N$ but every subset of size k has sum at most $\frac{N}{2}$.

Solution

See Also

Invalid username
Login to AoPS