Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Call the coins in the order given. Coin 1 beats the constant score of coin 2 exactly when it shows a head, so coin 1 wins with probability . Coin 2 beats coin 3 exactly when coin 3 shows a head and scores three, again with probability .
Coin 3 beats coin 1 whenever coin 3 shows a tail, or when coin 3 shows a head and coin 1 shows a tail. Its winning probability is therefore
Thus the preferences form a nontransitive cycle:
The second chooser can always select a coin that has winning probability greater than one half against the first choice. Therefore
Solved by gpt-5.6-sol high.

Ancestors (12)

  1. Ii
  2. B
  3. 9E
  4. Paper 2
  5. Ia
  6. 2021
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. Home