Erdős Problem #882 — Subset-Sum Divisibility Antichains
For a finite set , call a subset-sum antichain if, whenever are distinct nonempty subsets, the two sums and do not divide one another. Let be the largest possible cardinality of such a set . Determine the asymptotic growth of ; formally,
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.