Erdős problem 139

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