MathDB

Nair and Yuli play the following game:

1.

There is a coin to be moved along a horizontal array with

203

cells.

2.

At the beginning, the coin is at the first cell, counting from left to right.

3.

Nair plays first.

4.

Each of the players, in their turns, can move the coin

1

2

, or

3

cells to the right.

5.

The winner is the one who reaches the last cell first. What strategy does Nair need to use in order to always win the game?

Problem Statement