2013 AMC 12B 第 15 题

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

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

15.

数字 20132013 被表示为
2013=a1! a2!⋯am!b1! b2!⋯bn!, 2013 = \frac{a_1!\,a_2!\cdots a_m!}{b_1!\,b_2!\cdots b_n!}\text{,}
其中 a1≥a2≥⋯≥ama_1 \ge a_2 \ge \cdots \ge a_m 和 b1≥b2≥⋯≥bnb_1 \ge b_2 \ge \cdots \ge b_n 都是正整数,且 a1+b1a_1 + b_1 尽可能小。求 ∣a1−b1∣ |a_1 - b_1|\,?
The number 20132013 is expressed in the form
2013=a1! a2!⋯am!b1! b2!⋯bn!, 2013 = \frac{a_1!\,a_2!\cdots a_m!}{b_1!\,b_2!\cdots b_n!},
where a1≥a2≥⋯≥ama_1 \ge a_2 \ge \cdots \ge a_m and b1≥b2≥⋯≥bnb_1 \ge b_2 \ge \cdots \ge b_n are positive integers and a1+b1a_1 + b_1 is as small as possible. What is ∣a1−b1∣ ?|a_1 - b_1|\,?
11
22
33
44
55
答案:B
知识点:质因数分解阶乘极限情形界定
小提示:
分解 2013=3⋅11⋅612013 = 3\cdot 11\cdot 61,其最大质因数为 6161。
Factor 2013=3⋅11⋅61;2013 = 3\cdot 11\cdot 61; its largest prime is 6161
大提示:
某个 ai!a_i! 必须至少达到 6161,所以 a1≥61a_1 \ge 61。但 61!61! 还含有质因数 5959,必须在分母中约去。
Some ai!a_i! must reach 61,61, so a1≥61;a_1 \ge 61; but 61!61! also contains the prime 59,59, which must be cancelled from the denominator
解答:
因为 2013=3⋅11⋅612013 = 3\cdot 11\cdot 61,分子中至少需要一个 61!61! 来提供质因数 6161,所以 a1≥61a_1 \ge 61。但是 61!61! 还含有 20132013 所不含的质因数 5959,所以分母中必须有 b1≥59b_1 \ge 59。因此 a1+b1≥120a_1 + b_1 \ge 120。取 a1=61a_1 = 61、b1=59b_1 = 59,并使用 2013=61! 11! 3!59! 10! 5!2013 = \dfrac{61!\,11!\,3!}{59!\,10!\,5!},可以达到这个下界。于是 ∣a1−b1∣=2|a_1 - b_1| = 2。所以正确答案是 B。
Since 2013=3⋅11⋅61,2013 = 3\cdot 11\cdot 61, the numerator needs a factorial at least 61!61! to supply the prime 61,61, so a1≥61.a_1 \ge 61. But 61!61! also has a factor of 59,59, which 20132013 does not, so the denominator needs b1≥59.b_1 \ge 59. Thus a1+b1≥120,a_1 + b_1 \ge 120, attained by a1=61,a_1 = 61, b1=59b_1 = 59 via 2013=61! 11! 3!59! 10! 5!.2013 = \dfrac{61!\,11!\,3!}{59!\,10!\,5!}. Then ∣a1−b1∣=2.|a_1 - b_1| = 2. Thus, the correct answer is B.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.