ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite set A⊆Z>0A\subseteq\mathbb{Z}_{>0}, define its subset-sum set by H(A)={∑a∈Ba:B⊆A}H(A)=\left\{\sum_{a\in B}a:B\subseteq A\right\}. Let g3(n)g_3(n) be the least integer NN such that there exists an nn-element set A⊆{1,…,N}A\subseteq\{1,\ldots,N\} for which H(A)H(A) contains no nonconstant three-term arithmetic progression; equivalently, there are no distinct x,y,z∈H(A)x,y,z\in H(A) with x+z=2yx+z=2y. The Erdős–Sárközy question asks whether g3(n)≫3ng_3(n)\gg 3^n, that is, whether there exists a constant c>0c>0 such that g3(n)≥c3ng_3(n)\ge c3^n for all sufficiently large nn.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.