MathDB
n hoops on a circle

Source: Flanders Math Olympiad 2020 p4

December 24, 2022
combinatorics

Problem Statement

There are nn hoops on a circle. Rik numbers all hoops with a natural number so that all numbers from 11 to nn occur exactly once. Then he makes one walk from hoop to hoop. He starts in hoop 11 and then follows the following rule: if he gets to hoop kk, then he walks to the hoop that places kk clockwise without getting into the intermediate hoops. The walk ends when Rik has to walk to a hoop he has already been to. The length of the walk is the number of hoops he passed on the way. For example, for n=6n = 6 Rik can take a walk of length 55 as the hoops are numbered as shown in the figure. https://cdn.artofproblemsolving.com/attachments/2/a/3d4b7edbba4d145c7e00368f9b794f39572dc5.png (a) Determine for every even nn how Rik can number the hoops so that he has one walk of length nn.
(b) Determine for every odd nn how Rik can number the hoops so that he has one walk of length nāˆ’1n - 1.
(c) Show that for an odd nn there is no such numbering of the hoops that Rik can make a walk of length nn.