Erdős Problem #155 — Eventual one-step growth of Sidon sets
For a positive integer , write . In the B₂ convention for Sidon sets, a set is Sidon when the sums of its subsets of size at most two are all distinct: for with , equality of sums implies . The empty subset is allowed, with sum zero. Define
The question is whether, for every fixed integer , there is an integer such that for every integer ,
Erdős Problems #155 Erdős (1980), A Survey of Problems in Combinatorial Number Theory
Background
Sidon introduced the B₂-sequence viewpoint around 1932–33 in connection with lacunary trigonometric series. For finite sets, the problem concerns how large a set inside an initial interval can be while retaining uniqueness of sums of at most two distinct elements. The question here asks for local control of this extremal function over every fixed interval length, not merely an estimate of its overall size. Erdős (1980), A Survey of Problems in Combinatorial Number Theory Erdős Problems #155
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.