Given $\ n,k\in\mathbb{N},\ $ one integer is chosen from each interval $\ [\ n(j-1),\ nj\ ), \ j\in\{1,\ldots,k\},\ $ such that no three of these numbers form a three-term arithmetic progression. What is the largest value of $k$ in terms of $n$ for this to be possible? Is this simply equivalent t...