On an inverse problem in additive number theory (Q2317440): Difference between revisions

For a sequence \(A=a_1<a_2< \ldots\) of positive integers, let \(P(A)\) denote the set of all integers which can be represented as a finite sum of distinct terms of \(A\). \textit{S. A. Burr} and \textit{R. L. Graham} [in: Combinatorial theory and its applications. Vol. I, Colloq. Math. Soc. János Bolyai 4, 199--211 (1970; Zbl 0221.90033)] asked for characterizations for sets \(S\) of integers which are equal to \(P(A)\) for some \(A\). \textit{Y. Chen} and \textit{J. Wu} [Eur. J. Comb. 34, No. 5, 841--845 (2013; Zbl 1322.11025)] proved: if a sequence \(B=b_1<b_2< \ldots\) of integers satisfies \(b_1\ge 11\), \(b_2\ge 3b_1+5\), \(b_3\ge 3b_2+3\) and \(b_{n+1}>3b_n-b_{n-2}\) \((n\ge 3)\), then there exists a sequence of positive integers \(A\) such that \(P(A)= \mathbb{N}\setminus B\). In the paper under review, if \(b_2=3b_1+5\), the authors determine the critical value for \(b_3\) such that there exists an infinite sequence \(A\) of positive integers for which \(P(A)=\mathbb{N}\setminus B\). Namely, \(b_3=4b_1+6\).