Erdős problem 176 · problems.science

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$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

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

Sources

Search problems.science