Sunday, July 22, 2012

Divisor - Nim

Alice and Bob are back in gaming. This time it is with numbers. They take a jar containing all the numbers from 1 to n. The game goes on like this. Alice starts the game, she picks a number x from numbers in the jar. Then, she removes all the divisors of x (including x). Alice and Bob repeat the steps without replacement. The player to draw the last number wins. Who will win the game (in terms of n if it depends on n) ?

Courtesy : Vinod


Phani Deep said...
This comment has been removed by the author.
pathankhan salman said...

Player needs to draw all the divisors of the number he decided "on the table". Say player decides to x = 10, and he doesn't have 1,5 on the table, it is ok if he draws only 2,10.