Erdős Problem #169 — Reciprocal sums of progression-free sets
For an integer , let range over subsets of the positive integers. Say that is -term-arithmetic-progression-free if there are no positive integers and with all of
in . Define the supremum, allowing the value , by
Estimate . Also, with denoting the two-colour van der Waerden number (the least such that every two-colouring of has a monochromatic -term arithmetic progression), is it true that
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 for every 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
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
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.