Problem

Source: 6-th Hong Kong Mathematical Olympiad 2003

Tags: symmetry, combinatorics unsolved, combinatorics



Let $ABCDEF$ regular hexagon of side length $1$ and $O$ is its center. In addition to the sides of the hexagon, line segments from $O$ to the every vertex are drawn, making as total of $12$ unit segments. Find the number paths of length $2003$ along these segments that star at $O$ and terminate at $O$.