Erdős problem 28
Erdős-Turán conjecture on additive bases
Suppose every large enough integer can be written as a + b with a and b in a set A. Must the number of ways to write n as such a sum be unbounded as n grows?
Erdős's prize: $500 (history)Open on erdosproblems.com