MathDB
Combinatorics

Source: ARO 2021 11.8

April 20, 2021
combinatorics

Problem Statement

Each girl among 100100 girls has 100100 balls; there are in total 1000010000 balls in 100100 colors, from each color there are 100100 balls. On a move, two girls can exchange a ball (the first gives the second one of her balls, and vice versa). The operations can be made in such a way, that in the end, each girl has 100100 balls, colored in the 100100 distinct colors. Prove that there is a sequence of operations, in which each ball is exchanged no more than 1 time, and at the end, each girl has 100100 balls, colored in the 100100 colors.