2 thieves stole an open chain with 2k white and 2m black beads
Source: Israel Grosman Memorial Mathematical Olympiad 1995 p3
February 15, 2020
combinatorics
Problem Statement
Two thieves stole an open chain with white beads and black beads. They want to share the loot equally, by cutting the chain to pieces in such a way that each one gets white beads and black beads. What is the minimal number of cuts that is always sufficient?