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

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#176
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, 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

Reported activity

Search problems.science