3 solved out of 11 shown (show only solved or open)
OPEN - $500 If$A\subseteq \{1,\ldots,N\}$with$\lvert A\rvert=n$is such that the subset sums$\sum_{a\in S}a$are distinct for all$S\subseteq A$then $N \gg 2^{n}.$ Erdős called this 'perhaps my first serious problem'. The powers of$2$show that$2^n$would be best possible here. The trivial lower bound is$N \gg 2^{n}/n$, since all$2^n$distinct subset sums must lie in$[0,Nn)$. Erdős and Moser [Er56] proved $N\geq (\tfrac{1}{4}-o(1))\frac{2^n}{\sqrt{n}}.$ A number of improvements of the constant have been given (see [St23] for a history), with the current record$\sqrt{2/\pi}$first proved in unpublished work of Elkies and Gleason. Two proofs achieving this constant are provided by Dubroff, Fox, and Xu [DFX21], who in fact prove the exact bound$N\geq \binom{n}{\lfloor n/2\rfloor}$. In [Er73] and [ErGr80] the generalisation where$A\subseteq (0,N]$is a set of real numbers such that the subset sums all differ by at least$1$is proposed, with the same conjectured bound. (The second proof of [DFX21] applies also to this generalisation.) This problem appears in Erdős' book with Spencer [ErSp74] in the final chapter titled 'The kitchen sink'. As Ruzsa writes in [Ru99] "it is a rich kitchen where such things go to the sink". See also [350]. Additional thanks to: Zachary Hunter OPEN -$500
If $A\subseteq \mathbb{N}$ is such that $A+A$ contains all but finitely many integers then $\limsup 1_A\ast 1_A(n)=\infty$.
Conjectured by Erdős and Turán. They also suggest the stronger conjecture that $\limsup 1_A\ast 1_A(n)/\log n>0$.

Another stronger conjecture would be that the hypothesis $\lvert A\cap [1,N]\rvert \gg N^{1/2}$ for all large $N$ suffices.

Erdős and Sárközy conjectured the stronger version that if $A=\{a_1<a_2<\cdots\}$ and $B=\{b_1<b_2<\cdots\}$ with $a_n/b_n\to 1$ are such that $A+B=\mathbb{N}$ then $\limsup 1_A\ast 1_B(n)=\infty$.

SOLVED
Given any infinite set $A\subset \mathbb{N}$ there is a set $B$ of density $0$ such that $A+B$ contains all except finitely many integers.
Conjectured by Erdős and Straus. Proved by Lorentz [Lo54].
OPEN
Is there a set $A\subset\mathbb{N}$ such that $\lvert A\cap\{1,\ldots,N\}\rvert = o((\log N)^2)$ and such that every large integer can be written as $p+a$ for some prime $p$ and $a\in A$?

Can the bound $O(\log N)$ be achieved? Must such an $A$ satisfy $\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{\log N}> 1?$

Such a set is called an additive complement to the primes.

Erdős [Er54] proved that such a set $A$ exists with $\lvert A\cap\{1,\ldots,N\}\rvert\ll (\log N)^2$ (improving a previous result of Lorentz [Lo54] who achieved $\ll (\log N)^3$). Wolke [Wo96] has shown that such a bound is almost true, in that we can achieve $\ll (\log N)^{1+o(1)}$ if we only ask for almost all integers to be representable.

The answer to the third question is yes: Ruzsa [Ru98c] has shown that we must have $\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{\log N}\geq e^\gamma\approx 1.781.$

OPEN
Let $A\subset\mathbb{N}$ be such that every large integer can be written as $n^2+a$ for some $a\in A$ and $n\geq 0$. What is the smallest possible value of $\limsup \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}?$
Erdős observed that this value is finite and $>1$.
Additional thanks to: Timothy Gowers
SOLVED
Let $B\subseteq\mathbb{N}$ be an additive basis of order $k$ with $0\in B$. Is it true that for every $A\subseteq\mathbb{N}$ we have $d_s(A+B)\geq \alpha+\frac{\alpha(1-\alpha)}{k},$ where $\alpha=d_s(A)$ and $d_s(A) = \inf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N}$ is the Schnirelmann density?
Erdős [Er36c] proved this is true with $k$ replaced by $2k$ in the denominator (in a stronger form that only considers $A\cup (A+b)$ for some $b\in B$, see [38]).

Ruzsa has observed that this follows immediately from the stronger fact proved by Plünnecke [Pl70] that (under the same assumptions) $d_S(A+B)\geq \alpha^{1-1/k}.$

