2004 AMC 12A Problems/Problem 7

Revision as of 17:29, 4 January 2019 by Wlm7 (talk | contribs) (Solution)
The following problem is from both the 2004 AMC 12A #7 and 2004 AMC 10A #8, so both problems redirect to this page.

Problem

A game is played with tokens according to the following rule. In each round, the player with the most tokens gives one token to each of the other players and also places one token in the discard pile. The game ends when some player runs out of tokens. Players $A$, $B$, and $C$ start with $15$, $14$, and $13$ tokens, respectively. How many rounds will there be in the game?

$\mathrm{(A) \ } 36 \qquad \mathrm{(B) \ } 37 \qquad \mathrm{(C) \ } 38 \qquad \mathrm{(D) \ } 39 \qquad \mathrm{(E) \ } 40$

Solution

We look at a set of three rounds, where the players begin with $x+1$, $x$, and $x-1$ tokens. After three rounds, there will be a net loss of $1$ token per player (they receive two tokens and lose three). Therefore, after $36$ rounds -- or $12$ three-round sets, $A,B$ and $C$ will have $3$, $2$, and $1$ tokens, respectively. After $1$ more round, player $A$ will give away $3$ tokens, leaving it empty-handed, and thus the game will end. We then have there are $36+1=\boxed{\mathrm{(B)}\ 37}$ rounds until the game ends.

See also

2004 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 6
Followed by
Problem 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions
2004 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
Problem 7
Followed by
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS