Let n≥2 be an integer. A sequence α=(a1,a2,...,an) of n integers is called Lima if gcd{ai−aj such that ai>aj and 1≤i,j≤n}=1 , that is, if the greatest common divisor of all the differences ai−aj with ai>aj is 1 . One operation consists of choosing two elements ak and aℓ from a sequence, with k=ℓ , and replacing aℓ by aℓ′=2ak−aℓ .
Show that, given a collection of 2n−1 Lima sequences, each one formed by n integers, there are two of them, say β and γ , such that it is possible to transform β into γ through a finite number of operations.
Notes.
The sequences (1,2,2,7) and (2,7,2,1) have the same elements but are different.
If all the elements of a sequence are equal, then that sequence is not Lima.