Home > Combinatorics, IMO, Olympiad, Problem Solving > Permutation with distinct distances

Permutation with distinct distances

For what values of $n \geq 1$ there exist permutations $(x_1,...,x_n)$ of the set $\{1,2,...,n\}$ such that all the differences $|x_k-k|$ are distinct, for $k=1..n$.

AMM 1989