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 nPf(n)|\sum_{n \in P} f(n)| \ge \ell. In particular, is N(k,2)CkN(k, 2) \le C^k?
Retained from Erdős Problems · not edited here
Formal statements
Not classified
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 0 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page