The solution of a combinatorial problem

Is exposed a procedure  in order to determine the solution of a combinatorial problem. The data of the problem are a natural N and a positive real Δ. The solution of the problem are N positive real such that the succession of the 2^N-1 sums, each defined by possessing like addends the elements of one of the as many combinations of the N numbers, it can increasingly be ordered turning out that the 2^N-2 successive increments are all equal to Δ.