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.
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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:287ae5cb1a8027c6f3d3ac00bc49312b801fd4983304fca206c7f11a0529b718
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207