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.
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded 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:c48d39a84344e912536b188f5bbc8065de2b8ed29bdec5b886c658d2e741bb32
- Metadata
- sha256:1c5650499d88f6a161182e8644426f8a974679027d7fff35b330571f986fb23d
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:6c91addd5fa2c96b593e7dac559df5f6b8cabd0c86855440b503323eba01cf6b
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb