Erdős problem 197 · problems.science

Can $\mathbb{N}$ be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?

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:6e6f54be56f874c3b1ccdeea46dea1c767b8db855e88f5bd923bc6f798d42f44
Metadata: sha256:c550ac2d3355aa84787761e435eb61fbf5f32f1cc1af23a1d83f581f93ce4af2
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:33966ce04d0c8c71ee42b1d52189dd359f94396a576d1dee7ea2b57c84ab1a84

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