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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

No source in this release retained material for this Problem beyond its catalogue entry.

Reported activity

Reported by these sources. Not reviewed here.

• AI standalone

  Erdős AI contributions wiki · 23 Jun, 2026

  Machine

  Codex, GPT-5.5 Pro

  Open the source record

• AI alongside literature

  Erdős AI contributions wiki · 21 Jun, 2026

  Machine

  Codex, GPT-5.5 Pro

  Open the source record

• argument

  VibeMathed

  Machine

  Codex 5.5, ChatGPT-5.5 Pro

  Reported outcome

  partial

  Open the source record