Erdős–Turán conjecture on additive bases
If every sufficiently large integer is a sum of two elements of a set B of natural numbers, must the number of such representations be unbounded?
Summary
Paul Erdős and Pál Turán posed the question in 1941. Erdős showed in 1956 that such bases exist whose representation counts grow only like log n, and in 2006 Borwein, Choi and Chu proved that the count must sometimes exceed 7.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.