1978 AMC 12 第 27 题

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

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

27.

大于 11 且满足下列条件的整数不止一个:用任意满足 2≤k≤112\le k\le11 的整数 kk 除它,余数都是 11。这样的整数中最小的两个相差多少?
There is more than one integer greater than 11 which, when divided by any integer kk such that 2≤k≤11,2\le k\le11, has a remainder of 1.1. What is the difference between the two smallest such integers?
23102310
23112311
27,72027{,}720
27,72127{,}721
以上都不是
none of these
答案:C
知识点:最小公倍数模运算
小提示:
每个所求整数都比从 22 到 1111 的所有整数的一个公倍数大 11
Each desired integer is 11 more than a common multiple of every integer from 22 through 1111
大提示:
相邻两个这样的整数之差就是这些除数的最小公倍数
The difference of consecutive such integers is the least common multiple of those divisors
解答:
符合条件的整数对从 22 到 1111 的每个整数取模都与 11 同余,因此也可将模数取为 L=lcm⁡(2,…,11)=23⋅32⋅5⋅7⋅11=27720。 \begin{aligned} L&=\operatorname{lcm}(2,\ldots,11)\\ &=2^3\cdot3^2\cdot5\cdot7\cdot11\\ &=27720\text{。} \end{aligned} 大于 11 的最小两个符合条件的整数是 L+1L+1 和 2L+12L+1,它们的差为 L=27720L=27720。
因此,正确答案是 C。
A qualifying integer is congruent to 11 modulo every integer from 22 through 11,11, hence modulo L=lcm⁡(2,…,11)=23⋅32⋅5⋅7⋅11=27720. \begin{aligned} L&=\operatorname{lcm}(2,\ldots,11)\\ &=2^3\cdot3^2\cdot5\cdot7\cdot11\\ &=27720. \end{aligned} The two smallest qualifying integers greater than 11 are L+1L+1 and 2L+1,2L+1, whose difference is L=27720.L=27720.
Therefore, the correct answer is C.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.