2022 AMC 10B 详解

向下滚动即可查看来自 LIVE by Po-Shen Loh 的精心整理的解答,打印PDF 解答,查看答案,或参加完整限时模拟考试。

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

1.

对所有实数 xx 和 yy,定义 x ♢ yx~\diamondsuit~ y 为 ∣x−y∣|x-y|。求 (1 ♢ (2 ♢ 3))−((1 ♢ 2) ♢ 3)?(1~\diamondsuit~(2~\diamondsuit~3))-((1~\diamondsuit~2)~\diamondsuit~3)\text{?}
Define x ♢ yx~\diamondsuit~ y to be ∣x−y∣|x-y| for all real numbers xx and y.y. What is the value of (1 ♢ (2 ♢ 3))−((1 ♢ 2) ♢ 3)?(1~\diamondsuit~(2~\diamondsuit~3))-((1~\diamondsuit~2)~\diamondsuit~3)?
−2-2
−1-1
00
11
22
知识点:自定义运算绝对值运算顺序
小提示:
这个运算表示两个数的差的绝对值。
Remember that the operation is absolute difference
大提示:
从最里面的菱形运算开始计算。
Evaluate each diamond operation from the inside out
解答:
从最内层的运算开始,依次向外计算可得 1♢(2♢3)=∣1−∣2−3∣∣=0,(1♢2)♢3=∣∣1−2∣−3∣=2。 \begin{aligned} 1\mathbin\diamondsuit(2\mathbin\diamondsuit3)&=|1-|2-3||=0,\\ (1\mathbin\diamondsuit2)\mathbin\diamondsuit3&=||1-2|-3|=2 \end{aligned}\text{。}因此,题中所求的差为 0−2=−20-2=-2。
所以正确答案是 A。
Working from the innermost operations outward gives 1♢(2♢3)=∣1−∣2−3∣∣=0,(1♢2)♢3=∣∣1−2∣−3∣=2. \begin{aligned} 1\mathbin\diamondsuit(2\mathbin\diamondsuit3)&=|1-|2-3||=0,\\ (1\mathbin\diamondsuit2)\mathbin\diamondsuit3&=||1-2|-3|=2. \end{aligned} Therefore, the given difference is 0−2=−2.0-2=-2.
Thus, the answer is A .

2.

在菱形 ABCDABCD 中,点 PP 在边 AD‾\overline{AD} 上,且 BP‾⊥AD‾\overline{BP} \perp \overline{AD}、AP=3AP = 3、PD=2PD = 2。求 ABCDABCD 的面积。
In rhombus ABCD,ABCD, point PP lies on segment AD‾\overline{AD} so that BP‾⊥AD‾,\overline{BP} \perp \overline{AD}, AP=3,AP = 3, and PD=2.PD = 2. What is the area of ABCD?ABCD?
353\sqrt 5
1010
656\sqrt 5
2020
2525
难度评级:940
小提示:
菱形的边长为 AD=AP+PDAD = AP + PD。
The side length of the rhombus is AD=AP+PDAD = AP + PD
大提示:
在直角三角形 APBAPB 中求 BPBP,再用面积 =AD⋅BP= AD \cdot BP。
In right triangle APB,APB, find BP,BP, then use area =AD⋅BP= AD \cdot BP
解答:
边长 AD=AP+PD=5AD = AP + PD = 5,所以 AB=5AB = 5。在直角三角形 APBAPB 中,BP=AB2−AP2=25−9=4。 \begin{aligned} BP &= \sqrt{AB^2 - AP^2} \\ &= \sqrt{25 - 9} = 4 \end{aligned}\text{。}
取 ADAD 为底,BPBP 为高,面积为 AD⋅BP=5⋅4=20AD \cdot BP = 5 \cdot 4 = 20。
所以正确答案是 D。
The side length is AD=AP+PD=5,AD = AP + PD = 5, so AB=5.AB = 5. In right triangle APB,APB, BP=AB2−AP2=25−9=4. \begin{aligned} BP &= \sqrt{AB^2 - AP^2} \\ &= \sqrt{25 - 9} = 4. \end{aligned}
Taking ADAD as the base and BPBP as the height, the area is AD⋅BP=5⋅4=20.AD \cdot BP = 5 \cdot 4 = 20.
Thus, the correct answer is D.

3.

有多少个三位正整数含有奇数个偶数数字?
How many three-digit positive integers have an odd number of even digits?
150150
250250
350350
450450
550550
难度评级:1100
小提示:
三位数的百位不能是 00。
A three-digit number cannot start with 00
大提示:
按含偶数数字的位数进行分类计数。
Count by the number of even digit positions
解答:
百位和十位共有 9⋅10=909\cdot10=90 种选择。固定这两位后,个位的奇偶性必须使三个数字中偶数数字的总数为奇数。所需奇偶性的数字总有 55 个,其中偶数数字包括 00。
因此,符合条件的整数共有 90⋅5=45090\cdot5=450 个。
所以正确答案是 D。
There are 9⋅10=909\cdot10=90 choices for the hundreds and tens digits. Once those two digits are fixed, the units digit must have whichever parity makes the total number of even digits odd. There are always 55 digits of the required parity (including 00 among the even digits).
Therefore, the number of integers is 90⋅5=450.90\cdot5=450.
Thus, the answer is D .

4.

一头驴突然打嗝,第一次打嗝发生在某天下午 4:004:00。假设它每隔 55 秒规律地打一次嗝。它第 700700 次打嗝发生在什么时间?
A donkey suffers an attack of hiccups and the first hiccup happens at 4:004:00 one afternoon. Suppose that the donkey hiccups regularly every 55 seconds. At what time does the donkey’s 700700th hiccup occur?
4:584:58 后 1515 秒
1515 seconds after 4:584:58
4:584:58 后 2020 秒
2020 seconds after 4:584:58
4:584:58 后 2525 秒
2525 seconds after 4:584:58
4:584:58 后 3030 秒
3030 seconds after 4:584:58
4:584:58 后 3535 秒
3535 seconds after 4:584:58
难度评级:870
小提示:
将 4:004{:}00 之后经过的秒数换算成分钟和秒
Convert the elapsed seconds past 4:004{:}00 into minutes and seconds
大提示:
数出 4:004{:}00 之后经过的五秒间隔数
Count the number of five-second intervals after 4:004{:}00
解答:
要求第 700700 次打嗝,就要看它比第一次晚了 699699 个间隔。
这相当于 699⋅5=3495699\cdot 5 = 3495 秒。注意 3495=60⋅58+153495 = 60\cdot 58+15,所以这个时刻在第一次打嗝之后 5858 分 1515 秒。因此它是 4:584:58 再过 1515 秒。
所以答案是 A。
Since we want to look at the 700700th hiccup, we need to look at time that is 699699 hiccups after the first one.
This would be 699⋅5=3495699\cdot 5 = 3495 seconds. Note that 3495=60⋅58+15,3495 = 60\cdot 58+15, so the time would be 5858 minutes and 1515 seconds after the first hiccup. This would therefore be 4:584:58 and 1515 seconds.
Thus, the answer is A .

5.

