2013 AMC 10A 第 21 题

先试着解答 2013 AMC 10A 第 21 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2013 AMC 10A 解答,或核对答案。

所有题目均经美国数学协会(MAA)官方合法授权使用。

21.

1212 名海盗同意按如下方式分一箱金币。第 kthk^{\text{th}} 个拿份额的海盗取走箱中剩余金币的 k12\dfrac{k}{12}。箱中最初的金币数是使得每名海盗都能得到正整数枚金币的最小数。第 12th12^{\text{th}} 个海盗得到多少枚金币?
A group of 1212 pirates agree to divide a treasure chest of gold coins among themselves as follows. The kthk^{\text{th}} pirate to take a share takes k12\dfrac{k}{12} of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the 12th12^{\text{th}} pirate receive?
720720
12961296
17281728
19251925
38503850
答案:D
知识点:整除性质因数分解逆推法
小提示:
从第十二个海盗得到的金币数反向推。
Work backward from the number left for the last pirate
大提示:
反推第 kk 个海盗之前的数量时,要乘以 1212−k\frac{12}{12-k}。
The remaining amount is multiplied by 1212−k\frac{12}{12-k} when reversing pirate kk
解答:
反向计算。若第 1212 个海盗分到时还剩 nn 枚金币,那么在第 kk 个海盗拿走份额之前,箱中的金币数是他拿完之后的 1212−k\frac{12}{12-k} 倍。
因此最初的金币数为 n⋅121111!n\cdot\frac{12^{11}}{11!}。
由于 121111!=214375⋅7⋅11\frac{12^{11}}{11!}=\frac{2^{14}3^7}{5\cdot7\cdot11},使最初金币数为整数的最小 nn 是 52⋅7⋅11=19255^2\cdot7\cdot11=1925。
这个值确实可以达到。在第 kk 个海盗拿走份额之前,金币数为 21437⋅11!(12−k)! 12k−1。 2^{14}3^7\cdot \frac{11!}{(12-k)!\,12^{k-1}}\text{。}对 k=1,2,…,12k=1,2,\ldots,12,这些数全是整数。每个海盗拿到的份额是相邻两个剩余量之差,所以每份也都是整数。
因此第 1212 个海盗得到 19251925 枚金币,正确答案是 D。
Work backward. If nn coins remain for the 1212th pirate, then before pirate kk took a share, the chest had 1212−k\frac{12}{12-k} times as many coins as it had afterward.
Therefore the initial number of coins is n⋅121111!n\cdot\frac{12^{11}}{11!}.
Since 121111!=214375⋅7⋅11\frac{12^{11}}{11!}=\frac{2^{14}3^7}{5\cdot7\cdot11}, the smallest nn that makes the initial number an integer is 52⋅7⋅11=19255^2\cdot7\cdot11=1925.
This value is attainable. The number of coins present just before pirate kk takes a share is 21437⋅11!(12−k)! 12k−1. 2^{14}3^7\cdot \frac{11!}{(12-k)!\,12^{k-1}}. For k=1,2,…,12k=1,2,\ldots,12, all these amounts are integers. Each pirate’s share is the difference between two consecutive remaining amounts, so every share is an integer as well.
Thus, the 1212th pirate receives 19251925 coins, and D is the correct answer.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.