Problem

Source: Romania TST 1995 4.1

Tags: Coloring, polygon, combinatorics, combinatorial geometry



How many colorings of an $n$-gon in $p \ge 2$ colors are there such that no two neighboring vertices have the same color?