求下式的值:(1+13)(1+15)(1+17)(1−132)(1−152)(1−172)?\frac{\left(1+\frac{1}{3}\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}\text{?}
What is the value of (1+13)(1+15)(1+17)(1−132)(1−152)(1−172)?\frac{\left(1+\frac{1}{3}\right)\left(1+\frac15\right)\left(1+\frac17\right)}{\sqrt{\left(1-\frac{1}{3^2}\right)\left(1-\frac{1}{5^2}\right)\left(1-\frac{1}{7^2}\right)}}?
3\sqrt3
22
15\sqrt{15}
44
105\sqrt{105}
知识点:平方差根式
难度评级:1280
小提示:
把每个平方根因子改写成相邻两个分数的乘积。
Rewrite each square-root factor as a product of two nearby fractions
大提示:
分子中的因子会和根号里的对应因子配对。
Pair each factor in the numerator with the matching factor under the square root
解答:
设题中正数表达式为 EE。将它平方,并利用 1−1p2=(1−1p)(1+1p)1-\frac{1}{p^2}=(1-\frac{1}{p})(1+\frac{1}{p}),可得 E2=∏p∈{3,5,7}1+1p1−1p=42⋅64⋅86=4。 \begin{aligned} E^2&=\prod_{p\in\{3,5,7\}}\frac{1+\frac{1}{p}}{1-\frac{1}{p}}\\ &=\frac42\cdot\frac64\cdot\frac86=4 \end{aligned}\text{。}因为这个表达式为正数,所以 E=2E=2。
所以正确答案是 B。
Let the given positive expression be E.E. Squaring it and using 1−1p2=(1−1p)(1+1p)1-\frac{1}{p^2}=(1-\frac{1}{p})(1+\frac{1}{p}) gives E2=∏p∈{3,5,7}1+1p1−1p=42⋅64⋅86=4. \begin{aligned} E^2&=\prod_{p\in\{3,5,7\}}\frac{1+\frac{1}{p}}{1-\frac{1}{p}}\\ &=\frac42\cdot\frac64\cdot\frac86=4. \end{aligned} Hence E=2.E=2.
Thus, the answer is B .

6.

数列 121,11211,1112111,…121, 11211, 1112111, \ldots 的前十项中有多少个质数?
How many of the first ten numbers of the sequence 121,11211,1112111,…121, 11211, 1112111, \ldots are prime numbers?
00
11
22
33
44
知识点:质数因式分解
难度评级:1240
小提示:
尝试把每一项分解成两个都大于 11 的整数的乘积。
Look for a factorization of each term into two integers both greater than 11
大提示:
尝试将每项写成循环单位数与形如 10n+110^n + 1 的数之积,例如 11211=111⋅10111211 = 111 \cdot 101。
Try writing a term as a repunit times a number of the form 10n+1,10^n + 1, for example 11211=111⋅10111211 = 111 \cdot 101
解答:
第 nn 项由 nn 个一、一个 22,再接 nn 个一组成。它可分解为循环单位数与形如 10n+110^n + 1 的数之积。例如 121=11⋅11,11211=111⋅101,1112111=1111⋅1001, \begin{aligned} &121 = 11 \cdot 11, \\ &\quad 11211 = 111 \cdot 101, \\ &\quad 1112111 = 1111 \cdot 1001\text{,} \end{aligned} 一般地,第 nn 项等于 1⋯1⏟n+1⋅(10n+1)\underbrace{1\cdots1}_{n+1} \cdot (10^n + 1)。
对每个 n≥1n \ge 1,两个因子都大于 11,所以每一项都是合数。前十项中没有质数。
所以正确答案是 A。
The nnth term consists of nn ones, then a 2,2, then nn ones. It factors as a repunit times a number of the form 10n+1:10^n + 1: 121=11⋅11,11211=111⋅101,1112111=1111⋅1001, \begin{aligned} &121 = 11 \cdot 11, \\ &\quad 11211 = 111 \cdot 101, \\ &\quad 1112111 = 1111 \cdot 1001, \end{aligned} and in general the nnth term equals 1⋯1⏟n+1⋅(10n+1).\underbrace{1\cdots1}_{n+1} \cdot (10^n + 1).
For every n≥1n \ge 1 both factors exceed 1,1, so every term is composite. None of the ten numbers is prime.
Thus, the correct answer is A.

7.

对多少个常数 kk,多项式 x2+kx+36x^{2}+kx+36 有两个不同的整数根?
For how many values of the constant kk will the polynomial x2+kx+36x^{2}+kx+36 have two distinct integer roots?
 6\ 6
 8\ 8
 9\ 9
 14\ 14
 16\ 16
难度评级:1140
小提示:
若根为 pp 和 qq,则 pq=36pq = 36,且 k=−(p+q)k = -(p+q)。
If the roots are pp and q,q, then pq=36pq = 36 and k=−(p+q)k = -(p+q)
大提示:
计数乘积为 3636 且两个整数不同的无序因子对,包括负因子对。
Count the ordered-independent factor pairs of 3636 with two distinct integers, including negatives
解答:
若整数根为 pp 和 qq,则 pq=36pq = 36,且 k=−(p+q)k = -(p+q)。两个不同的根必须同号,所以列出 3636 的因子对,并要求 p≠qp \ne q。
正因子对为 (1,36),(2,18),(3,12),(4,9)(1,36), (2,18), (3,12), (4,9),负因子对为 (−1,−36)(-1,-36)、(−2,−18)(-2,-18)、(−3,−12)(-3,-12)、(−4,−9)(-4,-9)。因为要求两根不同,排除 (6,6)(6,6)。
这 88 个因子对各给出一个不同的 kk 值。
所以正确答案是 B。
If the roots are integers pp and q,q, then pq=36pq = 36 and k=−(p+q).k = -(p+q). Distinct roots must have the same sign, so we list factor pairs of 3636 with p≠q.p \ne q.
The positive pairs are (1,36),(2,18),(3,12),(4,9),(1,36), (2,18), (3,12), (4,9), and the negative pairs are (−1,−36),(-1,-36), (−2,−18),(-2,-18), (−3,−12),(-3,-12), (−4,−9).(-4,-9). The pair (6,6)(6,6) is excluded since the roots must be distinct.
Each of these 88 pairs gives a different value of k.k.
Thus, the correct answer is B.

8.

考虑下面 100100 个集合,每个集合含 1010 个元素:{1,2,3,…,10},{11,12,13,…,20},{21,22,23,…,30},⋮{991,992,993,…,1000}。\begin{gathered} \{1,2,3,\ldots,10\},\\ \{11,12,13,\ldots,20\},\\ \{21,22,23,\ldots,30\},\\ \vdots\\ \{991,992,993,\ldots,1000\} \end{gathered}\text{。}其中有多少个集合恰好含有两个 77 的倍数?
Consider the following 100100 sets of 1010 elements each: {1,2,3,…,10},{11,12,13,…,20},{21,22,23,…,30},⋮{991,992,993,…,1000}.\begin{gathered} \{1,2,3,\ldots,10\},\\ \{11,12,13,\ldots,20\},\\ \{21,22,23,\ldots,30\},\\ \vdots\\ \{991,992,993,\ldots,1000\}. \end{gathered} How many of these sets contain exactly two multiples of 7?7?
 40\ 40
 42\ 42
 43\ 43
 49\ 49
 50\ 50
难度评级:1360
小提示:
一个含 1010 个连续整数的区间含有一个或两个 77 的倍数。
A block of 1010 consecutive integers contains either one or two multiples of 77
大提示:
先数 {1,…,1000}\{1,\ldots,1000\} 中 77 的倍数总数,再设有 xx 个区间含两个、100−x100-x 个区间含一个。
Count the total multiples of 77 in {1,…,1000},\{1,\ldots,1000\}, then let xx blocks have two and 100−x100-x have one
解答:
从 11 到 10001000 中有 ⌊10007⌋=142\left\lfloor \tfrac{1000}{7} \right\rfloor = 142 个 77 的倍数。由于 10>710 \gt 7,每个长度为 1010 的连续整数区间含有一个或两个 77 的倍数。
设有 xx 个区间含两个倍数,其余 100−x100 - x 个区间各含一个,则 2x+(100−x)=1422x + (100 - x) = 142,所以 x=42x = 42。
所以正确答案是 B。
Among 11 to 10001000 there are ⌊10007⌋=142\left\lfloor \tfrac{1000}{7} \right\rfloor = 142 multiples of 7.7. Because 10>7,10 \gt 7, each block of 1010 consecutive integers contains one or two multiples of 7.7.
If xx blocks contain two and the remaining 100−x100 - x contain one, then 2x+(100−x)=142,2x + (100 - x) = 142, so x=42.x = 42.
Thus, the correct answer is B.

9.

和式 12!+23!+34!+⋯+20212022!\dfrac{1}{2!}+\dfrac{2}{3!}+\dfrac{3}{4!}+\cdots+\dfrac{2021}{2022!} 可写成 a−1b!a-\dfrac{1}{b!},其中 aa 和 bb 为正整数。求 a+ba+b。
The sum 12!+23!+34!+⋯+20212022!\dfrac{1}{2!}+\dfrac{2}{3!}+\dfrac{3}{4!}+\cdots+\dfrac{2021}{2022!} can be expressed as a−1b!,a-\dfrac{1}{b!}, where aa and bb are positive integers. What is a+b?a+b?
 2020\ 2020
 2021\ 2021
 2022\ 2022
 2023\ 2023
 2024\ 2024
难度评级:1220
小提示:
把每一项写成两个相邻阶乘倒数的差。
Look for a difference involving consecutive factorial reciprocals
大提示:
把每一项改写成会裂项相消的形式。
Rewrite each term so the sum telescopes
解答:
每一项都可以裂项相消,因为 k(k+1)!=1k!−1(k+1)!。\frac{k}{(k+1)!}=\frac{1}{k!}-\frac{1}{(k+1)!}\text{。}求和后,中间所有阶乘的倒数都相消,只剩下 1−12022!。1-\frac1{2022!}\text{。}因此,a=1,b=2022a=1, b=2022,所以 a+b=2023a+b=2023。
所以正确答案是 D。
Each term telescopes because k(k+1)!=1k!−1(k+1)!.\frac{k}{(k+1)!}=\frac{1}{k!}-\frac{1}{(k+1)!}. Summing makes every intermediate factorial reciprocal cancel, leaving 1−12022!.1-\frac1{2022!}. Hence a=1,b=2022,a=1, b=2022, and a+b=2023.a+b=2023.
Thus, our answer is D .

10.

Camila 写下五个正整数。这些整数的唯一众数比中位数大 22,且中位数比算术平均数大 22。众数的最小可能值是多少?
Camila writes down five positive integers. The unique mode of these integers is 22 greater than their median, and the median is 22 greater than their arithmetic mean. What is the least possible value for the mode?
 5\ 5
 7\ 7
 9\ 9
 11\ 11
 13\ 13
难度评级:1520
小提示:
众数大于中位数,所以它只能出现在两个最大的数中。
The mode exceeds the median, so it can only appear among the two largest numbers
大提示:
设中位数为 mm;为了有唯一众数,两个最大数都必须等于 m+2m+2,且总和为 5(m−2)5(m-2)。
Let the median be m;m; for a unique mode the two largest must both equal m+2,m+2, and the sum is 5(m−2)5(m-2)
解答:
将五个数按递增排列,设中位数为 mm。众数为 m+2>mm + 2 \gt m,所以它只能出现在两个最大数中;要成为唯一众数,这两个数必须都等于 m+2m + 2。
平均数为 m−2m - 2,所以五个数之和为 5(m−2)5(m-2)。除去两个 m+2m + 2 和中位数 mm,两个最小数之和为 5(m−2)−m−2(m+2)5(m-2) - m - 2(m+2) =2m−14= 2m - 14。
两个最小数是不同的正整数,所以 2m−14≥1+2=32m - 14 \ge 1 + 2 = 3,得 m≥9m \ge 9。当 m=9m = 9 时,1,3,9,11,111, 3, 9, 11, 11 满足条件,因此最小众数为 m+2=11m + 2 = 11。
所以正确答案是 D。
List the numbers in increasing order with median m.m. The mode is m+2>m,m + 2 \gt m, so it can only occur among the two largest entries; for it to be the unique mode, both of them must equal m+2.m + 2.
The mean is m−2,m - 2, so the total is 5(m−2).5(m-2). With the two largest equal to m+2m + 2 and the median m,m, the two smallest sum to 5(m−2)−m−2(m+2)5(m-2) - m - 2(m+2) =2m−14.= 2m - 14.
The two smallest are distinct positive integers, so 2m−14≥1+2=3,2m - 14 \ge 1 + 2 = 3, giving m≥9.m \ge 9. With m=9m = 9 the list 1,3,9,11,111, 3, 9, 11, 11 works, so the least mode is m+2=11.m + 2 = 11.
Thus, the correct answer is D.

11.

一个大型学区的所有高中都参加了卖 T 恤的募款活动。下面哪个选项在逻辑上等价于这句话:“没有比 Euclid HS 更大的学校卖出的 T 恤比 Euclid HS 更多”?
All the high schools in a large school district are involved in a fundraiser selling T-shirts. Which of the choices below is logically equivalent to the statement “No school bigger than Euclid HS sold more T-shirts than Euclid HS”?
所有比 Euclid HS 小的学校卖出的 T 恤都比 Euclid HS 少。
All schools smaller than Euclid HS sold fewer T-shirts than Euclid HS.
没有任何卖出 T 恤比 Euclid HS 更多的学校比 Euclid HS 更大。
No school that sold more T-shirts than Euclid HS is bigger than Euclid HS.
所有比 Euclid HS 大的学校卖出的 T 恤都比 Euclid HS 少。
All schools bigger than Euclid HS sold fewer T-shirts than Euclid HS.
所有卖出 T 恤比 Euclid HS 少的学校都比 Euclid HS 小。
All schools that sold fewer T-shirts than Euclid HS are smaller than Euclid HS.
所有比 Euclid HS 小的学校卖出的 T 恤都比 Euclid HS 多。
All schools smaller than Euclid HS sold more T-shirts than Euclid HS.
知识点:逻辑推理
难度评级:900
小提示:
使用原命题的逆否命题
Use the contrapositive of the implication
大提示:
把原命题改写成“如果……那么……”的形式
Translate the statement into an implication
解答:
原命题可写为:如果一所学校比 Euclid HS 更大,那么它卖出的 T 恤就不比 Euclid HS 更多。其逆否命题是:如果一所学校卖出的 T 恤比 Euclid HS 更多,那么它就不比 Euclid HS 更大。这正是选项 B。选项 C 比原命题更强,因为它还排除了较大的学校卖出同样多 T 恤的情形。
所以正确答案是 B。
The statement says: if a school is bigger than Euclid HS, then it did not sell more T-shirts than Euclid HS. Its contrapositive is: if a school sold more T-shirts than Euclid HS, then it is not bigger than Euclid HS. This is exactly choice B . Choice C is stronger than the original statement because it rules out a bigger school selling the same number of T-shirts.
Thus, the answer is B .

12.

一对公平的 66 面骰子掷 nn 次。使得至少有一次掷出的点数和为 77 的概率大于 12\dfrac{1}{2} 的最小 nn 是多少?
A pair of fair 66-sided dice is rolled nn times. What is the least value of nn such that the probability that the sum of the numbers face up on a roll equals 77 at least once is greater than 12?\dfrac{1}{2}?
22
33
44
55
66
难度评级:960
小提示:
比较 (56)n\left(\frac56\right)^n 与 12\frac12。
Compare (56)n\left(\frac56\right)^n with 12\frac12
大提示:
使用补事件:没有一次掷出的点数和为 77。
Use the complement: no roll has sum 77
解答:
可以改求使一次也没有掷出点数和为 77 的概率小于 12\dfrac 12 的最小 nn。每次掷出点数和为 77 的概率是 16\dfrac 16,所以没有掷出点数和 77 的概率是 56\dfrac 56。
因此,所有投掷都没有出现点数和 77 的概率是 (56)n\left(\dfrac 56\right)^n。我们要找使 (56)n<12\left(\dfrac 56\right)^n < \dfrac 12 的最小 nn。
当 n=3n=3 时,概率为 125216\dfrac{125}{216},大于 12\dfrac 12。
当 n=4n=4 时,概率为 6251296\dfrac{625}{1296},小于 12\dfrac 12。因此答案是 44。
所以正确答案是 C。
To compute this, we can also find the least nn such that the probability of not rolling a 77 is less than 12.\dfrac 12. Each roll has an independent probability of 16\dfrac 16 of getting 7,7, so it has a 56\dfrac 56 probability of not landing on 7.7.
Thus, the probability of none of the rolls being 77 is (56)n.\left(\dfrac 56\right)^n. We must find the least nn such that (56)n<12.\left(\dfrac 56\right)^n < \dfrac 12.
If n=3,n=3, then the probability is 125216,\dfrac{125}{216}, which is greater than 12.\dfrac 12.
If n=4,n=4, then the probability is 6251296,\dfrac{625}{1296}, which is less than 12.\dfrac 12. This makes the answer 4.4.
Thus, the answer is C .

13.

一对质数的正差为 22,它们的立方的正差为 3110631106。大于这两个质数的最小质数的各位数字之和是多少?
The positive difference between a pair of primes is equal to 2,2, and the positive difference between the cubes of the two primes is 31106.31106. What is the sum of the digits of the least prime that is greater than those two primes?
 8\ 8
 10\ 10
 11\ 11
 13\ 13
 16\ 16
难度评级:1140
小提示:
对立方差进行因式分解
Factor the difference of cubes
大提示:
设这一对孪生质数为 pp 和 p+2p+2
Let the twin primes be pp and p+2p+2
解答:
由于两个质数相差 22,可以将它们写成 m−1,m+1m-1,m+1,其中 mm 是它们的平均数。
于是 (m+1)3−(m−1)3=31106,(m+1)^3-(m-1)^3 = 31106\text{,}即 m3+3m2+3m+1m^3+3m^2+3m+1 −(m3−3m2+3m−1)-(m^3-3m^2+3m-1) =6m2+2=31106。= 6m^2+2 = 31106\text{。}
因此 m2=5184m^2= 5184,所以 m=72m=72。
因此两个质数为 71,7371,73。大于它们的最小质数是 7979,其数字和为 1616。
所以答案是 E。
Since the primes are 22 away from each other, we can make them equal to m−1,m+1,m-1,m+1, where mm is their average.
Then, (m+1)3−(m−1)3=31106,(m+1)^3-(m-1)^3 = 31106 , making m3+3m2+3m+1m^3+3m^2+3m+1−(m3−3m2+3m−1)-(m^3-3m^2+3m-1) =6m2+2=31106.= 6m^2+2 = 31106.
Therefore, m2=5184,m^2= 5184, so m=72.m=72.
The primes are therefore 71,73.71,73. The least prime greater than both of those is 79,79, and its digit sum is 16.16.
Thus, the answer is E .

14.

设 SS 是 {1,2,3,⋯ ,25}\left\{ 1, 2, 3, \cdots , 25 \right\} 的子集,并且 SS 中任意两个元素(可以相同)的和都不是 SS 的元素。SS 最多可以含有多少个元素?
Suppose that SS is a subset of {1,2,3,⋯ ,25}\left\{ 1, 2, 3, \cdots , 25 \right\} such that the sum of any two (not necessarily distinct) elements of SS is never an element of S.S. What is the maximum number of elements SS may contain?
 12\ 12
 13\ 13
 14\ 14
 15\ 15
 16\ 16
难度评级:1600
小提示:
将小于最大元素的数配对,使每一对的和都等于这个最大元素
Pair the numbers below the maximum element so that each pair sums to that maximum
大提示:
设 mm 为 SS 中的最大元素
Let mm be the largest element of SS
解答:
集合 S={13,14⋯ ,25}S = \{13,14 \cdots ,25\} 有 1313 个元素,且任意两个元素之和都大于 2525,所以这个大小可以达到。
反过来,设 mm 是 SS 的最大元素。对 SS 中每个满足 i<mi<m 的 ii,数 m−im-i 不能也属于 SS。
因此,在小于 mm 的数中,和为 mm 的每一对至多选一个;若 mm 为偶数,中间的数也不能选。于是小于 mm 的元素至多有 ⌊m−12⌋\lfloor \dfrac {m-1}2 \rfloor 个,计入 mm 本身后总数至多为 ⌊m−12⌋+1\lfloor \dfrac{m-1}2 \rfloor +1。
这个上界在 m=25m=25 时最大,等于 1313。
所以正确答案是 B。
The set S={13,14⋯ ,25}S = \{13,14 \cdots ,25\} has 1313 elements, and every pair has sum greater than 25,25, so this size is attainable.
Conversely, let mm be the maximum element of S.S. For every element of SS satisfying i<m,i<m, the number ii and the number m−im-i cannot both belong to S.S.
Thus, among the numbers below m,m, at most one number can be chosen from each pair with sum mm; if mm is even, the middle number cannot be chosen either. Hence at most ⌊m−12⌋\lfloor \dfrac {m-1}2 \rfloor elements lie below m,m, and including mm gives at most ⌊m−12⌋+1\lfloor \dfrac{m-1}2 \rfloor +1 elements.
The maximum value of this has m=25,m=25, yielding 13.13.
Thus, the answer is B .

15.

设 SnS_n 是一个公差为 22 的等差数列的前 nn 项和。商 S3nSn\dfrac{S_{3n}}{S_n} 与 nn 无关。求 S20S_{20}。
Let SnS_n be the sum of the first nn terms of an arithmetic sequence that has a common difference of 2.2. The quotient S3nSn\dfrac{S_{3n}}{S_n} does not depend on n.n. What is S20?S_{20}?
340340
360360
380380
400400
420420
知识点:等差数列求和
难度评级:1820
小提示:
利用商与 n 无关这一条件
Force the quotient to be independent of n
大提示:
用首项和公差表示这个等差数列。
Write the arithmetic sequence in terms of first term and common difference
解答:
将第 nn 项写成 a+2na+2n,于是第一项的前一项为 aa。那么 Sn=∑i=1n(a+2i)=n(a+n+1)。\begin{aligned}S_n&=\sum_{i=1}^n(a+2i)\\&=n(a+n+1)\end{aligned}\text{。}
因此 S3nSn=3(a+3n+1)a+n+1=9−6(a+1)a+n+1。 \begin{aligned} \frac{S_{3n}}{S_n}&=\frac{3(a+3n+1)}{a+n+1}\\ &=9-\frac{6(a+1)}{a+n+1} \end{aligned}\text{。}
要使这个表达式与 nn 无关,最后一个分式的分子 6(a+1)6(a+1) 必须为 00。因此 a=−1a=-1。
所以 S20=20(−1+20+1)=400。S_{20}=20(-1+20+1)=400\text{。}
所以答案是 D。
Write the nnth term as a+2n,a+2n, so the term before the first term is a.a. Then Sn=∑i=1n(a+2i)=n(a+n+1).\begin{aligned}S_n&=\sum_{i=1}^n(a+2i)\\&=n(a+n+1).\end{aligned}
Hence S3nSn=3(a+3n+1)a+n+1=9−6(a+1)a+n+1. \begin{aligned} \frac{S_{3n}}{S_n}&=\frac{3(a+3n+1)}{a+n+1}\\ &=9-\frac{6(a+1)}{a+n+1}. \end{aligned}
For this expression to be independent of n,n, its numerator 6(a+1)6(a+1) in the final fraction must be 0.0. Thus a=−1.a=-1.
Therefore, S20=20(−1+20+1)=400.S_{20}=20(-1+20+1)=400.
Thus, the answer is D .

16.

下图显示一个边长为 44 和 88 的矩形,以及一个边长为 55 的正方形。正方形的三个顶点分别在矩形的三条不同边上,如图所示。求同时位于正方形和矩形内部的区域面积。
The diagram below shows a rectangle with side lengths 44 and 88 and a square with side length 5.5. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle?
151815\dfrac{1}{8}
153815\dfrac{3}{8}
151215\dfrac{1}{2}
155815\dfrac{5}{8}
157815\dfrac{7}{8}
难度评级:1900
小提示:
建立坐标系;正方形的倾斜会在角落形成 33-44-55 直角三角形。
Set up coordinates; the tilt of the square makes 33-44-55 right triangles at the corners
大提示:
除了一个伸出上边界的三角形,整个正方形都在长方形内;从 2525 中减去该三角形面积。
The whole square lies inside the rectangle except one triangle sticking out past the top edge; subtract that triangle from 2525
解答:
将长方形放在 [0,8]×[0,4][0,8] \times [0,4]。利用 33-44-55 直角三角形,倾斜正方形的顶点可取为 (4,0)(4, 0)、(0,3)(0, 3)、(3,7)(3, 7) 和 (7,4)(7, 4)。
除了伸出顶边 y=4y = 4 的三角形外,整个正方形都在长方形内。该三角形的顶点为 (0.75,4)(0.75, 4)、(3,7)(3, 7) 和 (7,4)(7, 4),面积为 12⋅(7−0.75)⋅(7−4)=758。 \dfrac12 \cdot (7 - 0.75) \cdot (7 - 4) = \dfrac{75}{8}\text{。}
重叠区域的面积为 25−758=1258=155825 - \dfrac{75}{8} = \dfrac{125}{8} = 15\dfrac58。
所以正确答案是 D。
Place the rectangle as [0,8]×[0,4].[0,8] \times [0,4]. The tilted square, using the 33-44-55 right triangles, has vertices (4,0),(4, 0), (0,3),(0, 3), (3,7),(3, 7), and (7,4).(7, 4).
The entire square lies inside the rectangle except for the triangle poking above the top edge y=4.y = 4. That triangle has vertices (0.75,4),(0.75, 4), (3,7),(3, 7), and (7,4),(7, 4), with area 12⋅(7−0.75)⋅(7−4)=758. \dfrac12 \cdot (7 - 0.75) \cdot (7 - 4) = \dfrac{75}{8}.
The region inside both is 25−758=1258=1558.25 - \dfrac{75}{8} = \dfrac{125}{8} = 15\dfrac58.
Thus, the correct answer is D.

17.

下列数中,有一个不能被任何小于 1010 的质数整除。是哪一个?
One of the following numbers is not divisible by any prime number less than 10.10. Which is it?
2606−12^{606}-1
2606+12^{606}+1
2607−12^{607}-1
2607+12^{607}+1
2607+36072^{607}+3^{607}
难度评级:1780
小提示:
五个数都是奇数,所以只需测试 3,53, 5 和 77 的整除性。
All five numbers are odd, so test divisibility only by 3,5,3, 5, and 77
大提示:
使用 2n2^n 模 3,5,73, 5, 7 的循环;例如 nn 为偶数时 2n≡1(mod3)2^n \equiv 1 \pmod 3。
Use the cycles of 2n2^n modulo 3,5,7:3, 5, 7: for example 2n≡1(mod3)2^n \equiv 1 \pmod 3 when nn is even
解答:
所有选项都是奇数,所以只需检查质数 3,5,73, 5, 7。
选项 A 中,2606≡1(mod3)2^{606} \equiv 1 \pmod 3,所以 2606−12^{606} - 1 能被 33 整除。选项 B 中,2606≡4(mod5)2^{606} \equiv 4 \pmod 5,所以 2606+12^{606} + 1 能被 55 整除。选项 D 中,2607≡2(mod3)2^{607} \equiv 2 \pmod 3,所以 2607+12^{607} + 1 能被 33 整除。选项 E 对 55 取模时,2607+3607≡3+2=5≡02^{607} + 3^{607} \equiv 3 + 2 = 5 \equiv 0。
对于 2607−12^{607} - 1,它对三取模时 ≡1(mod3)\equiv 1 \pmod 3,对五取模时 ≡2(mod5)\equiv 2 \pmod 5;而且由 23≡1(mod7)2^3 \equiv 1 \pmod 7 和 607≡1(mod3)607 \equiv 1 \pmod 3 可得它对七取模时 ≡1(mod7)\equiv 1 \pmod 7。因此它不能被任何小于 1010 的质数整除。
所以正确答案是 C。
Every option is odd, so only the primes 3,5,73, 5, 7 need checking.
Option A: 2606≡1(mod3),2^{606} \equiv 1 \pmod 3, so 2606−12^{606} - 1 is divisible by 3.3. Option B: 2606≡4(mod5),2^{606} \equiv 4 \pmod 5, so 2606+12^{606} + 1 is divisible by 5.5. Option D: 2607≡2(mod3),2^{607} \equiv 2 \pmod 3, so 2607+12^{607} + 1 is divisible by 3.3. Option E: modulo 5,5, 2607+3607≡3+2=5≡0.2^{607} + 3^{607} \equiv 3 + 2 = 5 \equiv 0.
For 2607−1:2^{607} - 1: it is ≡1(mod3),\equiv 1 \pmod 3, ≡2(mod5),\equiv 2 \pmod 5, and (since 23≡1(mod7)2^3 \equiv 1 \pmod 7 and 607≡1(mod3)607 \equiv 1 \pmod 3) ≡1(mod7).\equiv 1 \pmod 7. So it is not divisible by any prime below 10.10.
Thus, the correct answer is C.

18.

考虑未知数为 xx、yy 和 zz 的三元一次方程组 {a1x+b1y+c1z=0a2x+b2y+c2z=0a3x+b3y+c3z=0 \begin{cases} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{cases} 其中每个系数都是 00 或 11,且方程组有不同于 x=y=z=0x=y=z=0 的解。例如,一个这样的方程组是 {1x+1y+0z=00x+1y+1z=00x+0y+0z=0 \begin{cases} 1 x + 1 y + 0 z & = 0 \\ 0 x + 1 y + 1 z & = 0 \\ 0 x + 0 y + 0 z & = 0 \end{cases} 它有非零解 (x,y,z)=(1,−1,1)(x,y,z) = (1, -1, 1)。这样的方程组共有多少个?(一个方程组中的方程不必互不相同;同样的方程以不同顺序出现时,视为不同方程组。)
Consider systems of three linear equations with unknowns x,x, y,y, and z,z, {a1x+b1y+c1z=0a2x+b2y+c2z=0a3x+b3y+c3z=0 \begin{cases} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{cases} where each of the coefficients is either 00 or 11 and the system has a solution other than x=y=z=0.x=y=z=0. For example, one such system is {1x+1y+0z=00x+1y+1z=00x+0y+0z=0 \begin{cases} 1 x + 1 y + 0 z & = 0 \\ 0 x + 1 y + 1 z & = 0 \\ 0 x + 0 y + 0 z & = 0 \end{cases} with a nonzero solution of (x,y,z)=(1,−1,1).(x,y,z) = (1, -1, 1). How many such systems of equations are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.)
 302\ 302
 338\ 338
 340\ 340
 343\ 343
 344\ 344
难度评级:1970
小提示:
三个不同的非零相关行向量中,一个向量是另外两个不相交支撑向量的普通和
For three distinct nonzero dependent rows, one row is the ordinary sum of two rows with disjoint supports
大提示:
数出所有二进制系数矩阵,再减去非奇异矩阵
Count all binary coefficient matrices and subtract nonsingular ones
解答:
共有 29=5122^9=512 个有序二进制系数矩阵。齐次方程组只有零解,当且仅当它的三个行向量线性无关,因此我们数出这些矩阵后再从总数中减去。
线性无关矩阵的三行必须是互不相同的非零向量。这样的行有 7⋅6⋅5=2107\cdot6\cdot5=210 种有序选法。在三个互不相同的非零二进制向量中,线性相关恰好发生在一个向量是另外两个向量的普通和时;这两个加数的支撑必须非空且互不相交。
若这个和的支撑大小为 22,有 33 种方法选择它的两个坐标,而两个加数就是对应的两个单位向量。若这个和的支撑大小为 33,有 33 种方法选择一个加数所占的单个坐标,其余两个坐标组成另一个加数。因此,共有 3+3=63+3=6 组无序相关三元组,每一组又有 3!=63!=6 种行的排列顺序。
所以线性无关矩阵有 210−6⋅6=174210-6\cdot6=174 个。所求的奇异矩阵数,也就是有非零解的方程组数,为 512−174=338。512-174=338\text{。}
所以正确答案是 B。
There are 29=5122^9=512 ordered binary coefficient matrices. A homogeneous system has only the zero solution exactly when its three row vectors are linearly independent, so we count those matrices and subtract.
An independent matrix must have three distinct nonzero rows. There are 7⋅6⋅5=2107\cdot6\cdot5=210 ordered choices of such rows. Among three distinct nonzero binary vectors, dependence occurs exactly when one is the ordinary sum of the other two; the two summands must have disjoint nonempty supports.
If the sum has support of size 2,2, choose its two coordinates in 33 ways; its summands are the two corresponding unit vectors. If the sum has support of size 3,3, choose which one coordinate forms one summand in 33 ways, with the other two coordinates forming the other summand. Thus there are 3+3=63+3=6 unordered dependent triples, each with 3!=63!=6 row orders.
Hence the number of independent matrices is 210−6⋅6=174.210-6\cdot6=174. The desired number of singular matrices, and therefore of systems with a nonzero solution, is 512−174=338.512-174=338.
Thus, the answer is B .

19.

5×55 \times 5 方格中的每个小方格要么被填充,要么为空;每个小方格最多有八个相邻小方格,相邻表示共边或共顶点。按以下规则变换方格:
• 任意一个已填充的小方格,如果有两个或三个已填充的相邻小方格,则保持填充。
• 任意一个空小方格,如果恰有三个已填充的相邻小方格,则变为填充。
• 所有其他小方格保持为空或变为空。
下图显示一个变换示例。
假设这个 5×55 \times 5 方格有一圈空边框,围住一个 3×33 \times 3 子方格。经过一次变换后,最终方格只在中心有一个已填充小方格。有多少种初始配置会产生这种结果?(旋转或翻折后相同的配置仍视为不同。)
Each square in a 5×55 \times 5 grid is either filled or empty, and has up to eight adjacent neighboring squares, where neighboring squares share either a side or a corner. The grid is transformed by the following rules:
• Any filled square with two or three filled neighbors remains filled.
• Any empty square with exactly three filled neighbors becomes a filled square.
• All other squares remain empty or become empty.
A sample transformation is shown in the figure below.
Suppose the 5×55 \times 5 grid has a border of empty squares surrounding a 3×33 \times 3 subgrid. How many initial configurations will lead to a transformed grid consisting of a single filled square in the center after a single transformation? (Rotations and reflections of the same configuration are considered different.)
 14\ 14
 18\ 18
 22\ 22
 26\ 26
 30\ 30
难度评级:2200
小提示:
只有内部 3×33 \times 3 子网格可以被填充;中心若原为空,则需恰有 33 个填充邻居,若原已填充,则需有 22 或 33 个填充邻居。
Only the inner 3×33 \times 3 can be filled; the center becoming filled needs exactly 33 filled neighbors (if it was empty) or 22-33 (if it was filled)
大提示:
关键限制是没有边界方格获得恰好三个填充邻居;检查可知每个有效构型恰有三个填充格。
The binding constraint is that no border square gains exactly three filled neighbors; check that every valid configuration has exactly three filled cells
解答:
只有内部 3×33 \times 3 子网格可以初始填充。要使中心在变换后填充,若它原为空,则需恰有 33 个填充邻居;若它原已填充,则需有 22 或 33 个填充邻居。
其他所有方格在变换后都必须为空。关键限制是任何边界方格都不能恰好获得三个填充邻居,这就排除了把 3×33 \times 3 子网格某条外边上的三格全部填充的情况。
若中心初始为空,则它的 88 个邻居中必须恰有 33 个被填充。在正方形的对称下检查这些三元组,只剩四种类型。以中心为 (0,0)(0,0) 建立环坐标,代表元为 {(−1,−1),(−1,0),(1,1)},{(−1,−1),(−1,1),(1,−1)},{(−1,−1),(−1,1),(1,0)},{(−1,−1),(0,1),(1,0)}。 \begin{gathered} \{(-1,-1),(-1,0),(1,1)\},\\ \{(-1,-1),(-1,1),(1,-1)\},\\ \{(-1,-1),(-1,1),(1,0)\},\\ \{(-1,-1),(0,1),(1,0)\} \end{gathered}\text{。} 它们的对称轨道大小依次为 8,4,4,48,4,4,4,共给出 2020 种构型。
若中心初始已填充,同样的邻居检查只留下两种构型,其中另外两个填充格是一对相对的角邻居。因此总数为 20+2=2220+2=22。
所以正确答案是 C。
Only the inner 3×33 \times 3 squares can start filled. For the center to be filled afterward, if it began empty it needs exactly 33 filled neighbors, and if it began filled it needs 22 or 3.3.
Every other square must end empty. The key restriction is that no border square may acquire exactly three filled neighbors, which rules out filling all three squares along an outer edge of the 3×3.3 \times 3.
If the center starts empty, exactly 33 of its 88 neighbors must be filled. Checking these triples up to square symmetry leaves four types. With ring coordinates centered at (0,0),(0,0), representatives are {(−1,−1),(−1,0),(1,1)},{(−1,−1),(−1,1),(1,−1)},{(−1,−1),(−1,1),(1,0)},{(−1,−1),(0,1),(1,0)}. \begin{gathered} \{(-1,-1),(-1,0),(1,1)\},\\ \{(-1,-1),(-1,1),(1,-1)\},\\ \{(-1,-1),(-1,1),(1,0)\},\\ \{(-1,-1),(0,1),(1,0)\}. \end{gathered} Their symmetry-orbit sizes are 8,4,4,4,8,4,4,4, giving 2020 configurations.
If the center starts filled, the same neighbor check leaves only the two configurations in which the other filled cells are opposite corner neighbors. Hence the total is 20+2=22.20+2=22.
Thus, the correct answer is C.

20.

设 ABCDABCD 是一个菱形,且 ∠ADC=46∘\angle ADC = 46^\circ。设 EE 是 CD‾\overline{CD} 的中点,FF 是 BE‾\overline{BE} 上的一点,并且 AF‾\overline{AF} 垂直于 BE‾\overline{BE}。求 ∠BFC\angle BFC 的度数。
Let ABCDABCD be a rhombus with ∠ADC=46∘.\angle ADC = 46^\circ. Let EE be the midpoint of CD‾,\overline{CD}, and let FF be the point on BE‾\overline{BE} such that AF‾\overline{AF} is perpendicular to BE‾.\overline{BE}. What is the degree measure of ∠BFC?\angle BFC?
 110\ 110
 111\ 111
 112\ 112
 113\ 113
 114\ 114
难度评级:2150
小提示:
证明 DD 是 AG‾\overline{AG} 的中点,从而 AGAG 是直径
Show that DD is the midpoint of AG‾,\overline{AG}, making AGAG a diameter
大提示:
延长 BE‾\overline{BE},与直线 ADAD 相交于 GG
Extend BE‾\overline{BE} to meet line ADAD at GG
解答:
延长 BE‾\overline{BE},与直线 ADAD 相交于 GG。因为 AD∥BCAD\parallel BC,所以 ∠GDE=∠ECB\angle GDE=\angle ECB,而 ∠GED=∠BEC\angle GED=\angle BEC 是对顶角。又有 DE=ECDE=EC,所以 △GDE≅△BCE\triangle GDE\cong\triangle BCE。因此 DG=BC=ADDG=BC=AD。
所以 DD 是 AG‾\overline{AG} 的中点。以 DD 为圆心、经过 AA 的圆也经过 CC 和 GG。因为 AF⊥FGAF\perp FG,由泰勒斯定理,FF 也在这个圆上。
因为 DGDG 与 DADA 方向相反,∠GDC=180∘−∠ADC=134∘。\begin{aligned}\angle GDC&=180^\circ-\angle ADC\\&=134^\circ\end{aligned}\text{。}所对弧为 GCGC 的圆周角 ∠GFC\angle GFC 因此为 67∘67^\circ。最后,B,F,GB,F,G 共线,所以 ∠BFC=180∘−67∘=113∘。\angle BFC=180^\circ-67^\circ=113^\circ\text{。}
所以答案是 D。
Extend BE‾\overline{BE} to meet line ADAD at G.G. Because AD∥BC,AD\parallel BC, we have ∠GDE=∠ECB,\angle GDE=\angle ECB, and ∠GED=∠BEC\angle GED=\angle BEC are vertical angles. Also DE=EC,DE=EC, so △GDE≅△BCE.\triangle GDE\cong\triangle BCE. Hence DG=BC=AD.DG=BC=AD.
Thus DD is the midpoint of AG‾.\overline{AG}. The circle centered at DD through AA also passes through CC and G.G. Since AF⊥FG,AF\perp FG, Thales’ theorem places FF on this circle as well.
Because DGDG is opposite DA,DA, ∠GDC=180∘−∠ADC=134∘.\begin{aligned}\angle GDC&=180^\circ-\angle ADC\\&=134^\circ.\end{aligned} The inscribed angle ∠GFC\angle GFC subtending arc GCGC is therefore 67∘.67^\circ. Finally, B,F,GB,F,G are collinear, so ∠BFC=180∘−67∘=113∘.\angle BFC=180^\circ-67^\circ=113^\circ.
Thus, the answer is D .

21.

设 P(x)P(x) 是一个有理系数多项式。P(x)P(x) 除以 x2+x+1x^2 + x + 1 的余式为 x+2x+2,P(x)P(x) 除以 x2+1x^2+1 的余式为 2x+12x+1。满足这两个条件且次数最小的多项式唯一。求这个多项式各系数平方和。
Let P(x)P(x) be a polynomial with rational coefficients such that when P(x)P(x) is divided by the polynomial x2+x+1,x^2 + x + 1, the remainder is x+2,x+2, and when P(x)P(x) is divided by the polynomial x2+1,x^2+1, the remainder is 2x+1.2x+1. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial?
 10\ 10
 13\ 13
 19\ 19
 20\ 20
 23\ 23
难度评级:2080
小提示:
最低次数多项式是三次多项式;将它写成 P(x)=x+2P(x) = x + 2 +(x2+x+1)(px+q)+ (x^2 + x + 1)(px + q)。
The least-degree polynomial is a cubic; write P(x)=x+2P(x) = x + 2 +(x2+x+1)(px+q)+ (x^2 + x + 1)(px + q)
大提示:
模 x2+1x^2 + 1 化简这个式子,利用 x2≡−1x^2 \equiv -1,再将所得余式与 2x+12x + 1 比较。
Reduce that expression modulo x2+1x^2 + 1 using x2≡−1,x^2 \equiv -1, and match it to 2x+12x + 1
解答:
一次多项式不可能给出这两个不同的余式。若 P(x)=ax2+bx+cP(x)=ax^2+bx+c 是二次的,比较它的两个余式会同时得到 b−a=1, c−a=2b-a=1,\ c-a=2 和 b=2, c−a=1b=2,\ c-a=1,互相矛盾。因此最低可能次数是 33。写成 P(x)=(x+2)P(x) = (x + 2) +(x2+x+1)(px+q)+ (x^2 + x + 1)(px + q),它除以 x2+x+1x^2 + x + 1 的余式就是 x+2x + 2。
模 x2+1x^2 + 1 化简(即令 x2≡−1x^2 \equiv -1),所得余式为 (q+1)x+(2−p)(q + 1)x + (2 - p)。令它等于 2x+12x + 1,得到 q=1q = 1 且 p=1p = 1。
于是 P(x)=x3+2x2+3x+3P(x) = x^3 + 2x^2 + 3x + 3,各系数的平方和为 1+4+9+9=231 + 4 + 9 + 9 = 23。
所以正确答案是 E。
No linear polynomial can have the two different remainders. If P(x)=ax2+bx+cP(x)=ax^2+bx+c were quadratic, comparing its remainders would give both b−a=1, c−a=2b-a=1,\ c-a=2 and b=2, c−a=1,b=2,\ c-a=1, a contradiction. Thus the least possible degree is 3.3. Write P(x)=(x+2)P(x) = (x + 2) +(x2+x+1)(px+q),+ (x^2 + x + 1)(px + q), which has remainder x+2x + 2 upon division by x2+x+1.x^2 + x + 1.
Reducing modulo x2+1x^2 + 1 (so x2≡−1x^2 \equiv -1) gives remainder (q+1)x+(2−p).(q + 1)x + (2 - p). Setting this equal to 2x+12x + 1 gives q=1q = 1 and p=1.p = 1.
Then P(x)=x3+2x2+3x+3,P(x) = x^3 + 2x^2 + 3x + 3, and the sum of the squares of the coefficients is 1+4+9+9=23.1 + 4 + 9 + 9 = 23.
Thus, the correct answer is E.

22.

设 SS 为坐标平面中所有同时与下面三个圆相切的圆的集合:x2+y2=4,x2+y2=64,x^{2}+y^{2}=4,\qquad x^{2}+y^{2}=64\text{,}以及 (x−5)2+y2=3。(x-5)^{2}+y^{2}=3\text{。}求 SS 中所有圆的面积之和。
Let SS be the set of circles in the coordinate plane that are tangent to each of the three circles with equations x2+y2=4,x2+y2=64,x^{2}+y^{2}=4,\qquad x^{2}+y^{2}=64, and (x−5)2+y2=3.(x-5)^{2}+y^{2}=3. What is the sum of the areas of all circles in S?S?
 48π\ 48 \pi
 68π\ 68 \pi
 96π\ 96 \pi
 102π\ 102 \pi
 136π\ 136 \pi
难度评级:2280
小提示:
根据所求圆与较小同心圆内切还是外切来配对讨论
Pair cases according to whether it is internally or externally tangent to the smaller concentric circle
大提示:
每个所求圆都与最大的同心圆内切
Every desired circle is internally tangent to the largest concentric circle
解答:
将半径为 22 和 88 的两个同心圆分别称为内圆和外圆。设所求圆的半径为 rr,圆心到原点的距离为 dd。所求圆必与外圆内切,因此 d+r=8d+r=8。
若所求圆与内圆外切,则 d−r=2d-r=2,从而 (r,d)=(3,5)(r,d)=(3,5)。若所求圆包含内圆,则 r−d=2r-d=2,从而 (r,d)=(5,3)(r,d)=(5,3)。因此,所求圆的半径必为 33 或 55。
第三个已知圆的半径为 3\sqrt3,圆心为 (5,0)(5,0)。对 rr 的两个可能值,所求圆都可以与第三个圆内切或外切,所以两圆心之间的距离为 r−3r-\sqrt3 或 r+3r+\sqrt3。在这四种情形中,若该距离为 qq,则都有 ∣d−q∣<5<d+q|d-q|<5<d+q。因此,以原点为圆心、dd 为半径的圆与所求圆圆心的轨迹交于关于 xx 轴对称的两点,如图所示。于是,每一种半径都有 44 个所求圆。
所以总面积为 4(52π+32π)=136π。4(5^2\pi+3^2\pi)=136\pi\text{。}因此,正确答案是 E。
Call the concentric circles of radii 22 and 88 the inner and outer circles. Let a desired circle have radius rr and let its center be distance dd from the origin. It must be internally tangent to the outer circle, so d+r=8.d+r=8.
If it is externally tangent to the inner circle, then d−r=2,d-r=2, giving (r,d)=(3,5).(r,d)=(3,5). If it contains the inner circle, then r−d=2,r-d=2, giving (r,d)=(5,3).(r,d)=(5,3). Thus every desired circle has radius 33 or 5.5.
The third given circle has radius 3\sqrt3 and center (5,0).(5,0). For either value of r,r, a desired circle may be internally or externally tangent to it, so the distance between their centers is r−3r-\sqrt3 or r+3.r+\sqrt3. In all four cases, if this distance is q,q, then ∣d−q∣<5<d+q,|d-q|<5<d+q, so the circle of possible centers intersects the circle of radius dd about the origin in two points, symmetric across the xx-axis, as shown. Hence there are 44 desired circles of each radius.
The total area is therefore 4(52π+32π)=136π.4(5^2\pi+3^2\pi)=136\pi. Thus, E is the correct answer.

23.

蚂蚁 Amelia 从数轴上的 00 出发,并按如下方式爬行。当 n=1n=1、22、33 时,Amelia 独立且均匀地从区间 (0,1)(0,1) 中随机选择一个持续时间 tnt_n 和一个增量 xnx_n。在第 nn 步中,Amelia 沿正方向移动 xnx_n 个单位,用时 tnt_n 分钟。如果总用时在第 nn 步期间已经超过 11 分钟,她会在该步结束时停止;否则继续下一步,最多走 33 步。Amelia 停止时位置大于 11 的概率是多少?
Ant Amelia starts on the number line at 00 and crawls in the following manner. For n=1,n=1, 2,2, 3;3; Amelia chooses a time duration tnt_n and an increment xnx_n independently and uniformly at random from the interval (0,1).(0,1). During the nnth step of the process, Amelia moves xnx_n units in the positive direction, using up tnt_n minutes. If the total elapsed time has exceeded 11 minute during the nnth step, she stops at the end of that step; otherwise, she continues with the next step, taking at most 33 steps in all. What is the probability that Amelia’s position when she stops will be greater than 1?1?
13\dfrac 13
12\dfrac 12
23\dfrac 23
34\dfrac 34
56\dfrac 56
难度评级:2130
小提示:
用几何概率求两个或三个独立的 (0,1)(0,1) 区间随机数之和
Use geometric probabilities for sums of two or three independent numbers in (0,1)(0,1)
大提示:
停止时刻只由变量 t1t_1、t2t_2 和 t3t_3 决定
The stopping time depends only on the variables t1,t_1, t2,t_2, and t3t_3
解答:
停止时间只依赖时间变量,而最终位置只依赖距离变量,所以相应概率可以相乘。
两个独立 (0,1)(0,1) 数之和小于 11 的概率是单位正方形中一个直角三角形的面积,即 12\frac12。
三个独立 (0,1)(0,1) 数之和小于 11 的概率是截距为 11 的四面体体积,即 16\frac16。
若 t1+t2>1t_1+t_2>1,Amelia 走两步后停止。其概率为 12\frac12,且独立地有 x1+x2>1x_1+x_2>1 的概率为 12\frac12,贡献 14\frac14。
若 t1+t2<1t_1+t_2<1,Amelia 会走第三步。其概率为 12\frac12,且独立地有 x1+x2+x3>1x_1+x_2+x_3>1 的概率为 1−16=561-\frac16=\frac56,贡献 512\frac5{12}。
总概率为 14+512=23\frac14+\frac5{12}=\frac23。
所以正确答案是 C。
The stopping time depends only on the time variables, while the final position depends only on the distance variables, so the corresponding probabilities multiply.
For two independent numbers in (0,1),(0,1), the probability that their sum is less than 11 is the area of a right triangle, namely 12.\frac12.
For three independent numbers in (0,1),(0,1), the probability that their sum is less than 11 is the volume of a tetrahedron with side intercepts 1,1, namely 16.\frac16.
If t1+t2>1,t_1+t_2>1, Amelia stops after two steps. This has probability 12,\frac12, and independently x1+x2>1x_1+x_2>1 has probability 12,\frac12, contributing 14.\frac14.
If t1+t2<1,t_1+t_2<1, Amelia takes the third step. This has probability 12,\frac12, and independently x1+x2+x3>1x_1+x_2+x_3>1 has probability 1−16=56,1-\frac16=\frac56, contributing 512.\frac5{12}.
The total probability is 14+512=23.\frac14+\frac5{12}=\frac23.
Thus, the answer is C .

24.

考虑满足 ∣f(x)−f(y)∣≤12∣x−y∣|f(x)-f(y)|\leq \dfrac{1}{2}|x-y| 的函数 ff,其中 xx 和 yy 为任意实数。在所有还满足 f(300)=f(900)f(300) = f(900) 的这类函数中,下面这个表达式的最大可能值是多少?f(f(800))−f(f(400))f(f(800))-f(f(400))
Consider functions ff that satisfy ∣f(x)−f(y)∣≤12∣x−y∣|f(x)-f(y)|\leq \dfrac{1}{2}|x-y| for all real numbers xx and y.y. Of all such functions that also satisfy the equation f(300)=f(900),f(300) = f(900), what is the greatest possible value of the following expression? f(f(800))−f(f(400))f(f(800))-f(f(400))
2525
5050
100100
150150
200200
难度评级:2390
小提示:
证明上界后,构造一个能取到该上界的分段线性函数
After proving the upper bound, give a piecewise-linear function that attains it
大提示:
在 f(300)=f(900)f(300)=f(900) 的两侧各使用两次收缩条件
Use the contraction condition twice on each side of f(300)=f(900)f(300)=f(900)
解答:
连续使用两次收缩不等式可得 ∣f(f(400))−f(f(300))∣≤12∣f(400)−f(300)∣≤25, \begin{aligned} &|f(f(400))-f(f(300))|\\ &\quad\le\frac12|f(400)-f(300)|\\ &\quad\le25 \end{aligned}\text{,}同理,∣f(f(800))−f(f(900))∣≤25。|f(f(800))-f(f(900))|\le25\text{。}
设 M=f(f(300))=f(f(900))M=f(f(300))=f(f(900))。由三角不等式,∣f(f(800))−f(f(400))∣≤∣f(f(800))−M∣+∣M−f(f(400))∣≤50。 \begin{aligned} &|f(f(800))-f(f(400))|\\ &\quad\le|f(f(800))-M|\\ &\qquad+|M-f(f(400))|\\ &\quad\le50 \end{aligned}\text{。}
为取到这个上界,定义 ff 为依次经过下列各点的分段线性函数:(300,600),(400,550),(550,575),(650,625),(800,650),(900,600)。\begin{gathered}(300,600),(400,550),(550,575),\\ (650,625),(800,650),(900,600)\end{gathered}\text{。}并规定当 x≤300x\leq300 或 x≥900x\geq900 时 f(x)=600f(x)=600。每一段斜率的绝对值都不超过 12\dfrac12,因此满足收缩条件。特别地,f(300)=f(900)=600f(300)=f(900)=600、f(400)=550f(400)=550、f(800)=650f(800)=650。所以 f(f(400))=f(550)=575f(f(400))=f(550)=575,而 f(f(800))=f(650)=625f(f(800))=f(650)=625,两者之差为 5050。
所以正确答案是 B。
Applying the contraction inequality twice gives ∣f(f(400))−f(f(300))∣≤12∣f(400)−f(300)∣≤25, \begin{aligned} &|f(f(400))-f(f(300))|\\ &\quad\le\frac12|f(400)-f(300)|\\ &\quad\le25, \end{aligned} and similarly ∣f(f(800))−f(f(900))∣≤25.|f(f(800))-f(f(900))|\le25.
Set M=f(f(300))=f(f(900)).M=f(f(300))=f(f(900)). The triangle inequality now yields ∣f(f(800))−f(f(400))∣≤∣f(f(800))−M∣+∣M−f(f(400))∣≤50. \begin{aligned} &|f(f(800))-f(f(400))|\\ &\quad\le|f(f(800))-M|\\ &\qquad+|M-f(f(400))|\\ &\quad\le50. \end{aligned}
To attain the bound, define ff by linear interpolation through the points (300,600),(400,550),(550,575),(650,625),(800,650),(900,600).\begin{gathered}(300,600),(400,550),(550,575),\\ (650,625),(800,650),(900,600).\end{gathered} and set f(x)=600f(x)=600 for x≤300x\leq300 or x≥900.x\geq900. Every segment has slope with absolute value at most 12,\dfrac12, so the contraction condition holds. In particular, f(300)=f(900)=600,f(300)=f(900)=600, f(400)=550,f(400)=550, and f(800)=650.f(800)=650. Hence f(f(400))=f(550)=575,f(f(400))=f(550)=575, while f(f(800))=f(650)=625,f(f(800))=f(650)=625, giving the difference 50.50.
Thus, the answer is B .

25.

设 x0x_0、x1x_1、x2x_2、…\dotsc 是一个数列,其中每个 xkx_k 都是 00 或 11。对每个正整数 nn,定义 Sn=∑k=0n−1xk2kS_n = \sum_{k=0}^{n-1} x_k 2^k 假设对所有 n≥1n \geq 1,都有 7Sn≡1(mod2n)7S_n \equiv 1 \pmod{2^n}。求下式的值:x2019+2x2020+x_{2019} + 2x_{2020} + 4x2021+8x2022?4x_{2021} + 8x_{2022}\text{?}
Let x0,x_0, x1,x_1, x2,x_2, …\dotsc be a sequence of numbers, where each xkx_k is either 00 or 1.1. For each positive integer n,n, define Sn=∑k=0n−1xk2kS_n = \sum_{k=0}^{n-1} x_k 2^k Suppose 7Sn≡1(mod2n)7S_n \equiv 1 \pmod{2^n} for all n≥1.n \geq 1. What is the value of the sum x2019+2x2020+x_{2019} + 2x_{2020} + 4x2021+8x2022?4x_{2021} + 8x_{2022}?
66
77
1212
1414
1515
难度评级:2330
小提示:
这个同余式刻画了 77 的二进制逆元的各位数字
The congruence defines the binary digits of the inverse of 77
大提示:
求出 S2019S_{2019} 和 S2023S_{2023},再相减以分离这四个二进制位
Find S2019S_{2019} and S2023,S_{2023}, then subtract to isolate the four digits
解答:
所求的和为 S2023−S201922019。\frac{S_{2023}-S_{2019}}{2^{2019}}\text{。}此外,0≤Sn<2n0\le S_n<2^n。
因此,存在唯一的 mn∈{0,1,…,6}m_n\in\{0,1,\ldots,6\},使得 7Sn=mn2n+1。7S_n=m_n2^n+1\text{。}模 77 化简得到 mn2n≡−1(mod7)m_n2^n\equiv-1\pmod7。
因为 23≡1(mod7)2^3\equiv1\pmod7,且 2019≡0(mod3)2019\equiv0\pmod3,所以 m2019=6m_{2019}=6。又因为 2023≡1(mod3)2023\equiv1\pmod3,所以 2m2023≡−1(mod7)2m_{2023}\equiv-1\pmod7,从而 m2023=3m_{2023}=3。因此 S2019=6⋅22019+17,S2023=3⋅22023+17。\begin{gathered}S_{2019}=\frac{6\cdot2^{2019}+1}{7},\\ S_{2023}=\frac{3\cdot2^{2023}+1}{7}\end{gathered}\text{。}
最后,S2023−S201922019=3⋅24−67=6。 \frac{S_{2023}-S_{2019}}{2^{2019}} =\frac{3\cdot2^4-6}{7}=6\text{。}
所以正确答案是 A。
The desired sum is S2023−S201922019.\frac{S_{2023}-S_{2019}}{2^{2019}}. Also, 0≤Sn<2n.0\le S_n<2^n.
Therefore, for a unique mn∈{0,1,…,6},m_n\in\{0,1,\ldots,6\}, 7Sn=mn2n+1.7S_n=m_n2^n+1. Reducing modulo 77 gives mn2n≡−1(mod7).m_n2^n\equiv-1\pmod7.
Since 23≡1(mod7)2^3\equiv1\pmod7 and 2019≡0(mod3),2019\equiv0\pmod3, we get m2019=6.m_{2019}=6. Since 2023≡1(mod3),2023\equiv1\pmod3, we have 2m2023≡−1(mod7),2m_{2023}\equiv-1\pmod7, so m2023=3.m_{2023}=3. Hence S2019=6⋅22019+17,S2023=3⋅22023+17.\begin{gathered}S_{2019}=\frac{6\cdot2^{2019}+1}{7},\\ S_{2023}=\frac{3\cdot2^{2023}+1}{7}.\end{gathered}
Finally, S2023−S201922019=3⋅24−67=6. \frac{S_{2023}-S_{2019}}{2^{2019}} =\frac{3\cdot2^4-6}{7}=6.
Thus, the correct answer is A .
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

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