MathDB
divided circle

Source: Baltic Way 2004, problem 15

November 20, 2004
combinatorics unsolvedcombinatorics

Problem Statement

A circle is divided into 1313 segments, numbered consecutively from 11 to 1313. Five fleas called A,B,C,DA,B,C,D and EE are sitting in the segments 1,2,3,41,2,3,4 and 55. A flea is allowed to jump to an empty segment five positions away in either direction around the circle. Only one flea jumps at the same time, and two fleas cannot be in the same segment. After some jumps, the fleas are back in the segments 1,2,3,4,51,2,3,4,5, but possibly in some other order than they started. Which orders are possible ?