MathDB

Kunal and Arnab play a game as follows. Initially there are

2

piles of coins with

x

and

y

coins respectively. The game starts with Kunal. In each turn a player chooses one pile and removes as many coins as he wants from that pile. The game goes on and the last one to remove a coin loses. Determine all possible values of

(x,y)

which ensure Kunal's victory against Arnab given both os them play optimally. \\ You are required to find an exhaustive set of solutions

Problem Statement