benchmarks.wiki / Public workspace

Omni-MATH / Denote S as the subset of {1,2,3,…,1000} with the property that none of the sums of two different elements in S is in S. Find the maximum number of elements in S.

Problem

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

problem

Denote SS as the subset of {1,2,3,…,1000}\{1,2,3,\dots,1000\} with the property that none of the sums of two different elements in SS is in SS. Find the maximum number of elements in SS.
Plain-text mathematical notation (without MathML)
Denote S as the subset of {1,2,3,…,1000} with the property that none of the sums of two different elements in S is in S. Find the maximum number of elements in S.
Original LaTeX notation
Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements in $S$.

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