2017 Guts #29: Cycle factoring
Source:
February 21, 2017
combinatorics
Problem Statement
Yang has the sequence of integers . He makes swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with . How many different sequences of swaps can Yang do to achieve his goal?