The Erdős-Turán additive basis conjecture asserts that if a set
of nonnegative integers is an additive
basis in which every sufficiently large integer is
a sum of two members of
,
then the number of such representations is unbounded (Erdős and Turán
1941). With ordered representations and repetition allowed, put
The hypothesis is for all sufficiently large
, and the conclusion is
. The conjecture does
not assert that
tends to infinity.
The problem remains open (Borwein et al. 2006, Bloom 2026). It concerns additive representations and is distinct from the Erdős-Turán conjecture about arithmetic progressions.
This is problem 28 in the Erdős problems collection (Bloom 2026).