Claims

../

1999_04_01_erdos_lev_rauzy_sandor_sarkozy: The largest subset of one to n whose nonzero subset sums never divide one another has log n / log 2 + O(log log n) elements: a refereed theorem that fixes the leading term the problem asks for and leaves the second open.

2026_07_27_korsky: A manuscript narrowing the largest size to two consecutive values, the floor of log2(n+1) or one more, with the lower value exact on an initial stretch of every dyadic block; posted as a forum proof claim with GPT-5.6 Pro's help.

---