|
|
| (2 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | ==Problem==
| + | #REDIRECT [[2013 AMC 12B Problems/Problem 10]] |
| − | Alex has <math>75</math> red tokens and <math>75</math> 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?
| |
| − | | |
| − | <math>\textbf{(A)} 62 \qquad \textbf{(B)} 82 \qquad \textbf{(C)} 83 \qquad \textbf{(D)} 102 \qquad \textbf{(E)} 103</math>
| |
| − | | |
| − | ==Solution==
| |
| − | | |
| − | We can approach this problem by assuming he goes to the red booth first. You start with <math>75 \text{R}</math> and <math>75 \text{B}</math> and at the end of the first booth, you will have <math>1 \text{R}</math> and <math>112 \text{B}</math> and <math>37 \text{S}</math>. We now move to the blue booth, and working through each booth until we have none left, we will end up with:<math>1 \text{R}</math>, <math>2 \text{B}</math> and <math>103 \text{S}</math>. So, the answer is <math>\textbf{(E)}</math>
| |
