Switching letters so that long word is not periodic
Source: XVIII Tuymaada Mathematical Olympiad (2011)
July 29, 2011
combinatorics unsolvedcombinatorics
Problem Statement
In a word of more than letters, any two consecutive letters are different. Prove that one can change places of two consecutive letters so that the resulting word is not periodic, that is, cannot be divided into equal subwords.