Erdős problem 645
If ℕ is -coloured then there must exist a monochromatic three-term arithmetic progression such that .
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:a9fc0bf9f08d4c4ac2256bb761db93cc02c9d422df9ac477a80bd53e453f7e24
- Metadata
- sha256:fecc9fc419c696ff8bb4db2ae9b721eda832c7e59c7976546e4523856c372890
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:9a32f2a23f733af2ce609080bd00a21fd69a3d943aa240a4fd26259accb32924
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb