← All problems

Erdős Problem #882 — Subset-Sum Divisibility Antichains

1 year old · traced to

For a finite set A⊆{1,…,n}A\subseteq\{1,\ldots,n\}, call AA a subset-sum antichain if, whenever S1,S2⊆AS_1,S_2\subseteq A are distinct nonempty subsets, the two sums ∑a∈S1a\sum_{a\in S_1}a and ∑a∈S2a\sum_{a\in S_2}a do not divide one another. Let M(n)M(n) be the largest possible cardinality of such a set AA. Determine the asymptotic growth of M(n)M(n); formally,

lim⁡n→∞M(n)log⁡2n=1.\lim_{n\to\infty}\frac{M(n)}{\log_2 n}=1.
References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.