benchmarks.wiki / Public workspace

Omni-MATH / Let S be a subset of the set {1,2,3,…,2015} such that for any two elements a,b∈S, the difference a−b does not divide the sum a+b. Find the maximum possible size of S.

Problem

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

problem

Let SS be a subset of the set {1,2,3,…,2015}\{1,2,3, \ldots, 2015\} such that for any two elements a,b∈Sa, b \in S, the difference a−ba-b does not divide the sum a+ba+b. Find the maximum possible size of SS.
Plain-text mathematical notation (without MathML)
Let S be a subset of the set {1,2,3,…,2015} such that for any two elements a,b∈S, the difference a−b does not divide the sum a+b. Find the maximum possible size of S.
Original LaTeX notation
Let $S$ be a subset of the set $\{1,2,3, \ldots, 2015\}$ such that for any two elements $a, b \in S$, the difference $a-b$ does not divide the sum $a+b$. Find the maximum possible size of $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