Skip to content

Erdős problem 138

Start work

If W(k)W(k) is the least NN such that every two-colouring of {1,…,N}\{1, \dots, N\} contains a monochromatic kk-term arithmetic progression, must W(k+1)−W(k)→∞W(k+1) - W(k) \to \infty?

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:c17916f2d3afe3f8d4861ffa106d99e6c8069d001a42fb140be2eb5052a8838c
Metadata
sha256:9852f3f41655e6466c2c94e48553199887903735cd8b4a04bf0657052fca9275
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:1fc845479828edbd118583794fc78b3ac8a88564b4f23fc2922bcc97283afa98
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON