All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Who will win? (Posted on 2005-01-10)
There are 2n cards labeled 1, 2, ..., 2n respectively, and the cards are distributed randomly between two players so that each has n cards. Each player takes turns to place one card, and you win if you put down a card so that the current sum of all the played cards is divisible by 2n+1.

For example, if n=10, and the previously placed cards are 5, 8, 9, 19, then if player A now places 1, he wins since 5+8+9+19+1 = 42 is divisible by 2*10+1=21.

Assuming both players want to win, what strategy should one adopt in order to win? Following the strategy, is there a consistent winner of this game?

 See The Solution Submitted by Bon Rating: 2.0000 (1 votes)

 Subject Author Date re: More thorough solution Jay Schamel 2005-01-14 23:49:40 re(5): Solution Charlie 2005-01-10 20:12:13 More thorough solution David Shin 2005-01-10 19:50:27 re(4): Solution David Shin 2005-01-10 19:40:00 re(3): Solution Charlie 2005-01-10 19:11:59 re(2): Solution David Shin 2005-01-10 18:52:43 Possible solution Hugo 2005-01-10 18:11:17 re: Solution e.g. 2005-01-10 18:07:22 Solution David Shin 2005-01-10 17:22:13

 Search: Search body:
Forums (0)