Coloring the vertices of a n-gon
Source: Moldova TST Problem 4
March 31, 2015
combinatoricsElementary counting
Problem Statement
In how many ways can we color exactly vertices of an -gon in red such that any consecutive vertices are not both red. (Vertices are considered to be labeled)