MathDB

Two players play the following game. At the outset there are two piles, containing

10,000

and

20,000

tokens,respectively . A move consists of removing any positive number of tokens from a single pile

or

removing

x>0

tokens from one pile and

y>0

tokens from the other , where

x+y

is divisible by

2015

. The player who can not make a move loses. Which player has a winning strategy

Problem Statement