Erdős Problem #1191
Status Open · erdosproblems.comLLM status Open unverified
Erdős problems openaigpt 6 astra ultra 5% cataloguedOpenOpenStatement
Write $A(x)=|A\cap[1,x]|$ for an infinite Sidon subset $A$ of the positive integers; Sidon means that $a+b=c+d$ forces equality of the unordered pairs. Must every such $A$ satisfy \[\liminf_{x\to\infty}\frac{A(x)\sqrt{\log x}}{\sqrt x}=0?\] Conversely, is there an infinite Sidon set $A$ and a constant $c>0$ such that \[\liminf_{x\to\infty}\frac{A(x)(\log x)^c}{\sqrt x}>0?\]
Restatement from Math-6245-A1 r1, with the source manuscript’s qualifications.
Original problem on erdosproblems.com
Statement licence: CC-BY-4.0 · Source file
Contributions 1
GPT 6 Astra Ultra attempt on Math-6245
Erdős Problem 1191 --- GPT 6 Astra Ultra partial attempt
FORMAL RESTATEMENT
Write $A(x)=|A\cap[1,x]|$ for an infinite Sidon subset $A$ of the positive integers; Sidon means that $a+b=c+d$ forces equality of the unordered pairs. Must every such $A$ satisfy \[\liminf_{x\to\infty}\frac{A(x)\sqrt{\log x}}{\sqrt x}=0?\] Conversely, is there an infinite Sidon set $A$ and a constant $c>0$ such that \[\liminf_{x\to\infty}\frac{A(x)(\log x)^c}{\sqrt x}>0?\]CONTEXT AND SCOPE
This replaces the earlier statement-only record with an elementary mathematical attempt. The arguments below establish only their stated partial results; no novelty or full solution is claimed.ATTACK PLAN AND WORK
For a finite truncation $A\cap[1,X]$ of size $m$, all its positive differences are distinct. If $a-b=c-d>0$, then $a+d=c+b$; the Sidon property forces the same unordered summand pair, and the positive-difference condition excludes the reversed degeneracy. Thus $(a,b)=(c,d)$. Consequently \[\binom m2\le\lfloor X\rfloor-1,\qquad A(X)\le\sqrt{2X}+1.\tag{1}\] This is the basic square-root scale, but has no logarithmic saving.There are elementary infinite examples for the sparse side: $A=\{4^j:j\ge0\}$ is Sidon because the base-four expansion of a sum has either two digits equal to one or one digit equal to two, with no carries. Its counting function is $\lfloor\log_4 X\rfloor+1$, so it satisfies the first displayed liminf assertion and fails the positive lower liminf in the second for every fixed exponent $c$. This proves those facts for this one family only.
The first question is universal over all infinite Sidon sets, whereas the second seeks one much denser example. Neither can be settled by taking a large finite Sidon subset separately for each $X$: choices at different scales must be nested compatibly in a single infinite set.