MathDB

Let

n

be a integer

1<n<2010

, where we have a polygon with

2010

sides and

n

coins, we have to paint the vertices of this polygon with

n

colors and we've to put the

n

coins in

n

vertices of the polygon. In each second the coins will go to the neighbour vertex, going in the clockwise. Determine the values of

n

such that is possible paint and choose the initial position of the coins where in each second the

n

coins are in vertices of distinct colors

Problem Statement