Skip to content
Home
Problems
Updates
Vela Mathematics Program
/
Problems
/
176
Search or jump
⌘K
Overview
Problem ledger
Claims
Proposed changes
Commits
Reproduce
Problem
erdos:176
Let
N
(
k
,
ℓ
)
N(k, \ell)
be the least
N
N
such that every
f
:
[
N
]
→
{
−
1
,
1
}
f : [N] \to \{-1, 1\}
has a
k
k
-term arithmetic progression
P
P
with
∣
∑
n
∈
P
f
(
n
)
∣
≥
ℓ
|\sum_{n \in P} f(n)| \ge \ell
. In particular, is
N
(
k
,
2
)
≤
C
k
N(k, 2) \le C^k
?
Open Current State
Declared status
open
Formalization
not formalized
Subjects
additive combinatorics
·
arithmetic progressions
·
discrepancy
OEIS
possible
Sources
source:erdos-ai-contributions-wiki
·
source:erdos-problems
·
source:vibemathed
Statement
www.erdosproblems.com
Matching claims
0
No direct claims
This problem has no directly related claim record.
Browse this Repository’s Claims