2016 USAJMO Problems/Problem 4
Problem
Find, with proof, the least integer 
such that if any 
elements are removed from the set 
, one can still find distinct numbers among the remaining elements with sum .
Solution
These problems are copyrighted © by the Mathematical Association of America. 
See also
| 2016 USAJMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAJMO Problems and Solutions | ||
