Skip to content

Erdős problem 176

Start work

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 ∣∑n∈Pf(n)∣≥ℓ|\sum_{n \in P} f(n)| \ge \ell. In particular, is N(k,2)≤CkN(k, 2) \le C^k?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:729d643c1affb87a7fed021f8583c5d09af6dce2889096f5c7eba004bacf4b65
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON