Skip to content

Erdős problem 195

Start work

What is the largest kk such that in any permutation of Z\mathbb{Z} there must exist a monotone kk-term arithmetic progression x1<⋯<xkx_1 < \cdots < x_k?

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:607875d4ce0ac31682011b93bd5d4ad72d88d0f267ddf2ee9ecfe4f9fb423702
Metadata
sha256:5b3d19ff1319e3fabd77f3a7e9061c10218b734d7d8c10176d8981e47fc2281d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:fb38fabe5108eecf0e1bc5e835d5bd22275ee93d70dd0fe81fc1fe8ab1fff4f3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON