Erdős Problem #158 — Density of sets with bounded additive representations
Let , and let be infinite. For each , define the number of unordered representations of by elements of as
Assume that for every . Must the counting function of satisfy
where tends to infinity through positive integers? Erdős Problem #158
Background
The multiplicity bound is on unordered representations: each pair is counted once by imposing . The stricter bound is the Sidon-set condition. The problem is associated with the 1994 paper by Erdős, Sárközy, and Sós, “On Sum Sets of Sidon Sets, I.” Erdős Problem #158 Erdős, Sárközy, and Sós (1994)
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.