Erdős problem 195 · problems.science

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

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

Problem row: sha256:607875d4ce0ac31682011b93bd5d4ad72d88d0f267ddf2ee9ecfe4f9fb423702
Metadata: sha256:5b3d19ff1319e3fabd77f3a7e9061c10218b734d7d8c10176d8981e47fc2281d
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:fb38fabe5108eecf0e1bc5e835d5bd22275ee93d70dd0fe81fc1fe8ab1fff4f3

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

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science