Erdős Problem #864 — Almost unique pair-sum sets
For a positive integer , let and, for each integer , let
Thus each unordered pair is counted once, including a diagonal pair . Define
Estimate as . In particular, is
true? Erdős Problem #864
Background
The problem is attributed to Erdős and Freud and is associated with their 1991 paper, “On sums of a Sidon-sequence.” A Sidon set is a set in which every integer has at most one representation as an unordered pair sum. The construction relevant here uses such a set together with its reflection in the midpoint of the interval; the many repeated sums are concentrated at the single central value. Erdős Problem #864 Erdős and Freud, On sums of a Sidon-sequence (1991)
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.