Skip to content
Home
Problems
Updates
Vela Mathematics Program
/
Problems
/
138
Search or jump
⌘K
Overview
Problem ledger
Claims
Proposed changes
Commits
Reproduce
Problem
erdos:138
If
W
(
k
)
W(k)
is the least
N
N
such that every two-colouring of
{
1
,
…
,
N
}
\{1, \dots, N\}
contains a monochromatic
k
k
-term arithmetic progression, must
W
(
k
+
1
)
−
W
(
k
)
→
∞
W(k+1) - W(k) \to \infty
?
Open Current State
Declared status
open
Formalization
formalized
Prize
$500
Subjects
additive combinatorics
OEIS
A005346
Sources
source:erdos-ai-contributions-wiki
·
source:erdos-problems
·
source:formal-conjectures
·
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