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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:0e722ea5bfea39b5ca445d17b73770ea530bbad4db9d9712aa395ade4d9f73d0
Metadata
sha256:bbaaf80a2c54d9ff8f52552a8943d2104f7a8e73d72434d4e16cb782d721b879
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:729d643c1affb87a7fed021f8583c5d09af6dce2889096f5c7eba004bacf4b65
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page