benchmarks.wiki / Public workspace

Omni-MATH / Find, with proof, the least integer N such that if any 2016 elements are removed from the set {1,2,...,N} , one can still find 2016 distinct numbers among the remaining elements wi…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Find, with proof, the least integer NN such that if any 20162016 elements are removed from the set {1,2,...,N}\{1, 2,...,N\} , one can still find 20162016 distinct numbers among the remaining elements with sum NN .
Plain-text mathematical notation (without MathML)
Find, with proof, the least integer N such that if any 2016 elements are removed from the set {1,2,...,N} , one can still find 2016 distinct numbers among the remaining elements with sum N .
Original LaTeX notation
Find, with proof, the least integer $N$ such that if any $2016$ elements are removed from the set $\{1, 2,...,N\}$ , one can still find $2016$ distinct numbers among the remaining elements with sum $N$ .

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import