MathDB

A and B plays a game on a pyramid whose base is a

2016

-gon. In each turn, a player colors a side (which was not colored before) of the pyramid using one of the

k

colors such that none of the sides with a common vertex have the same color. If A starts the game, find the minimal value of

k

for which

B

can guarantee that all sides are colored.

Problem Statement