← All problems

Erdős Problem #169 — Reciprocal sums of progression-free sets

49 years old · traced to

For an integer k≥3k\geq 3, let AA range over subsets of the positive integers. Say that AA is kk-term-arithmetic-progression-free if there are no positive integers aa and dd with all of

a, a+d, a+2d, …, a+(k−1)da,\ a+d,\ a+2d,\ \ldots,\ a+(k-1)d

in AA. Define the supremum, allowing the value +∞+\infty, by

f(k)=sup⁡A is k-term-arithmetic-progression-free ∑n∈A1n.f(k)=\sup_{A\text{ is }k\text{-term-arithmetic-progression-free}}\ \sum_{n\in A}\frac1n.

Estimate f(k)f(k). Also, with W(k)W(k) denoting the two-colour van der Waerden number (the least NN such that every two-colouring of {1,…,N}\{1,\ldots,N\} has a monochromatic kk-term arithmetic progression), is it true that

lim⁡k→∞f(k)log⁡W(k)=∞?\lim_{k\to\infty}\frac{f(k)}{\log W(k)}=\infty?

Erdős Problem #169 Berlekamp (1968)

Background

This extremal problem measures how large a reciprocal sum can be when one fixed progression length is forbidden. It is closely tied to the Erdős–Turán conjecture: every set of positive integers with divergent reciprocal sum should contain arithmetic progressions of every finite length. In particular, the conjecture would force each fixed-length progression-free set to have finite reciprocal sum. Gerver’s result that finiteness of f(k)f(k) for every kk is equivalent to the conjecture makes the size of these suprema a quantitative refinement of that question. Gerver (1977) Integer Sets of Large Harmonic Sum which Avoid Long Arithmetic Progressions

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.