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?

Nothing has been recorded here yet.

How far the record reaches2 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. FormalNone associated
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingFormal declaration

No formal declaration is associated with this question.

A formal statement is the first thing a check can run against.

Read what the sources hold
Where the source files it123 share a topic
Additive Combinatorics102Arithmetic Progressions27Discrepancy16
None carries a Standing. Browse the topic.
Start workOpen sources