Skip to content

Erdős problem 142

Start work

Prove an asymptotic formula for rk(N)r_k(N), the largest possible size of a subset of {1,…,N}\{1, \dots, N\} that does not contain any non-trivial kk-term arithmetic progression.

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:c80214155cef9b303b8801c6ab6b2e01034382bffa473a51af3a100c7ba027c4
Metadata
sha256:13c7ed9299f7c666945872365a01a392ea4abc4b6ea9670ddd96b3b89b577f48
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:96898eb3c294fe16027eac94ba984734882c2f10ee85ed58a9627b29d5e41238
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON