Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 1.3 of J. Folkman, On the representation of integers as sums of distinct terms from a fixed sequence, Canad. J. Math. 18 (1966), 643--655: a strictly increasing sequence of positive integers with for all , for some constants and , is subcomplete, so the set of finite subset sums of contains an infinite arithmetic progression. A set with for all and some , , satisfies the hypothesis: exactly elements of lie in , so , which is with ; a larger implies the hypothesis for a smaller one. The theorem therefore answers the question of Problem 344 yes for every set whose counting function is for some , which is the result the site's commentary credits to Folkman. The paper deduces its Theorems 1.1 and 1.2 from it, completeness of such sequences under the necessary residue condition, the second of which proves a conjecture of Erdős in full; the library card folkman_1966_representation_integers_as_sums_distinct_terms digests the paper. Szemerédi and Vu later removed the (their claim page), as did Chen (his claim page). The journal's record gives only the year, so the page is dated 1966-01-01 by convention.
Covers. The sets with $\lvert A\cap{1,\ldots,N}\rvert\gg N^{1/2+\epsilon}$ for some : for them the answer is yes. Nothing at the exponent itself, which is the problem's hypothesis and is settled by the full claims.
Depends on. Nothing in this wiki.
Acceptance. Refereed: Canadian Journal of Mathematics, volume 18 (1966),
pp. 643--655, by the publisher's record. The site's curator, T. F. Bloom,
mentions the theorem in the problem's commentary as the earlier result under
the stronger assumption, but the site's PROVED label credits Szemerédi and
Vu, so the commentary is not listed as reviewed evidence. This claim is
partial, so the problem's standing derives from the full claims. Nothing here
was checked by this project.