Erdős Problem #13 — Largest set in with no member dividing a sum of two larger
Let be a sequence of integers where no divides the sum of two larger 's. Probably
References
P. Erdős, Problems and results on combinatorial number theory, A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., 1971), North-Holland (1973), 117-138.
Progress summary
A 2023 paper claims the conjectured one-third limit is correct, with an exact bound for all sufficiently large intervals.
Erdős and Sárközy asked whether every admissible set in has size at most ; Erdős later offered a prize for the weaker bound .
Known results
- Szemerédi proved that sufficiently large sets contain distinct with , though not necessarily with .
January 17, 2023 claimed solution
Benjamin Bedert's paper claims for an absolute constant and, for all sufficiently large , the sharper bound . The construction shows sharpness, so it settles the stated asymptotic conjecture if accepted.
Current status (as of September 2026): The asymptotic conjecture is claimed solved by Bedert's paper, with the sharp bound for sufficiently large ; independent verification was not found.
Sources
Solutions 0
No solutions have been posted yet.