Skip to content

Erdős problem 139

Start work

Erdős Problem 139: Let rk(N)r_k(N) be the size of the largest subset of 1,...,N{1,...,N} which does not contain a non-trivial kk-term arithmetic progression. Prove that rk(N)=o(N)r_k(N) = o(N).

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:01e80482e76d698a44426c25029ab3a68f62864ec7832e0cea7631a32ab63984
Metadata
sha256:d9e03d5cd855e43bf48b9d1944b38132b49ce347848b7d514dc145aeb84d6295
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0529c5d09bb7d42070fad185a9bef40182611cdccc9059ed36eae93b3f258252
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON