Erdős problem 966
Let . Does there exist a set that contains no non-trivial arithmetic progression of length , yet in any -colouring of there must exist a monochromatic non-trivial arithmetic progression of length ? Answered in the affirmative.
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:b090c090333328c4e3474dbc1b2811f190d57ede5ecfe91a111c663160c414c4
- Metadata
- sha256:07333575bc7bcf1b1cb544210627a26eaea8c7894f2cb0b7ed3616d9e49dff4f
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:287ae5cb1a8027c6f3d3ac00bc49312b801fd4983304fca206c7f11a0529b718
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb