Serving the Quantitative Finance Community

User avatar
Topic Author
Posts: 14
Joined: January 10th, 2008, 1:12 pm

Remove stones

January 16th, 2008, 9:25 am

I found this teaser recently, anyone will suggest a clue to trackle it. Forgive me if it has bee posted before.Alice and Bob play a game in which they take turns removing stones from a heap that initially has n stones.The number of stones removed at each turn must be one less than a prime number. The winner is the player whotakes the last stone. Alice plays first. Prove that there are infinitely many n such that Alice has a winning strat-egy. (For example, if n = 17, then Alice might take 6 leaving 11; then Bob might take 1 leaving 10; thenAlice can take the remaining stones to win.)
User avatar
Posts: 188
Joined: April 20th, 2005, 1:54 pm

Remove stones

January 16th, 2008, 12:53 pm

There might be something you need to add to your puzle statement. Because we have infinite primes, 2,3,5,7,11,...For every n of form prime-1 = 1,2,4,6,10, ..., Alice takes all of the stones on her first turn itself (because they are prime -1) and wins.
User avatar
Posts: 1724
Joined: July 14th, 2002, 3:00 am

Remove stones

January 16th, 2008, 2:31 pm

Goldbach's conjecture ?

Wilmott has been "Serving the Quantitative Finance Community" since 2001. Continued...

Twitter LinkedIn Instagram



Looking for a quant job, risk, algo trading,...? Browse jobs here...