2026 AMC 10A 第 23 题

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

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

23.

在由一个或多个连续整数组成的一列数中,有 pp 个 22 的倍数和 qq 个 33 的倍数。这列数可能对应多少个有序数对 (p,q)(p, q),其中 pp 和 qq 都在 00 到 100100 之间(含端点)?
In a list of one or more consecutive integers, there are pp multiples of 22 and qq multiples of 3.3. How many ordered pairs (p,q)(p, q) are possible for this list if pp and qq are between 00 and 100,100, inclusive?
232232
233233
234234
235235
236236
答案:D
知识点:区间内整数计数估算不等式
小提示:
在 nn 个连续整数中,pp 是 n2\frac{n}{2} 向上或向下取整,qq 是 n3\frac{n}{3} 向上或向下取整
In nn consecutive integers, pp is n2\frac{n}{2} rounded up or down, and qq is n3\frac{n}{3} rounded up or down
大提示:
于是 2p2p 和 3q3q 都接近 nn。它们最多能相差多少?
Then 2p2p and 3q3q are both close to n.n. How far apart can they be?
解答:
取一列 nn 个连续整数。其中 22 的倍数的个数是 n2\frac{n}{2} 向上或向下取整,所以 ∣n−2p∣≤1|n - 2p| \le 1。33 的倍数的个数是 n3\frac{n}{3} 向上或向下取整,所以 ∣n−3q∣≤2|n - 3q| \le 2。两种取整的每种组合都会出现:pp 向哪边取整只取决于第一个数是偶数还是奇数,qq 向哪边取整只取决于第一个数除以 33 的余数,而任意连续六个起点覆盖了这两者的所有组合。
所以 (p,q)(p, q) 可能出现,当且仅当存在正整数 nn 同时满足 ∣n−2p∣≤1|n - 2p| \le 1 和 ∣n−3q∣≤2|n - 3q| \le 2。这样的 nn 存在,当且仅当 2p2p 与 3q3q 相差不超过 1+2=31 + 2 = 3,即 ∣2p−3q∣≤3|2p - 3q| \le 3。(此时 2p+12p + 1 与 3q+23q + 2 中较小的那个可以作为 nn,而且它是正数。)
下面按 pp 计数。条件表明 qq 与 2p3\frac{2p}{3} 相差不超过 11。如果 33 整除 pp,那么可取 33 个 qq 值,否则可取 22 个。在 p=0p = 0、11、…\ldots、100100 中,有 3434 个 33 的倍数,其余 6767 个不是。q=−1q = -1 只在 p=0p = 0 时出现,去掉它,得到 34×3+67×2−1=23534 \times 3 + 67 \times 2 - 1 = 235。(求出的每个 qq 都不超过 6767,所以 q≤100q \le 100 成立。)
因此,正确答案是 D。
Take a list of nn consecutive integers. The number of multiples of 22 in it is n2\frac{n}{2} rounded up or down, so ∣n−2p∣≤1.|n - 2p| \le 1. The number of multiples of 33 is n3\frac{n}{3} rounded up or down, so ∣n−3q∣≤2.|n - 3q| \le 2. Every combination of roundings occurs. Which way pp rounds depends only on whether the first number is even or odd, and which way qq rounds depends only on its remainder when divided by 3.3. Any six consecutive starting points cover every combination of the two.
So (p,q)(p, q) is possible exactly when some positive nn satisfies both ∣n−2p∣≤1|n - 2p| \le 1 and ∣n−3q∣≤2.|n - 3q| \le 2. Such an nn exists exactly when 2p2p and 3q3q are at most 1+2=31 + 2 = 3 apart, that is, when ∣2p−3q∣≤3.|2p - 3q| \le 3. (In that case the smaller of 2p+12p + 1 and 3q+23q + 2 works as n,n, and it is positive.)
Now count by p.p. The condition says qq is within 11 of 2p3.\frac{2p}{3}. If 33 divides p,p, that allows 33 values of q,q, and otherwise 2.2. Among p=0,p = 0, 1,1, …,\ldots, 100,100, there are 3434 multiples of 33 and 6767 others. Dropping q=−1q = -1 at p=0p = 0 gives 34×3+67×2−1=235.34 \times 3 + 67 \times 2 - 1 = 235. (Every qq found is at most 67,67, so q≤100q \le 100 holds.)
Thus, the correct answer is D.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.使用条款隐私政策COPPA 隐私政策