2013 AMC 10B Problems/Problem 17: Difference between revisions
Turkeybob777 (talk | contribs) Posted problem, but no solution |
Turkeybob777 (talk | contribs) mNo edit summary |
||
| Line 3: | Line 3: | ||
<math>\textbf{(A)} 62 \qquad \textbf{(B)} 82 \qquad \textbf{(C)} 83 \qquad \textbf{(D)} 102 \qquad \textbf{(E)} 103</math> | <math>\textbf{(A)} 62 \qquad \textbf{(B)} 82 \qquad \textbf{(C)} 83 \qquad \textbf{(D)} 102 \qquad \textbf{(E)} 103</math> | ||
==Solution== | |||
Revision as of 21:58, 21 February 2013
Problem
Alex has 
red tokens and blue tokens. There is a booth where Alex can give two red tokens and recieve in return a silver token and a blue token, and another booth where Alex can give three blue tokens and recieve 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?
