Skip to content

Erdős problem 197

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:6e6f54be56f874c3b1ccdeea46dea1c767b8db855e88f5bd923bc6f798d42f44
Metadata
sha256:c550ac2d3355aa84787761e435eb61fbf5f32f1cc1af23a1d83f581f93ce4af2
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:33966ce04d0c8c71ee42b1d52189dd359f94396a576d1dee7ea2b57c84ab1a84
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON