Erdős Problem #177 — Find the smallest h(d)h(d) such that the following holds.

Find the smallest h(d)h(d) such that the following holds. There exists a function f:N→{−1,1}f:\mathbb{N}\to\{-1,1\} such that, for every d≥1d\geq 1, max⁡Pd∣∑n∈Pdf(n)∣≤h(d),\max_{P_d}\left\lvert \sum_{n\in P_d}f(n)\right\rvert\leq h(d), where PdP_d ranges over all finite arithmetic progressions with common difference dd.

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.