Erdős problem 1186
What is the minimum asymptotic density of monochromatic -term arithmetic progressions in every two-colouring of ? The exact certificate gives , matching the known 548-bead colouring.
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:c48d39a84344e912536b188f5bbc8065de2b8ed29bdec5b886c658d2e741bb32
- Metadata
- sha256:1c5650499d88f6a161182e8644426f8a974679027d7fff35b330571f986fb23d
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:6c91addd5fa2c96b593e7dac559df5f6b8cabd0c86855440b503323eba01cf6b
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207