Suppose the original natural numbers are sorted as 1, 2, ..., N. The distances of two neighbors are 1. Is there any method to reorder the natural number list to maximize the distance of ALL neighbors?
Furthermore, is it possible to find the list to maximize all distances between ith and (i+j)th numbers, where 1<=i<=N, 1<=j<=N, and i+j<=N?
Thanks, Tang Laoya