olymmath

Putnam 2017 A5

  • Session A

Each of the integers from 11 to nn is written on a separate card, and then the cards are combined into a deck and shuffled. Three players, AA, BB, and CC, take turns in the order A,B,C,A,…A,B,C,A,\dots choosing one card at random from the deck. (Each card in the deck is equally likely to be chosen.) After a card is chosen, that card and all higher-numbered cards are removed from the deck, and the remaining cards are reshuffled before the next turn. Play continues until one of the three players wins the game by drawing the card numbered 11.

Show that for each of the three players, there are arbitrarily large values of nn for which that player has the highest probability among the three players of winning the game.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2017/a5 · Tag 7KXV32ETWJ · Edit this page on GitHub · Keys: j next, k previous