MathDB
We will get the (1,1,...,1) sequence - [ILL 1977]

Source:

January 11, 2011
inductioncombinatorics proposedcombinatorics

Problem Statement

Consider a sequence of numbers (a1,a2,,a2n).(a_1, a_2, \ldots , a_{2^n}). Define the operation S((a1,a2,,a2n))=(a1a2,a2a3,,a2n1a2n,a2na1).S\biggl((a_1, a_2, \ldots , a_{2^n})\biggr) = (a_1a_2, a_2a_3, \ldots , a_{2^{n-1}a_{2^n}, a_{2^n}a_1).} Prove that whatever the sequence (a1,a2,,a2n)(a_1, a_2, \ldots , a_{2^n}) is, with ai{1,1}a_i \in \{-1, 1\} for i=1,2,,2n,i = 1, 2, \ldots , 2^n, after finitely many applications of the operation we get the sequence (1,1,,1).(1, 1, \ldots, 1).