Skip to content

Problem

erdos: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 nPf(n)|\sum_{n \in P} f(n)| \ge \ell. In particular, is N(k,2)CkN(k, 2) \le C^k?

Declared status
open
Formalization
not formalized
OEIS
possible

Matching claims

0
No direct claims
This problem has no directly related claim record.

Search problems.science

Find a Problem, Result, source, or page