Additional thanks to: Imre Ruzsa
OPEN
Find the optimal constant $c>0$ such that the following holds.

For all sufficiently large $N$, if $A\sqcup B=\{1,\ldots,2N\}$ is a partition into two equal parts, so that $\lvert A\rvert=\lvert B\rvert=N$, then there is some $x$ such that the number of solutions to $a-b=x$ with $a\in A$ and $b\in B$ is at least $cN$.

The minimum overlap problem. The example (with $N$ even) $A=\{N/2+1,\ldots,3N/2\}$ shows that $c\leq 1/2$ (indeed, Erdős initially conjectured that $c=1/2$). The lower bound of $c\geq 1/4$ is trivial, and Scherk improved this to $1-1/\sqrt{2}=0.29\cdots$. The current records are $0.379005 < c < 0.380926\cdots,$ the lower bound due to White [Wh22] and the upper bound due to Haugland [Ha16].
SOLVED
We say that $A\subset \mathbb{N}$ is an essential component if $d_s(A+B)>d_s(B)$ for every $B\subset \mathbb{N}$ with $0<d_s(B)<1$ where $d_s$ is the Schnirelmann density.

Can a lacunary set $A\subset\mathbb{N}$ be an essential component?

The answer is no by Ruzsa [Ru87], who proved that if $A$ is an essential component then there exists some constant $c>0$ such that $\lvert A\cap \{1,\ldots,N\}\rvert \geq (\log N)^{1+c}$ for all large $N$.
OPEN
Does there exist $B\subset\mathbb{N}$ which is not an additive basis, but is such that for every set $A\subseteq\mathbb{N}$ of Schnirelmann density $\alpha$ and every $N$ there exists $b\in B$ such that $\lvert (A\cup (A+b))\cap \{1,\ldots,N\}\rvert\geq (\alpha+f(\alpha))N$ where $f(\alpha)>0$ for $0<\alpha <1$?

The Schnirelmann density is defined by $d_s(A) = \inf_{N\geq 1}\frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N}.$

Erdős [Er36c] proved that if $B$ is an additive basis of order $k$ then, for any set $A$ of Schnirelmann density $\alpha$, for every $N$ there exists some integer $b\in B$ such that $\lvert (A\cup (A+b))\cap \{1,\ldots,N\}\rvert\geq \left(\alpha+\frac{\alpha(1-\alpha)}{2k}\right)N.$ It seems an interesting question (not one that Erdős appears to have asked directly, although see [35]) to improve the lower bound here, even in the case $B=\mathbb{N}$. Erdős observed that a random set of density $\alpha$ shows that the factor of $\frac{\alpha(1-\alpha)}{2}$ in this case cannot be improved past $\alpha(1-\alpha)$.

This is a stronger propery than $B$ being an essential component (see [37]). Linnik [Li42] gave the first construction of an essential component which is not an additive basis.

Additional thanks to: Terence Tao
OPEN - $500 Is there an infinite Sidon set$A\subset \mathbb{N}$such that $\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$ for all$\epsilon>0$? The trivial greedy construction achieves$\gg N^{1/3}$. The current best bound of$\gg N^{\sqrt{2}-1+o(1)}$is due to Ruzsa [Ru98]. (Erdős [Er73] had offered \$25 for any construction which achieves $N^{c}$ for some $c>1/3$.) Erdős proved that for every infinite Sidon set $A$ we have $\liminf \frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/2}}=0,$ and also that there is a set $A\subset \mathbb{N}$ with $\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$ such that $1_A\ast 1_A(n)=O(1)$.

Erdős and Rényi have constructed, for any $\epsilon>0$, a set $A$ such that $\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$ for all large $N$ and $1_A\ast 1_A(n)\ll_\epsilon 1$ for all $n$.

OPEN - $500 Is there$A\subseteq \mathbb{N}$such that $\lim_{n\to \infty}\frac{1_A\ast 1_A(n)}{\log n}$ exists and is$\neq 0$? A suitably constructed random set has this property if we are allowed to ignore an exceptional set of density zero. The challenge is obtaining this with no exceptional set. Erdős believed the answer should be no. Erdős and Sárkzözy proved that $\frac{\lvert 1_A\ast 1_A(n)-\log n\rvert}{\sqrt{\log n}}\to 0$ is impossible. Erdős suggests it may even be true that the$\liminf$and$\limsup$of$1_A\ast 1_A(n)/\log n\$ are always separated by some absolute constant.