设红色摊位交换 \(m\) 次,蓝色摊位交换 \(n\) 次。
最后红色和蓝色代币数分别为 \(75-2m+n\) 和 \(75+m-3n\)。结束时必须红色少于 \(2\) 个、蓝色少于 \(3\) 个。
求解这些终止情况,只得到两组候选终态:\((1,2)\),对应 \((m,n)=(59,44)\);或 \((0,0)\),对应 \((m,n)=(60,45)\)。
终态 \((0,0)\) 不可能,因为最后一次交换一定会产生一个蓝色或一个红色代币。
终态 \((1,2)\) 可以达到。从红、蓝代币数 \((75,75)\) 开始,先在蓝色摊位交换 \(25\) 次,再在红色摊位交换 \(50\) 次,接着依次在蓝色摊位交换 \(16\) 次、红色摊位交换 \(8\) 次、蓝色摊位交换 \(3\) 次,最后在红色摊位交换 \(1\) 次。每个阶段的红、蓝代币数依次为 \[ \begin{aligned} &(100,0),(0,50),(16,2),\\ &(0,10),(3,1),(1,2) \end{aligned}\text{。}\]
因此 Alex 最后有 \(59+44=103\) 个银色代币,正确答案是 E。
English
Suppose Alex makes \(m\) exchanges at the red-token booth and \(n\) exchanges at the blue-token booth.
He then has \(75-2m+n\) red tokens and \(75+m-3n\) blue tokens. At the end he must have fewer than \(2\) red tokens and fewer than \(3\) blue tokens.
Solving these terminal possibilities gives only two candidate final token counts: \((1,2)\), which comes from \((m,n)=(59,44)\), or \((0,0)\), which comes from \((m,n)=(60,45)\).
The final count \((0,0)\) is impossible, because the last exchange would always create either one blue token or one red token.
The final count \((1,2)\) is attainable. Starting from \((75,75)\) red and blue tokens, make \(25\) blue-booth exchanges, then \(50\) red-booth exchanges, then \(16\) blue-booth exchanges, then \(8\) red-booth exchanges, then \(3\) blue-booth exchanges, and finally \(1\) red-booth exchange. The red-blue counts become \[ \begin{aligned} &(100,0),(0,50),(16,2),\\ &(0,10),(3,1),(1,2). \end{aligned} \]
Therefore Alex ends with \(59+44=103\) silver tokens, and the correct answer is E .