Moldovan traditional dance
Source: BMO SL 2019, C1
November 8, 2020
combinatorics
Problem Statement
100 couples are invited to a traditional Modolvan dance. The people stand in a line, and then in a , (not necessarily adjacent) many swap positions. Find the least such that whatever the initial order, they can arrive at an ordering where everyone is dancing next to their partner in at most steps.