Erdős Problem #176 — Signed sums on arithmetic progressions
Let be the minimal such that for any there must exist a -term arithmetic progression such that Find good upper bounds for . Is it true that for any there exists some such that What about or
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Erdős Problem asks for upper bounds on the least forcing a -term arithmetic progression whose signed sum has absolute value at least . In particular, it asks whether ; the problem page continues to label this open.
Known results
- Spencer, 1973: if with odd, then .
- Erdős, 1963: for every , , with as and as .
- A local-lemma argument gives , hence lower bounds as .
If correct, the first would settle the stated exponential question; however, these remain unverified comment-level claims, with no independent published confirmation. Small computations instead suggest the conjecture .
Current status (as of July 2026): The exponential lower bounds and classical special cases are known, while the claimed polynomial upper bounds for and remain unverified; the problem is officially open.
Solutions 0
No solutions have been posted yet.