Erdős problem 196 · problems.science

Must every permutation of $\mathbb{N}$ , contain a monotone 4-term arithmetic progression?

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:2cd3877b6f71c620fb4285e0b4583f4c7bb143ca5296451570fa01c4da06275d
Metadata: sha256:5667d0173e0839d92fb3dc24d4aa33c710bb7ddddcb765d059e0deae20eb3aab
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:7c12f870d9417ab2878403ee3e9ed6047bf67d84ac8eb8ea18da2f4a702aaff1

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