Erdős Problem #326 — Irregular subsequences of additive bases
For a set , say that is an asymptotic additive basis of order if every sufficiently large natural number is a sum of two elements of , with repetitions allowed. The question is whether, for every such , there is an infinite subset , enumerated increasingly as , which is itself an asymptotic additive basis of order and for which the sequence has no finite real limit; equivalently, whether
Bloom, Erdős Problem #326 Formal Conjectures, Erdős Problem 326 Paul Erdős and additive bases
Background
The question concerns the sparsity scale naturally associated with order-two bases: a sequence whose th element is of size comparable to has roughly the scale one expects for representing large integers by pairwise sums. It asks for more than finding a basis with a particular growth rate: from each given basis one must select a still-complete subset whose normalized enumeration does not settle to any finite constant. Bloom, Erdős Problem #326 Paul Erdős and additive bases
Historically, this is related to an earlier question of Erdős about whether an order-two basis could have its enumerated elements asymptotic to a positive constant times . The Erdős Problems entry records that Cassels answered that existence question affirmatively in 1957. That earlier question asks for one basis with convergent normalized growth, whereas the present problem asks for a suitable sub-basis inside every given basis. Bloom, Erdős Problem #326 Cassels, Über Basen der natürlichen Zahlenreihe (1957)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.