2018 AMC 10B 第 14 题

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

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

14.

一个由 20182018 个正整数组成的列表有唯一的众数,且这个众数恰好出现 1010 次。这个列表中最少可能出现多少个不同的值?
A list of 20182018 positive integers has a unique mode, which occurs exactly 1010 times. What is the least number of distinct values that can occur in the list?
202202
223223
224224
225225
234234
答案:D
知识点:众数最优化
小提示:
众数以外的每个值最多出现 99 次,否则会与众数并列。
Every value other than the mode can appear at most 99 times, to keep the mode unique
大提示:
若有 dd 个不同值,列表最多容纳 10+9(d−1)10 + 9(d-1) 项;令它至少为 20182018。
With dd distinct values the list holds at most 10+9(d−1)10 + 9(d-1) entries; make this at least 20182018
解答:
众数出现 1010 次。为了让不同值个数尽量少,其余每个值都应尽量多出现,但最多只能出现 99 次,否则会与众数并列。若共有 dd 个不同值,最多可有 10+9(d−1)10 + 9(d-1) 项。需要 10+9(d−1)≥201810 + 9(d-1) \ge 2018,因此 d−1≥223.1d - 1 \ge 223.1,也就是 d≥225d \ge 225。正确答案是 D。
The mode shows up 1010 times. To keep the number of distinct values small, let every other value repeat as much as the rules allow, which is 99 times each (any more would tie the mode). With dd distinct values the list holds at most 10+9(d−1)10 + 9(d-1) entries. We need 10+9(d−1)≥2018,10 + 9(d-1) \ge 2018, so d−1≥223.1,d - 1 \ge 223.1, giving d≥225.d \ge 225. Therefore, the answer is D.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.