On a problem of Erdos and S\'ark\"ozy about sequences with no term dividing the sum of two larger terms
Abstract
In 1970, Erdos and S\'ark\"ozy wrote a joint paper studying sequences of integers a1<a2<… having what they called property P, meaning that no ai divides the sum of two larger aj,ak. In the paper, it was stated that the authors believed, but could not prove, that a subset A⊂[n] with property P has cardinality at most |A|≤slant n3+1. In 1997, Erdos offered \100 for a proof or disproof of the claim that |A|≤slant n3+C, for some absolute constant C. We resolve this problem, and in fact prove that |A|≤slant n3+1 for n$ sufficiently large.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.