Erdős problem 645 · problems.science

If ℕ is $2$ -coloured then there must exist a monochromatic three-term arithmetic progression $x,x+d,x+2d$ such that $d>x$ .

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:a9fc0bf9f08d4c4ac2256bb761db93cc02c9d422df9ac477a80bd53e453f7e24
Metadata: sha256:fecc9fc419c696ff8bb4db2ae9b721eda832c7e59c7976546e4523856c372890
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:9a32f2a23f733af2ce609080bd00a21fd69a3d943aa240a4fd26259accb32924

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207