IMO Shortlist 2017 problem C2
Let be a positive integer. Define a chameleon to be any sequence of letters, with exactly occurrences of each of the letters and . Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon , there exists a chameleon such that cannot be changed to using fewer than swaps.