2013 AMC 10B Problem 17
Alex has red tokens and blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token, and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?
Show solution without answering
Key insight
Every trade gives one silver token, so count trades. Trading must stop at 1 red and 2 blue; two equations then give 59 + 44 = 103 trades.
Solution
1. Each trade, at either booth, gives exactly one silver token. So the number of silver tokens equals the number of trades. We do not need to know the order of the trades, only how many of each kind.
2. Let be the number of trades at the red booth (give red, get blue) and the number at the blue booth (give blue, get red). At the end,
3. Trading stops when Alex has fewer than red and fewer than blue. So at the end, red is or and blue is , or . That is six possible endings. Which one happens?
4. To decide, find a quantity that changes in a predictable way. Try red blue:
- Red booth: red goes down , blue goes up , so the quantity changes by .
- Blue booth: blue goes down , red goes up , so the quantity changes by .
It starts at , a multiple of , and it only ever drops by . So it is always a multiple of .
5. Check the six endings:
| (red, blue) | (0,0) | (0,1) | (0,2) | (1,0) | (1,1) | (1,2) |
|---|---|---|---|---|---|---|
| red blue | 0 | 2 | 4 | 1 | 3 | 5 |
Only and give multiples of . Every trade hands Alex back a red or blue token, so he can never be left with none. The ending is red and blue.
6. The quantity went from down to , a drop of . Each blue-booth trade drops it by , so .
7. Use the red count: , so and . Check blue: . Correct.
8. Total trades: .
The answer is .
Why this works
Acting out trades would take forever, but each type of trade changes the counts by the same fixed amounts every time, so only the number of each type matters. A quantity that changes predictably (here red blue) tells you where the process must end, and then simple equations give the counts.
Alternative approach
Once you know the ending is red and blue, just solve the two equations from step 2:
The first gives . Put that into the second: , so , , and . Again .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Every exchange produces one silver token, so we need the total number of exchanges. Let be the number of red-booth exchanges (red , blue ) and the number of blue-booth exchanges (blue , red ). At the end,
Which final state is possible? Exchanges stop only when red and blue . The quantity is unchanged by a red exchange () and drops by under a blue exchange, so it stays a multiple of (it starts at ). Among the six candidate end states, only and have divisible by , and is unreachable since every exchange hands back a token. So Alex ends with red and blue.
Solve:
From the first, ; substituting, , so , , .
Total exchanges: .
The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 13: Events With States (§13.4)
- Introduction to Algebra, Chapter 3: One-Variable Linear Equations (§3.3, §3.4)
- Introduction to Algebra, Chapter 7: Proportion (§7.4)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.