Difference between revisions of "2016 USAJMO Problems/Problem 4"
(Created page with "== Problem == Find, with proof, the least integer <math>N</math> such that if any <math>2016</math> elements are removed from the set <math>{1, 2,...,N}</math>, one can still ...") |
(No difference)
|
Revision as of 13:08, 22 April 2016
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
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.
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 |