Skip to main content

2013 AMC 12B Problem 18

Problem 18 of 25IntermediateNumber TheoryCounting & Probability

Barbara and Jenna play the following game, in which they take turns. A number of coins lie on a table. When it is Barbara’s turn, she must remove 22 or 44 coins, unless only one coin remains, in which case she loses her turn. When it is Jenna’s turn, she must remove 11 or 33 coins. A coin flip determines who goes first. Whoever removes the last coin wins the game. Assume both players use their best strategy. Who will win when the game starts with 20132013 coins and when the game starts with 20142014 coins?

Answer choices

Show solution

Solution

Work modulo 5.5. With 201332013 \equiv 3 coins, Jenna wins either way: going first she takes 33 to leave a multiple of 5,5, then answers Barbara’s 22 with 33 and 44 with 11 to keep multiples of 5,5, eventually taking the last coin; going second she keeps the count 3(mod5)\equiv 3 \pmod 5 until Barbara is stuck at 33 coins, must remove 2,2, and leaves Jenna the last coin. With 201442014 \equiv 4 coins, whoever goes first wins: Jenna first reduces to the 20132013 case, while Barbara first takes 44 and then keeps multiples of 5.5. This is choice B. Thus, the correct answer is B.

More practice

Concepts: combinatorial game · invariant · modular arithmetic

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.