MathDB
Find the number of distinct

Source: JBMO 2017, Q4

June 26, 2017
combinatorial geometrycombinatorics

Problem Statement

Consider a regular 2n-gon P P,A1,A2,,A2nA_1,A_2,\cdots ,A_{2n} in the plane ,where nn is a positive integer . We say that a point SS on one of the sides of PP can be seen from a point EE that is external to PP , if the line segment SESE contains no other points that lie on the sides of PP except SS .We color the sides of PP in 3 different colors (ignore the vertices of PP,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to PP , points of most 2 different colors on PP can be seen .Find the number of distinct such colorings of PP (two colorings are considered distinct if at least one of sides is colored differently).
Proposed by Viktor Simjanoski, Macedonia
JBMO 2017, Q4