number-theory / Number Theory, Additive Combinatorics
Let $F(N)$ be the maximal size of $A\subseteq\{1,\ldots,N\}$ such that no $a\in A$ divides the sum of any nonempty subset of $A\setminus\{a\}$. Estimate $F(N)$. The lower bound $F(N)\gg N^{1/5}$ is classical, from constructions of Erdős and Csaba, and every non-dividing set is non-averaging, which gave $F(N)\leq N^{1/4+o(1)}$. The claimed new result is the matching upper bound $F(N)\leq N^{1/5+o(1)}$, obtained by running the Pham-Zakharov density-increment argument one dimension lower through a projective normalization, hence $F(N)=N^{1/5+o(1)}$.
Temporal state
No reconciled state yet.
Append-only history
The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim
Research memory
Let $F(N)$ be the maximal size of $A\subseteq\{1,\ldots,N\}$ such that no $a\in A$ divides the sum of any nonempty subset of $A\setminus\{a\}$. Estimate $F(N)$. The lower bound $F(N)\gg N^{1/5}$ is classical, from constructions of Erdős and Csaba, and every non-dividing set is non-averaging, which gave $F(N)\leq N^{1/4+o(1)}$. The claimed new result is the matching upper bound $F(N)\leq N^{1/5+o(1)}$, obtained by running the Pham-Zakharov density-increment argument one dimension lower through a projective normalization, hence $F(N)=N^{1/5+o(1)}$.
The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim
Evidence graph
No public relationships recorded yet.