Javiera and Claudio play on a board consisting of a row with 2019 cells. Claudio starts by placing a token anywhere on the board. Next Javiera says a natural number k, 1≤k≤n and Claudio must move the token to the right or to the left at your choice k squares and so on.
Javiera wins if she manages to remove the piece that Claudio moves from the board. Determine the smallest n such that Javiera always wins after a finite number of moves. combinatoricsgamegame strategy