OFM 2020 J3

Let $n$ be an integer greater than or equal to $1$ . Find, as a function of $n$ , the smallest integer $k\ge 2$ such that, among any $k$ real numbers, there are necessarily two of which the difference, in absolute value, is either strictly less than $1 / n$ , either strictly greater than $n$ .