2026 AMC 10A 第 25 题

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

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

25.

松鼠 Chris 的洞穴里有 2020 个用来储存食物的房间。第一个房间里有 11 颗坚果,第二个房间里有 22 颗坚果,第三个房间里有 33 颗坚果,依此类推,第 2020 个房间里有 2020 颗坚果。从今天开始,Chris 每天会再收集 1818 颗坚果,并把它们放进洞穴里 1818 个不同的房间,每个房间放一颗。他的目标是在完成时让所有房间里的坚果数都相同。完成这个目标最少需要多少天?
Chris the squirrel has 2020 rooms in his cavern for storing food. The first room contains 11 nut, the second room contains 22 nuts, the third room contains 33 nuts, and so on, with the 2020th room containing 2020 nuts. Starting from today, Chris will collect 1818 additional nuts each day and store them one per room in 1818 distinct rooms in his cavern. His goal is to have all the rooms contain the same number of nuts once he is finished. What is the minimum number of days required to accomplish this goal?
7575
9595
105105
190190
195195
答案:B
知识点:求和极限情形界定配对与分组
小提示:
房间 11 每天最多增加一颗坚果,所以最后最多有 d+1d + 1 颗
Room 11 gains at most one nut a day, so it ends with at most d+1d + 1
大提示:
dd 天后,210+18d210 + 18d 颗坚果必须等于每个房间最终数量的 2020 倍
After dd days the 210+18d210 + 18d nuts must be 2020 times the final count per room
解答:
假设 dd 天后每个房间都有 NN 颗坚果。这些房间一开始共有 1+2+⋯+20=2101 + 2 + \cdots + 20 = 210 颗坚果,所以 210+18d=20N210 + 18d = 20N。房间 11 每天最多得到一颗坚果,所以 N≤d+1N \le d + 1。于是 210+18d=20N≤20d+20, 210 + 18d = 20N \le 20d + 20\text{,} 所以 d≥95d \ge 95。
当 d=95d = 95 时,N=210+171020=96N = \frac{210 + 1710}{20} = 96。Chris 每天恰好跳过两个房间,而房间 ii 需要 96−i96 - i 颗坚果,所以它必须被跳过 95−(96−i)=i−195 - (96 - i) = i - 1 次。这些跳过次数加起来是 0+1+⋯+190 + 1 + \cdots + 19 =190=2×95= 190 = 2 \times 95,正好符合要求。
为了安排这些跳过,把 190190 次跳过按顺序列出来:房间 22 一次,然后房间 33 两次,依此类推,最后是房间 2020 十九次。在第 kk 天,跳过列表中第 kk 个和第 k+95k + 95 个位置上的房间。没有哪个房间出现 9595 次,所以这两个位置上总是两个不同的房间。所以 9595 天就是最少天数。
因此,正确答案是 B。
Suppose that after dd days every room holds NN nuts. The rooms start with 1+2+⋯+20=2101 + 2 + \cdots + 20 = 210 nuts, so 210+18d=20N.210 + 18d = 20N. Room 11 gets at most one nut a day, so N≤d+1.N \le d + 1. Then 210+18d=20N≤20d+20, 210 + 18d = 20N \le 20d + 20, so d≥95.d \ge 95.
With d=95d = 95 we get N=210+171020=96.N = \frac{210 + 1710}{20} = 96. Each day Chris skips exactly two rooms, and room ii needs 96−i96 - i nuts, so it must be skipped 95−(96−i)=i−195 - (96 - i) = i - 1 times. These skips add up to 0+1+⋯+190 + 1 + \cdots + 19 =190=2×95,= 190 = 2 \times 95, as they should.
To schedule them, list the 190190 skips in order: room 22 once, then room 33 twice, and so on up to room 2020 nineteen times. On day kk skip the rooms in positions kk and k+95k + 95 of the list. No room appears 9595 times, so these are always two different rooms. So 9595 days is the minimum.
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.使用条款隐私政策COPPA 隐私政策