MathDB
Circle divided into 2n equal sections

Source: Iran second round 2020 ,Day2 , P6

July 15, 2020
combinatorics

Problem Statement

Divide a circle into 2n2n equal sections. We call a circle filled if it is filled with the numbers 0,1,2,,n10,1,2,\dots,n-1. We call a filled circle good if it has the following properties:
ii. Each number 0an10 \leq a \leq n-1 is used exactly twice iiii. For any aa we have that there are exactly aa sections between the two sections that have the number aa in them.
Here is an example of a good filling for n=5n=5 (View attachment) Prove that there doesn’t exist a good filling for n=1399n=1399