Skip to content

Erdős problem 176

Let N(k,ℓ)N(k, \ell) be the least NN such that every f:[N]→{−1,1}f : [N] \to \{-1, 1\} has a kk-term arithmetic progression PP with ∣∑n∈Pf(n)∣≥ℓ|\sum_{n \in P} f(n)| \ge \ell. In particular, is N(k,2)≤CkN(k, 2) \le C^k?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

Let $N(k, \ell)$ be the least $N$ such that every $f : [N] \to \{-1, 1\}$ has a $k$-term arithmetic progression $P$ with $|\sum_{n \in P} f(n)| \ge \ell$. In particular, is $N(k, 2) \le C^k$?

Open exact source location