MathDB
hoops

Source: Ireland 2001

July 5, 2009
pigeonhole principlegeometrygeometric transformationrotationcombinatorics unsolvedcombinatorics

Problem Statement

Three hoops are arranged concentrically as in the diagram. Each hoop is threaded with 20 20 beads, 10 10 of which are black and 10 10 are white. On each hoop the positions of the beads are labelled 1 1 through 20 20 as shown. We say there is a match at position i i if all three beads at position i i have the same color. We are free to slide beads around a hoop, not breaking the hoop. Show that it is always possible to move them into a configuration involving no less than 5 5 matches.