Skip to content

Erdős problem 139

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).

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:0529c5d09bb7d42070fad185a9bef40182611cdccc9059ed36eae93b3f258252
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page