MathDB
swaps with balls

Source: JBMO 2011 Shortlist C4

October 14, 2017
JBMOcombinatorics

Problem Statement

In a group of nn people, each one had a different ball. They performed a sequence of swaps, in each swap, two people swapped the ball they had at that moment. Each pair of people performed at least one swap. In the end each person had the ball he/she had at the start. Find the least possible number of swaps, if: a) n=5n = 5, b) n=6n = 6.