2016 Set Operations Problem

Find the least integer \(N\) such that if any 2016 elements are removed from the set \( \{1, 2,\ldots,N\} \), one can still find 2016 distinct numbers among the remaining elements with sum \(N\).

×

Problem Loading...

Note Loading...

Set Loading...