IL-GROSSMAN 1995 Problem 3
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?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.