2025 AMC 12B 真题

向下滚动并点击“开始”即可作答!或前往可打印 PDF答案,或由 LIVE by Po-Shen Loh 精心整理的专业解答

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

或直接跳转到某一道题及其解答: 1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 · 12 · 13 · 14 · 15 · 16 · 17 · 18 · 19 · 20 · 21 · 22 · 23 · 24 · 25

想通过互动视频课程系统学习吗?

了解 LIVE课程

计时

1:15:00

1.

一袋 350350 克的咖啡豆说明上写着:正确冲泡一大杯手冲咖啡需要 2020 克咖啡豆。用这袋咖啡豆最多可以正确冲泡多少大杯咖啡?

The instructions on a 350350-gram bag of coffee beans say that proper brewing of a large mug of pour-over coffee requires 2020 grams of coffee beans. What is the greatest number of properly brewed large mugs of coffee that can be made from the coffee beans in that bag?

1616

1717

1818

1919

2020

答案:B
知识点:取整函数
难度评级:890
小提示:

用咖啡豆的总克数除以每杯所需的克数。

Divide the total grams by the grams needed per mug

大提示:

只能计算完整的杯数,所以要将 35020\dfrac{350}{20} 向下取整。

Only whole mugs count, so round 35020\dfrac{350}{20} down

解答:

每杯需要 2020 克,而 35020=17.5\dfrac{350}{20} = 17.5。由于只能冲泡完整的一杯,最多可冲 1717 杯。

所以正确答案是 B

Each mug uses 2020 grams, and 35020=17.5.\dfrac{350}{20} = 17.5. Only complete mugs can be brewed, so the greatest number is 17.17.

Thus, the correct answer is B.

2.

Jerry 写下前 20252025 个正平方数的个位数字:114499665566\ldots。他写下的所有数字之和是多少?

Jerry wrote down the ones digit of each of the first 20252025 positive squares: 1,1, 4,4, 9,9, 6,6, 5,5, 6,6, .\ldots. What is the sum of all the numbers Jerry wrote down?

90259025

90709070

90909090

91159115

91609160

答案:D
难度评级:1020
小提示:

n2n^2 的个位数字只由 nn 的个位数字决定,所以这个列表每 1010 项循环一次。

The ones digit of n2n^2 depends only on the ones digit of n,n, so the list repeats every 1010 terms

大提示:

求出一个完整 1010 项循环的和,乘以循环次数,再加上剩余项。

Sum one full block of 10,10, multiply by the number of blocks, then add the leftover terms

解答:

12,22,,1021^2, 2^2, \ldots, 10^2 的个位数字依次为 1,4,9,6,5,6,9,4,1,01, 4, 9, 6, 5, 6, 9, 4, 1, 0,其和为 4545。这 20252025 项包含 202202 个完整的循环块(共 20202020 项),另外还有 55 项,它们的个位数字为 1,4,9,6,51, 4, 9, 6, 5,和为 2525。因此总和为 20245+25=9090+25202 \cdot 45 + 25 = 9090 + 25 =9115= 9115

所以正确答案是 D

The ones digits of 12,22,,1021^2, 2^2, \ldots, 10^2 are 1,4,9,6,5,6,9,4,1,0,1, 4, 9, 6, 5, 6, 9, 4, 1, 0, which sum to 45.45. The 20252025 terms contain 202202 full blocks (20202020 terms) plus 55 more with digits 1,4,9,6,51, 4, 9, 6, 5 summing to 25.25. The total is 20245+25=9090+25202 \cdot 45 + 25 = 9090 + 25 =9115.= 9115.

Thus, the correct answer is D.

3.

i=1i = \sqrt{-1},求 i(i1)(i2)(i3)i(i-1)(i-2)(i-3) 的值。

What is the value of i(i1)(i2)(i3),i(i-1)(i-2)(i-3), where i=1?i = \sqrt{-1}?

65i6 - 5i

10i-10i

10i10i

10-10

1010

答案:D
知识点:复数
难度评级:1130
小提示:

分组相乘:先算 i(i1)i(i-1)(i2)(i3)(i-2)(i-3)

Multiply in pairs: i(i1)i(i-1) and (i2)(i3)(i-2)(i-3)

大提示:

利用 i2=1i^2 = -1 化简每个乘积,再将两个结果相乘。

Use i2=1i^2 = -1 to reduce each product before multiplying the two results

解答:

i(i1)=i2i=1ii(i-1) = i^2 - i = -1 - i,而 (i2)(i3)=i25i+6(i-2)(i-3) = i^2 - 5i + 6 =55i= 5 - 5i。于是 (1i)(55i)=5+5i5i+5i2=55=10 \begin{gathered} (-1-i)(5-5i) = -5 \\ {}+ 5i - 5i \\ {}+ 5i^2 \\ = -5 - 5 = -10 \end{gathered}\text{。}

所以正确答案是 D

i(i1)=i2i=1i,i(i-1) = i^2 - i = -1 - i, and (i2)(i3)=i25i+6(i-2)(i-3) = i^2 - 5i + 6 =55i.= 5 - 5i. Then (1i)(55i)=5+5i5i+5i2=55=10. \begin{gathered} (-1-i)(5-5i) = -5 \\ {}+ 5i - 5i \\ {}+ 5i^2 \\ = -5 - 5 = -10. \end{gathered}

Thus, the correct answer is D.

4.

以七为底的两位数 ab\underline{a}\,\underline{b} 的值等于以九为底的两位数 ba\underline{b}\,\underline{a} 的值。a+ba + b 是多少?

The value of the two-digit number ab\underline{a}\,\underline{b} in base seven equals the value of the two-digit number ba\underline{b}\,\underline{a} in base nine. What is a+b?a + b?

77

99

1010

1111

1414

答案:A
知识点:进制一次方程
难度评级:1200
小提示:

按位值计算,以七为底的 ab\underline{a}\,\underline{b}7a+b7a + b,以九为底的 ba\underline{b}\,\underline{a}9b+a9b + a

Write each number in terms of its base: ab\underline{a}\,\underline{b} is 7a+b7a + b and ba\underline{b}\,\underline{a} is 9b+a9b + a

大提示:

7a+b=9b+a7a + b = 9b + a,再化简得到 aabb 的比例关系。

Set 7a+b=9b+a7a + b = 9b + a and simplify to a ratio between aa and bb

解答:

7a+b=9b+a7a + b = 9b + a,得到 6a=8b6a = 8b,所以 3a=4b3a = 4b。因而 a=4ta=4tb=3tb=3t。因为两者都是七进制数字并且 a0a\ne0,只有 t=1t=1 可行。因此 a=4,b=3a=4, b=3,而且确实有 437=31=34943_7 = 31 = 34_9。所以 a+b=7a+b=7

因此,正确答案是 A

Setting 7a+b=9b+a7a + b = 9b + a gives 6a=8b,6a = 8b, so 3a=4b.3a = 4b. Thus a=4ta=4t and b=3t.b=3t. Because both are base-seven digits and a0,a\ne0, only t=1t=1 works. Hence a=4,b=3,a=4, b=3, and indeed 437=31=349.43_7 = 31 = 34_9. Therefore a+b=7.a+b=7.

Thus, the correct answer is A.

5.

正整数 xxyy 满足方程 57x+22y=40057x + 22y = 400。求 x+yx + y 的最小可能值。

Positive integers xx and yy satisfy the equation 57x+22y=400.57x + 22y = 400. What is the least possible value of x+y?x + y?

1010

1111

1313

1414

1515

答案:E
难度评级:1290
小提示:

57x+22y=40057x + 22y = 4002222 取模,以确定 xx 的可能形式。

Reduce 57x+22y=40057x + 22y = 400 modulo 2222 to pin down xx

大提示:

因为 xx 为正整数且 57x<40057x \lt 400,所以只需检查很少几个 xx 的值。

Since xx is positive and 57x<400,57x \lt 400, only a few values of xx are possible

解答:

2222 取模,方程变为 13x413x \equiv 4,所以 x2(mod22)x \equiv 2 \pmod{22}。又 57x<40057x \lt 400,正整数解只能有 x=2x = 2。代回得 22y=28622y = 286,所以 y=13y = 13。因此 x+y=15x + y = 15

所以正确答案是 E

Modulo 22,22, the equation gives 13x4,13x \equiv 4, so x2(mod22).x \equiv 2 \pmod{22}. With 57x<400,57x \lt 400, the only option is x=2,x = 2, which gives 22y=286,22y = 286, so y=13.y = 13. Then x+y=15.x + y = 15.

Thus, the correct answer is E.

6.

Emmy 对 Max 说:“我今天订了 3636 件数学俱乐部卫衣。”Max 问:“每件多少钱?”Emmy 回答:“给你一个提示:总价是 $ABB.BA\$\underline{A}\,\underline{B}\,\underline{B}.\underline{B}\,\underline{A},其中 AABB 是数字,且 A0A \neq 0。”停顿片刻后,Max 说:“这价格真不错。”求 A+BA + B

Emmy says to Max, “I ordered 3636 math club sweatshirts today.” Max asks, “How much did each shirt cost?” Emmy responds, “I’ll give you a hint. The total cost was $ABB.BA,\$\underline{A}\,\underline{B}\,\underline{B}.\underline{B}\,\underline{A}, where AA and BB are digits and A0.A \neq 0.” After a pause, Max says, “That was a good price.” What is A+B?A + B?

77

88

1111

1414

1515

答案:C
难度评级:1390
小提示:

以美分计,总价为 10001A+1110B10001A + 1110B 且必须能被 3636 整除。

In cents the total is 10001A+1110B,10001A + 1110B, and it must be divisible by 3636

大提示:

3636 取模得 7A+6B07A + 6B \equiv 0,再检查满足 A0A \neq 0 的数字解。

Reduce modulo 3636 to get 7A+6B0,7A + 6B \equiv 0, then test digits with A0A \neq 0

解答:

以美分为单位,总额为 10000A+1110B+A10000A + 1110B + A =10001A+1110B= 10001A + 1110B,它必须是 3636 的倍数。因为 100012910001 \equiv 29111030(mod36)1110 \equiv 30 \pmod{36},条件为 29A+30B029A + 30B \equiv 0,即 7A+6B0(mod36)7A + 6B \equiv 0 \pmod{36}。再对 66 取模,得到 A0(mod6)A\equiv0\pmod6,所以唯一可能的非零数字是 A=6A=6。此时 42+6B42+6B 只有当数字 B=5B=5 时才能被 3636 整除。确实,$655.56=36×$18.21\$655.56 = 36 \times \$18.21,所以 A+B=11A+B=11

因此,正确答案是 C

The total in cents is 10000A+1110B+A10000A + 1110B + A =10001A+1110B,= 10001A + 1110B, which must be a multiple of 36.36. Since 100012910001 \equiv 29 and 111030(mod36),1110 \equiv 30 \pmod{36}, the condition is 29A+30B0,29A + 30B \equiv 0, i.e. 7A+6B0(mod36).7A + 6B \equiv 0 \pmod{36}. Reducing once more modulo 66 gives A0(mod6),A\equiv0\pmod6, so the only possible nonzero digit is A=6.A=6. Then 42+6B42+6B is divisible by 3636 only for the digit B=5.B=5. Indeed $655.56=36×$18.21,\$655.56 = 36 \times \$18.21, so A+B=11.A+B=11.

Thus, the correct answer is C.

7.

求下列和的值:

n=2255log2(1+1n)(log2n)(log2(n+1)) \sum_{n=2}^{255} \frac{\log_2\left(1 + \frac{1}{n}\right)}{(\log_2 n)(\log_2(n+1))}\text{?}

What is the value of

n=2255log2(1+1n)(log2n)(log2(n+1))? \sum_{n=2}^{255} \frac{\log_2\left(1 + \frac{1}{n}\right)}{(\log_2 n)(\log_2(n+1))}?

34\dfrac{3}{4}

11log22551 - \dfrac{1}{\log_2 255}

78\dfrac{7}{8}

1516\dfrac{15}{16}

11

答案:C
知识点:裂项相消对数
难度评级:1420
小提示:

写成 log2 ⁣(1+1n)\log_2\!\left(1 + \frac{1}{n}\right) =log2(n+1)log2n= \log_2(n+1) - \log_2 n

Write log2 ⁣(1+1n)\log_2\!\left(1 + \frac{1}{n}\right) =log2(n+1)log2n= \log_2(n+1) - \log_2 n

大提示:

an=log2na_n = \log_2 n,每一项就变成 1an1an+1\dfrac{1}{a_n} - \dfrac{1}{a_{n+1}}

With an=log2n,a_n = \log_2 n, each term becomes 1an1an+1\dfrac{1}{a_n} - \dfrac{1}{a_{n+1}}

解答:

an=log2na_n = \log_2 n。分子是 an+1ana_{n+1} - a_n,所以 an+1ananan+1=1an1an+1\dfrac{a_{n+1} - a_n}{a_n a_{n+1}} = \dfrac{1}{a_n} - \dfrac{1}{a_{n+1}}。从 n=2n = 2255255 裂项相消,得到 1log221log2256=118\dfrac{1}{\log_2 2} - \dfrac{1}{\log_2 256} = 1 - \dfrac{1}{8} =78= \dfrac{7}{8}

所以正确答案是 C

Let an=log2n.a_n = \log_2 n. The numerator equals an+1an,a_{n+1} - a_n, so each term is an+1ananan+1=1an1an+1.\dfrac{a_{n+1} - a_n}{a_n a_{n+1}} = \dfrac{1}{a_n} - \dfrac{1}{a_{n+1}}. Telescoping from n=2n = 2 to 255255 leaves 1log221log2256=118\dfrac{1}{\log_2 2} - \dfrac{1}{\log_2 256} = 1 - \dfrac{1}{8} =78.= \dfrac{7}{8}.

Thus, the correct answer is C.

8.

存在整数 aabb,使得多项式 x35x2+ax+bx^3 - 5x^2 + ax + b 有根 4+54 + \sqrt{5}a+ba + b 是多少?

There are integers aa and bb such that the polynomial x35x2+ax+bx^3 - 5x^2 + ax + b has 4+54 + \sqrt{5} as a root. What is a+b?a + b?

1313

1717

2020

3030

6868

答案:C
难度评级:1440
小提示:

整数系数会迫使共轭数 454 - \sqrt{5} 也是一个根。

Integer coefficients force the conjugate 454 - \sqrt{5} to be a root as well

大提示:

三个根的和为 55,先求第三个根,再展开读出 aabb

The three roots sum to 5,5, so find the third root, then expand to read off aa and bb

解答:

共轭数 454 - \sqrt{5} 也是根,而两者对应的二次因式是 x28x+11x^2 - 8x + 11。设第三个根为 rr,由根和得 8+r=58 + r = 5,所以 r=3r = -3。展开 (x28x+11)(x+3)(x^2 - 8x + 11)(x + 3) =x35x213x+33= x^3 - 5x^2 - 13x + 33,故 a=13a = -13b=33b = 33a+b=20a + b = 20

所以正确答案是 C

The conjugate 454 - \sqrt{5} is also a root, and these two are the roots of x28x+11.x^2 - 8x + 11. The third root rr satisfies 8+r=5,8 + r = 5, so r=3.r = -3. Then (x28x+11)(x+3)(x^2 - 8x + 11)(x + 3) =x35x213x+33,= x^3 - 5x^2 - 13x + 33, giving a=13a = -13 and b=33,b = 33, so a+b=20.a + b = 20.

Thus, the correct answer is C.

9.

6666^{6^6} 的十位数字是多少?

What is the tens digit of 666?6^{6^6}?

11

33

55

77

99

答案:C
知识点:模幂运算数字
难度评级:1510
小提示:

十位数字由 666mod1006^{6^6} \bmod 100 决定。

The tens digit is determined by 666mod1006^{6^6} \bmod 100

大提示:

n2n \ge 2 时,6nmod1006^n \bmod 100 以周期 55 循环;把指数 666^655 取模。

For n2,n \ge 2, 6nmod1006^n \bmod 100 cycles with period 5;5; reduce the exponent 666^6 modulo 55

解答:

先算得 66=466566^6 = 46656。当 n2n \ge 2 时,6n6^n 的末两位以周期 55 循环:36,16,96,76,5636, 16, 96, 76, 56。因为 466561(mod5)46656 \equiv 1 \pmod 5,所以 6466566^{46656} 的末两位是 5656,十位数字为 55

所以正确答案是 C

Here 66=46656.6^6 = 46656. For n2,n \ge 2, the last two digits of 6n6^n cycle with period 55 through 36,16,96,76,56.36, 16, 96, 76, 56. Since 466561(mod5),46656 \equiv 1 \pmod 5, 6466566^{46656} ends in 56,56, so the tens digit is 5.5.

Thus, the correct answer is C.

10.

一个 30-60-9030\text{-}60\text{-}90 直角三角形斜边上的高,被到最短边的中线分成长度为 x<yx \lt y 的两段。xx+y\dfrac{x}{x+y} 是多少?

The altitude to the hypotenuse of a 30-60-9030\text{-}60\text{-}90 right triangle is divided into two segments of lengths x<yx \lt y by the median to the shortest side of the triangle. What is the ratio xx+y?\dfrac{x}{x+y}?

37\dfrac{3}{7}

34\dfrac{\sqrt{3}}{4}

49\dfrac{4}{9}

511\dfrac{5}{11}

4315\dfrac{4\sqrt{3}}{15}

答案:A
难度评级:1580
小提示:

把直角放在原点,两条直角边沿坐标轴,然后给每个关键点设坐标。

Place the right angle at the origin with the legs along the axes and coordinatize every point

大提示:

求到最短边的中线与斜边上的高的交点,再看这个交点如何分割高。

Find where the median to the shortest side crosses the altitude to the hypotenuse, then split the altitude at that point

解答:

C=(0,0)C = (0,0)A=(3,0)A = (\sqrt{3}, 0)B=(0,1)B = (0, 1),则 ABAB 是斜边,BCBC 是最短边。从 CCABAB 的高交点为 H=(34,34)H = \left(\tfrac{\sqrt{3}}{4}, \tfrac{3}{4}\right)。从 AA 到最短边中点 M=(0,12)M = \left(0, \tfrac{1}{2}\right) 的中线与高交于 P=(37,37)P = \left(\tfrac{\sqrt{3}}{7}, \tfrac{3}{7}\right)。于是 CP=237=4314CP = \tfrac{2\sqrt{3}}{7} = \tfrac{4\sqrt{3}}{14}PH=3314PH = \tfrac{3\sqrt{3}}{14},所以 x=3314x = \tfrac{3\sqrt{3}}{14}xx+y=37\dfrac{x}{x+y} = \dfrac{3}{7}

所以正确答案是 A

Take C=(0,0),C = (0,0), A=(3,0),A = (\sqrt{3}, 0), B=(0,1),B = (0, 1), so ABAB is the hypotenuse and BCBC is the shortest side. The altitude from CC meets ABAB at H=(34,34).H = \left(\tfrac{\sqrt{3}}{4}, \tfrac{3}{4}\right). The median from AA to M=(0,12)M = \left(0, \tfrac{1}{2}\right) crosses the altitude at P=(37,37).P = \left(\tfrac{\sqrt{3}}{7}, \tfrac{3}{7}\right). This splits the altitude into CP=237=4314CP = \tfrac{2\sqrt{3}}{7} = \tfrac{4\sqrt{3}}{14} and PH=3314,PH = \tfrac{3\sqrt{3}}{14}, so x=3314x = \tfrac{3\sqrt{3}}{14} and xx+y=37.\dfrac{x}{x+y} = \dfrac{3}{7}.

Thus, the correct answer is A.

11.

九名运动员参加篮球队选拔,且没有两人身高相同。他们依次从一个袋子中随机抽取腕带,不放回;袋中有 33 条蓝色、33 条红色、33 条绿色腕带。他们被分成蓝组、红组和绿组。每组最高的成员被指定为该组队长。三名队长正好是最高的三名运动员的概率是多少?

Nine athletes, no two of whom are the same height, try out for the basketball team. One at a time, they draw a wristband at random, without replacement, from a bag containing 33 blue bands, 33 red bands, and 33 green bands. They are divided into a blue group, a red group, and a green group. The tallest member of each group is named the group captain. What is the probability that the group captains are the three tallest athletes?

29\dfrac{2}{9}

27\dfrac{2}{7}

928\dfrac{9}{28}

13\dfrac{1}{3}

38\dfrac{3}{8}

答案:C
难度评级:1590
小提示:

队长是最高的三人,当且仅当这三人分到三个不同的组。

The captains are the three tallest exactly when the three tallest land in three different groups

大提示:

依次放置前三高的人;每个人都必须避开已经用过的组,而剩余位置数也在减少。

Place the tallest three one at a time; each must avoid the groups already used, whose slots shrink the pool

解答:

每组有 33 个位置。最高的三名运动员正好成为队长,当且仅当他们落在三个不同的组中。将三人依次放入 99 个位置,第二人在剩下的 88 个位置中有 66 个可选,第三人在剩下的 77 个位置中有 33 个可选。因此概率为 6837=928\dfrac{6}{8} \cdot \dfrac{3}{7} = \dfrac{9}{28}

所以正确答案是 C

Each group has 33 slots. The three tallest athletes are the captains precisely when they fall into three different groups. Placing them one at a time into the 99 slots, the second must avoid the first’s group (66 of the remaining 88 slots) and the third must avoid both used groups (33 of the remaining 77 slots). The probability is 6837=928.\dfrac{6}{8} \cdot \dfrac{3}{7} = \dfrac{9}{28}.

Thus, the correct answer is C.

12.

下图显示了一辆大型公交车驾驶员一侧的雨刷。

雨刷臂 AB\overline{AB} 绕点 AA 来回转动,扫过 6060^\circ 的弧,并且关于过 AA 的竖直线对称。雨刷片 CD\overline{CD} 在其中点处连到 BB,并且在雨刷臂运动时始终保持竖直。雨刷臂长 33 英尺,雨刷片高 3.53.5 英尺。雨刷清洁的挡风玻璃面积是多少平方英尺?答案四舍五入到百分位。(假设挡风玻璃是平的竖直平面。)

The windshield wiper on the driver’s side of a large bus is depicted below.

Arm AB\overline{AB} pivots back and forth around point A,A, sweeping out an arc of 60,60^\circ, symmetric about the vertical line through A.A. The wiper blade CD\overline{CD} is attached to BB at its midpoint and stays vertical as the arm moves. The arm is 33 feet long, and the wiper blade is 3.53.5 feet tall. What is the area of the windshield cleaned by the wiper, in square feet, to the nearest hundredth? (Assume that the windshield is a flat vertical surface.)

9.689.68

10.1410.14

10.5010.50

11.3211.32

12.0012.00

答案:C
知识点:面积
难度评级:1690
小提示:

雨刷臂转动时,BB 走过半径为 33 的圆弧;雨刷片始终是以 BB 为中点、高为 3.53.5 的竖直线段。

As the arm turns, BB traces an arc of radius 3;3; the blade is always a vertical segment of height 3.53.5 centered at BB

大提示:

每条竖直线与清洁区域的交集长度恒为 3.53.5,所以面积等于这个高度乘以扫过的水平宽度。

Each vertical line meets the cleaned region in a segment of constant height 3.5,3.5, so the area is that height times the horizontal width swept

解答:

AA 放在原点。则 B=(3sinθ,3cosθ)B = (3\sin\theta, 3\cos\theta),其中 θ[30,30]\theta \in [-30^\circ, 30^\circ],所以 BB 的水平坐标范围是 [1.5,1.5][-1.5, 1.5],宽度为 33。每个水平位置都有一条高度为 3.53.5 的竖直雨刷片经过,所以由卡瓦列里原理,清洁面积为 3.5×3=10.53.5 \times 3 = 10.5 平方英尺。

所以正确答案是 C

Put AA at the origin. Then B=(3sinθ,3cosθ)B = (3\sin\theta, 3\cos\theta) for θ[30,30],\theta \in [-30^\circ, 30^\circ], so the horizontal coordinate of BB ranges over [1.5,1.5],[-1.5, 1.5], a width of 3.3. At each horizontal position exactly one vertical blade of height 3.53.5 passes through, so by Cavalieri’s principle the cleaned area is 3.5×3=10.53.5 \times 3 = 10.5 square feet.

Thus, the correct answer is C.

13.

一个圆被分成 66 个大小不同的扇形。接着把其中 22 个扇形涂红、22 个涂绿、22 个涂蓝,并要求相邻的两个扇形颜色不同。下图展示了一种涂色方式。

一共有多少种不同的涂色方式?

A circle has been divided into 66 sectors of different sizes. Then 22 of the sectors are painted red, 22 painted green, and 22 painted blue so that no two neighboring sectors are painted the same color. One such coloring is shown below.

How many different colorings are possible?

1212

1616

1818

2424

2828

答案:D
知识点:图论乘法原理
难度评级:1660
小提示:

同色扇形不能相邻,所以每种颜色的两个扇形必须形成一对不相邻的位置。

Because same-colored sectors cannot touch, the two sectors of each color form a non-adjacent pair

大提示:

先数把 66 个扇形分成三对不相邻扇形的方法,再把三种颜色分配给这些对。

Count the ways to split the 66 sectors into three non-adjacent pairs, then assign the three colors to the pairs

解答:

每种颜色的两个扇形必须不相邻,所以一种涂色方案就是将 66 个环形排列的扇形分成三对不相邻的位置,再为三对分配颜色。不相邻的位置对应于 66 环的补图,该补图是三棱柱图,有 44 个完美匹配。再用 3!3! 种方式将三种颜色分配给三对,共有 4×6=244 \times 6 = 24 种涂色方案。

所以正确答案是 D

The two sectors of each color must be a non-adjacent pair, so a coloring is a way to split the 66 cyclic sectors into three non-adjacent pairs together with an assignment of the three colors. The non-adjacent pairs are the edges of the complement of the 66-cycle, the triangular prism, which has 44 perfect matchings. Assigning the three colors in 3!3! ways gives 4×6=244 \times 6 = 24 colorings.

Thus, the correct answer is D.

14.

考虑一个由 nn 个正整数组成的递减序列 x1>x2>>xnx_1 \gt x_2 \gt \cdots \gt x_n,满足以下两个条件:

• 序列前 33 项的平均数(算术平均值)是 20252025

• 对所有满足 4kn4 \le k \le n 的整数,序列前 kk 项的平均数比前 k1k-1 项的平均数小 11

nn 的最大可能值是多少?

Consider a decreasing sequence of nn positive integers x1>x2>>xnx_1 \gt x_2 \gt \cdots \gt x_n that satisfies the following two conditions:

• The average (arithmetic mean) of the first 33 terms in the sequence is 2025.2025.

• For all 4kn,4 \le k \le n, the average of the first kk terms in the sequence is 11 less than the average of the first k1k-1 terms in the sequence.

What is the greatest possible value of n?n?

10131013

10141014

10161016

20162016

20252025

答案:B
难度评级:1730
小提示:

AkA_k 为前 kk 项的平均数;第二个条件给出 Ak=2028kA_k = 2028 - k,其中 k3k \ge 3

Let AkA_k be the average of the first kk terms; the second condition gives Ak=2028kA_k = 2028 - k for k3k \ge 3

大提示:

Sk=kAkS_k = k A_k 求出 xk=20292kx_k = 2029 - 2k,其中 k4k \ge 4,再要求每一项都为正数。

From Sk=kAkS_k = k A_k recover xk=20292kx_k = 2029 - 2k for k4,k \ge 4, then require every term to stay positive

解答:

k3k \ge 3 时,前 kk 项的平均数为 Ak=2028kA_k = 2028 - k,所以部分和为 Sk=k(2028k)S_k = k(2028 - k)。当 k4k \ge 4 时,xk=SkSk1=20292kx_k = S_k - S_{k-1} = 2029 - 2k,它为正数当且仅当 k1014k \le 1014。取合适的开头,例如 x1,x2,x3=2030,2023,2022x_1, x_2, x_3 = 2030, 2023, 2022,可使整个序列严格递减,所以 nn 的最大可能值为 10141014

所以正确答案是 B

The average of the first kk terms is Ak=2028kA_k = 2028 - k for k3,k \ge 3, so the partial sum is Sk=k(2028k).S_k = k(2028 - k). For k4,k \ge 4, xk=SkSk1=20292k,x_k = S_k - S_{k-1} = 2029 - 2k, which is positive exactly when k1014.k \le 1014. A valid start such as x1,x2,x3=2030,2023,2022x_1, x_2, x_3 = 2030, 2023, 2022 keeps the whole sequence strictly decreasing, so the greatest possible nn is 1014.1014.

Thus, the correct answer is B.

15.

一个容器底部是 1×11 \times 1 的正方形,顶部开口是 3×33 \times 3 的正方形,四个侧面是全等的梯形,如图所示。从空容器开始,一根以恒定速率出水的水管用 3535 分钟把容器装到梯形侧面的中线高度。

还需要多少分钟才能把容器剩余部分装满?

A container has a 1×11 \times 1 square bottom, a 3×33 \times 3 open square top, and four congruent trapezoidal sides, as shown. Starting when the container is empty, a hose that runs water at a constant rate takes 3535 minutes to fill the container up to the midline of the trapezoids.

How many more minutes will it take to fill the remainder of the container?

7070

8585

9090

9595

105105

答案:D
难度评级:1800
小提示:

在高度比例为 tt 处,水平截面是边长 1+2t1 + 2t 的正方形,所以面积为 (1+2t)2(1 + 2t)^2

At height fraction tt the cross-section is a square of side 1+2t,1 + 2t, so its area is (1+2t)2(1 + 2t)^2

大提示:

比较到中线(t=12t = \tfrac{1}{2})的体积与总体积;装水时间与体积成正比。

Compare the volume up to the midline (t=12t = \tfrac{1}{2}) with the total volume; fill time is proportional to volume

解答:

在高度比例为 tt 处,水平截面正方形的边长为 1+2t1 + 2t,所以装到高度 tt 的体积为 0t(1+2u)2du\int_0^t (1 + 2u)^2\,du。装到中线 (t=12)\left(t = \tfrac{1}{2}\right) 时,这个体积为 76\tfrac{7}{6},而总体积为 133\tfrac{13}{3}。剩余体积为 13376=196\tfrac{13}{3} - \tfrac{7}{6} = \tfrac{19}{6},是前一部分的 197\tfrac{19}{7} 倍。因此装满剩余部分还需 35197=9535 \cdot \tfrac{19}{7} = 95 分钟。

所以正确答案是 D

At height fraction tt the square cross-section has side 1+2t,1 + 2t, so the volume filled up to height tt is 0t(1+2u)2du.\int_0^t (1 + 2u)^2\,du. Up to the midline (t=12)\left(t = \tfrac{1}{2}\right) this is 76,\tfrac{7}{6}, and the full volume is 133.\tfrac{13}{3}. The remaining volume is 13376=196,\tfrac{13}{3} - \tfrac{7}{6} = \tfrac{19}{6}, which is 197\tfrac{19}{7} times the first part. So the remainder takes 35197=9535 \cdot \tfrac{19}{7} = 95 more minutes.

Thus, the correct answer is D.

16.

一个指针钟从午夜开始走了 20252025 分钟后停止。停止时,时针和分针之间的锐角的正切值是多少?

An analog clock starts at midnight and runs for 20252025 minutes before stopping. What is the tangent of the acute angle between the hour hand and the minute hand when the clock stops?

00

21\sqrt{2} - 1

222 - \sqrt{2}

22\dfrac{\sqrt{2}}{2}

323 - \sqrt{2}

答案:B
难度评级:1840
小提示:

20252025 分钟按 1212 小时取余,找出钟面显示的时间。

Reduce 20252025 minutes modulo 1212 hours to find where the hands point

大提示:

分别求时针和分针的角度,取锐角差,再计算 tan22.5\tan 22.5^\circ

Find each hand’s angle, take the acute difference, then evaluate tan22.5\tan 22.5^\circ

解答:

20252025 分钟是 3333 小时 4545 分钟,按 1212 小时取余后为 9:459{:}45。分针指向 270270^\circ,时针指向 9.75×30=292.59.75 \times 30^\circ = 292.5^\circ,所以两针之间的锐角是 22.522.5^\circ。由半角值,tan22.5=21\tan 22.5^\circ = \sqrt{2} - 1

所以正确答案是 B

20252025 minutes is 3333 hours 4545 minutes, which modulo 1212 hours reads 9:45.9{:}45. The minute hand points at 270270^\circ and the hour hand at 9.75×30=292.5,9.75 \times 30^\circ = 292.5^\circ, so the acute angle between them is 22.5.22.5^\circ. Using the half-angle value, tan22.5=21.\tan 22.5^\circ = \sqrt{2} - 1.

Thus, the correct answer is B.

17.

一个 3×33 \times 3 方格中的 99 个小正方形要被涂成红、蓝、黄三色,要求每个红色小方格至少与一个蓝色小方格共边,每个蓝色小方格至少与一个黄色小方格共边,每个黄色小方格至少与一个红色小方格共边。可以通过旋转和/或反射互相得到的涂色视为相同。共有多少种不同的涂色?

Each of the 99 squares in a 3×33 \times 3 grid is to be colored red, blue, or yellow in such a way that each red square shares an edge with at least one blue square, each blue square shares an edge with at least one yellow square, and each yellow square shares an edge with at least one red square. Colorings that can be obtained from one another by rotations and/or reflections are to be considered the same. How many different colorings are possible?

33

99

1212

1818

2727

答案:C
难度评级:1980
小提示:

每种颜色都必须出现,而且红 \to\to\to 红的循环条件会强烈限制布局。

Every color must appear, and the cyclic conditions red \to blue \to yellow \to red tightly constrain the layout

大提示:

先数固定带标号的方格上所有合法涂色,再用 Burnside 引理按 88 个旋转和反射对称化简。

Count all valid colorings of the fixed (labeled) grid, then reduce by the 88 rotations and reflections using Burnside’s lemma

解答:

先在方格位置带标号的情形下数涂色数。依次检查 2727 种可能的行,一旦某个方格的邻格都已确定却缺少所需的下一种颜色就立即舍弃该行,这样按红、蓝、黄方格的个数可得如下完整计数:(#R,#B,#Y)合法涂色数(2,4,3)16(3,2,4)16(3,3,3)36(4,3,2)16 \begin{array}{c|c} (\#R,\#B,\#Y)&\text{合法涂色数}\\ \hline (2,4,3)&16\\ (3,2,4)&16\\ (3,3,3)&36\\ (4,3,2)&16 \end{array} 因此恒等对称固定了 16+16+36+16=8416+16+36+16=84 种涂色。

对于其余的对称,被固定的涂色数为:每个非恒等旋转 00 种,关于水平轴或竖直轴的每个反射 66 种,每个对角线反射 00 种。(对于关于轴的反射,直接检查三个回文行即可得到这 66 种可能。)因此由 Burnside 引理得 84+268=12 \frac{84+2\cdot6}{8}=12\text{。}

因此,正确答案是 C

First count colorings of the grid with its positions labeled. Checking the 2727 possible rows in succession and rejecting a row as soon as a square whose neighbors are now known lacks its required next color gives the following complete count by the numbers of red, blue, and yellow squares: (#R,#B,#Y)valid colorings(2,4,3)16(3,2,4)16(3,3,3)36(4,3,2)16 \begin{array}{c|c} (\#R,\#B,\#Y)&\text{valid colorings}\\ \hline (2,4,3)&16\\ (3,2,4)&16\\ (3,3,3)&36\\ (4,3,2)&16 \end{array} Thus the identity symmetry fixes 16+16+36+16=8416+16+36+16=84 colorings.

For the other symmetries, the fixed-coloring counts are 00 for each nontrivial rotation, 66 for each reflection across a horizontal or vertical axis, and 00 for each diagonal reflection. (For an axis reflection, a direct check of the three palindromic rows gives the 66 possibilities.) Therefore Burnside’s lemma gives 84+268=12. \frac{84+2\cdot6}{8}=12.

Thus, the correct answer is C.

18.

Awnik 反复玩一个获胜概率为 13\dfrac{1}{3} 的游戏。各局结果相互独立。直到他至少赢过一次且输过一次为止,他所玩的局数的期望值是多少?

Awnik repeatedly plays a game that has a probability of winning of 13.\dfrac{1}{3}. The outcomes of the games are independent. What is the expected value of the number of games he will play until he has both won and lost at least once?

52\dfrac{5}{2}

33

165\dfrac{16}{5}

72\dfrac{7}{2}

154\dfrac{15}{4}

答案:D
难度评级:1770
小提示:

第一局后已经出现了一种结果;之后只需要等待相反的结果。

After the first game you already have one outcome; you then wait only for the opposite outcome

大提示:

等待概率为 pp 的结果首次出现的期望次数是 1p\dfrac{1}{p};按第一局是赢还是输分类。

The expected number of games to get an outcome of probability pp is 1p;\dfrac{1}{p}; condition on whether the first game is a win or a loss

解答:

第一局会产生一种结果。如果第一局赢了(概率 13\tfrac{1}{3}),则等待一次失败的期望局数为 123=32\tfrac{1}{\frac{2}{3}} = \tfrac{3}{2};如果第一局输了(概率 23\tfrac{2}{3}),则等待一次获胜的期望局数为 113=3\tfrac{1}{\frac{1}{3}} = 3。所以总期望为 1+1332+233=1+12+21 + \tfrac{1}{3}\cdot\tfrac{3}{2} + \tfrac{2}{3}\cdot 3 = 1 + \tfrac{1}{2} + 2 =72= \tfrac{7}{2}

所以正确答案是 D

The first game produces one outcome. If it was a win (probability 13\tfrac{1}{3}), the expected wait for a loss is 123=32;\tfrac{1}{\frac{2}{3}} = \tfrac{3}{2}; if it was a loss (probability 23\tfrac{2}{3}), the expected wait for a win is 113=3.\tfrac{1}{\frac{1}{3}} = 3. So the expected total is 1+1332+233=1+12+21 + \tfrac{1}{3}\cdot\tfrac{3}{2} + \tfrac{2}{3}\cdot 3 = 1 + \tfrac{1}{2} + 2 =72.= \tfrac{7}{2}.

Thus, the correct answer is D.

19.

一个由小正方形组成的矩形网格有 141141 行和 9191 列。每个小正方形里有放两个数字的空间。Horace 和 Vera 都把从 11141×91=12,831141 \times 91 = 12{,}831 的数字填入网格。Horace 按行填写:他把 119191 依次从左到右填入第 11 行,把 9292182182 依次从左到右填入第 22 行,并如此继续到第 141141 行。Vera 按列填写:她把 11141141 依次从上到下填入第 11 列,再把 142142282282 依次从上到下填入第 22 列,并如此继续到第 9191 列。有多少个小正方形中两人写下了相同的数字?

A rectangular grid of squares has 141141 rows and 9191 columns. Each square has room for two numbers. Horace and Vera each fill in the grid by putting the numbers from 11 through 141×91=12,831141 \times 91 = 12{,}831 into the squares. Horace fills the grid horizontally: he puts 11 through 9191 in order from left to right into row 1,1, puts 9292 through 182182 into row 22 in order from left to right, and continues similarly through row 141.141. Vera fills the grid vertically: she puts 11 through 141141 in order from top to bottom into column 1,1, then 142142 through 282282 into column 22 in order from top to bottom, and continues similarly through column 91.91. How many squares get two copies of the same number?

77

1010

1111

1212

1919

答案:C
难度评级:2040
小提示:

分别写出第 rr 行第 cc 列中 Horace 和 Vera 填入的数字,并将结果表示为 rrcc 的公式

Write the Horace-number and the Vera-number of the square in row r,r, column cc as formulas in rr and cc

大提示:

令两式相等可得 9r=14c59r = 14c - 5;找出哪些 cc 会使 rr 是指定范围内的整数

Setting them equal gives 9r=14c5;9r = 14c - 5; find which cc make rr an integer in range

解答:

在第 rr 行第 cc 列,Horace 写的是 (r1)91+c(r-1)\cdot 91 + c,Vera 写的是 (c1)141+r(c-1)\cdot 141 + r。令二者相等,得 90r140c=5090r - 140c = -50,即 9r=14c59r = 14c - 5。这要求 c1(mod9)c \equiv 1 \pmod 9,所以 c=1,10,19,,91c = 1, 10, 19, \ldots, 91,共有 1111 个值;每个都给出合法的 rr,且在 11141141 之间。因此有 1111 个小正方形匹配。

所以正确答案是 C

In row r,r, column c,c, Horace writes (r1)91+c(r-1)\cdot 91 + c and Vera writes (c1)141+r.(c-1)\cdot 141 + r. Setting these equal gives 90r140c=50,90r - 140c = -50, i.e. 9r=14c5.9r = 14c - 5. This requires c1(mod9),c \equiv 1 \pmod 9, so c=1,10,19,,91c = 1, 10, 19, \ldots, 91 — that is 1111 values, and each yields a valid rr between 11 and 141.141. So 1111 squares match.

Thus, the correct answer is C.

20.

一只青蛙按如下规则在数轴上跳跃。

• 它从 00 开始。

• 如果它在 00,那么它移动到 11 的概率为 12\dfrac{1}{2},并以概率 12\dfrac{1}{2} 消失。

• 对于 n=1n = 12233,如果它在 nn,那么它移动到 n+1n+1 的概率为 14\dfrac{1}{4},移动到 n1n-1 的概率为 14\dfrac{1}{4},并以概率 12\dfrac{1}{2} 消失。

青蛙到达 44 的概率是多少?

A frog hops along the number line according to the following rules.

• It starts at 0.0.

• If it is at 0,0, then it moves to 11 with probability 12\dfrac{1}{2} and it disappears with probability 12.\dfrac{1}{2}.

• For n=1,n = 1, 2,2, or 3,3, if it is at n,n, then it moves to n+1n+1 with probability 14,\dfrac{1}{4}, it moves to n1n-1 with probability 14,\dfrac{1}{4}, and it disappears with probability 12.\dfrac{1}{2}.

What is the probability that the frog reaches 4?4?

1101\dfrac{1}{101}

1100\dfrac{1}{100}

199\dfrac{1}{99}

198\dfrac{1}{98}

197\dfrac{1}{97}

答案:E
难度评级:2110
小提示:

f(n)f(n) 为从 nn 出发最终到达 44 的概率;对每个状态写出第一步方程

Let f(n)f(n) be the probability of eventually reaching 44 starting from n;n; write a first-step equation at each state

大提示:

f(4)=1f(4) = 1,并把青蛙消失后的值看作 00,解这个线性方程组。

Solve the linear system with f(4)=1f(4) = 1 and value 00 whenever the frog disappears

解答:

f(n)f(n) 为从 nn 出发最终到达 44 的概率。则 f(0)=12f(1)f(0) = \tfrac{1}{2} f(1),且对 n=1,2,3n = 1, 2, 3f(n)=14f(n+1)+14f(n1)f(n) = \tfrac{1}{4} f(n+1) + \tfrac{1}{4} f(n-1),并且 f(4)=1f(4) = 1。依次求解得 f(2)=72f(1)f(2) = \tfrac{7}{2} f(1)f(3)=13f(1)f(3) = 13 f(1);再由 413f(1)=1+72f(1)4 \cdot 13 f(1) = 1 + \tfrac{7}{2} f(1)f(1)=297f(1) = \tfrac{2}{97},从而 f(0)=197f(0) = \tfrac{1}{97}

所以正确答案是 E

Let f(n)f(n) be the probability of reaching 44 from n.n. Then f(0)=12f(1),f(0) = \tfrac{1}{2} f(1), and for n=1,2,3,n = 1, 2, 3, f(n)=14f(n+1)+14f(n1),f(n) = \tfrac{1}{4} f(n+1) + \tfrac{1}{4} f(n-1), with f(4)=1.f(4) = 1. Solving upward gives f(2)=72f(1)f(2) = \tfrac{7}{2} f(1) and f(3)=13f(1);f(3) = 13 f(1); then 413f(1)=1+72f(1)4 \cdot 13 f(1) = 1 + \tfrac{7}{2} f(1) yields f(1)=297,f(1) = \tfrac{2}{97}, so f(0)=197.f(0) = \tfrac{1}{97}.

Thus, the correct answer is E.

21.

两个不全等三角形面积相同。每个三角形都有两条边长为 8899,并且第三边的长度是整数。求这两个第三边长度的和。

Two non-congruent triangles have the same area. Each triangle has sides of length 88 and 9,9, and the third side of each triangle has integer length. What is the sum of the lengths of the third sides?

2020

2222

2424

2626

2828

答案:C
难度评级:2170
小提示:

若边长 8899 的夹角为 θ\theta,面积为 36sinθ36\sin\theta,所以相同面积来自 θ\theta180θ180^\circ - \theta

With sides 88 and 99 and included angle θ,\theta, the area is 36sinθ,36\sin\theta, so equal areas come from θ\theta and 180θ180^\circ - \theta

大提示:

由余弦定理,两个第三边满足 t2=145144cosθt^2 = 145 \mp 144\cos\theta,所以 t12+t22=290t_1^2 + t_2^2 = 290

By the law of cosines the third sides satisfy t2=145144cosθ,t^2 = 145 \mp 144\cos\theta, so t12+t22=290t_1^2 + t_2^2 = 290

解答:

夹角为 θ\theta 时,面积为 36sinθ36\sin\theta,因此两个等面积三角形的夹角为 θ\theta180θ180^\circ - \theta,余弦分别为 ±cosθ\pm\cos\theta。由余弦定理,第三边满足 t2=145144cosθt^2 = 145 \mp 144\cos\theta,因此 t12+t22=290t_1^2 + t_2^2 = 290。因为 2902(mod8)290\equiv2\pmod8,所以两条整数边都必须是奇数。在三角形不等式给出的范围 1<t<171\lt t\lt17 内检查各个奇数的平方,只剩下 112+132=121+169=29011^2+13^2=121+169=290。因此这两条第三边的长度之和为 2424

所以正确答案是 C

The area with included angle θ\theta is 36sinθ,36\sin\theta, so two triangles of equal area use angles θ\theta and 180θ,180^\circ - \theta, with cosines ±cosθ.\pm\cos\theta. By the law of cosines the third sides satisfy t2=145144cosθ,t^2 = 145 \mp 144\cos\theta, hence t12+t22=290.t_1^2 + t_2^2 = 290. Since 2902(mod8),290\equiv2\pmod8, both integer sides must be odd. Checking the odd squares in the triangle-inequality range 1<t<171\lt t\lt17 leaves only 112+132=121+169=290.11^2+13^2=121+169=290. Therefore the sum is 24.24.

Thus, the correct answer is C.

22.

在复平面中,复数 zz 满足 4z2=1|4z - 2| = 1,一个三角形的三个顶点为 2z2z(1+i)z(1+i)z(1i)z(1-i)z。这个三角形的最大可能面积是多少?

What is the greatest possible area of the triangle in the complex plane with vertices 2z,2z, (1+i)z,(1+i)z, and (1i)z,(1-i)z, where zz is a complex number satisfying 4z2=1?|4z - 2| = 1?

14\dfrac{1}{4}

12\dfrac{1}{2}

916\dfrac{9}{16}

34\dfrac{3}{4}

11

答案:C
难度评级:2270
小提示:

这些顶点是将固定点 2,1+i,1i2, 1+i, 1-i 同时乘以 zz 得到的,所以三角形按 z|z| 的比例缩放。

The vertices are zz times the fixed points 2,1+i,1i,2, 1+i, 1-i, so the triangle is that fixed triangle scaled by z|z|

大提示:

面积等于固定三角形的面积乘以 z2|z|^2;条件 4z2=1|4z - 2| = 1 表示一个圆,所以要在圆上使 z|z| 最大。

Its area is z2|z|^2 times a fixed area; the condition 4z2=1|4z - 2| = 1 is a circle, so maximize z|z| on it

解答:

三个顶点是 z2z \cdot 2z(1+i)z(1+i)z(1i)z(1-i),所以该三角形是顶点为 2,1+i,1i2, 1+i, 1-i 的面积为 11 的固定三角形按比例 z|z| 缩放得到的,面积为 z2|z|^2。条件 4z2=1|4z - 2| = 1 等价于 z12=14\left|z - \tfrac{1}{2}\right| = \tfrac{1}{4},所以 z|z| 最大为 12+14=34\tfrac{1}{2} + \tfrac{1}{4} = \tfrac{3}{4}。最大面积为 (34)2=916\left(\tfrac{3}{4}\right)^2 = \tfrac{9}{16}

所以正确答案是 C

The vertices are z2,z \cdot 2, z(1+i),z(1+i), and z(1i),z(1-i), so the triangle is the fixed triangle with vertices 2,1+i,1i2, 1+i, 1-i — which has area 11 — scaled by z,|z|, giving area z2.|z|^2. The condition 4z2=1|4z - 2| = 1 is the circle z12=14,\left|z - \tfrac{1}{2}\right| = \tfrac{1}{4}, on which z|z| is at most 12+14=34.\tfrac{1}{2} + \tfrac{1}{4} = \tfrac{3}{4}. So the greatest area is (34)2=916.\left(\tfrac{3}{4}\right)^2 = \tfrac{9}{16}.

Thus, the correct answer is C.

23.

SS 是所有整数 z>1z \gt 1 组成的集合,且这些整数满足:对于所有满足 x<y<zx \lt y \lt z 的非负整数对 (x,y)(x, y)2025x2025x 除以 zz 的余数小于 2025y2025y 除以 zz 的余数。求 SS 中所有元素的和。

Let SS be the set of all integers z>1z \gt 1 such that for all pairs of nonnegative integers (x,y)(x, y) with x<y<z,x \lt y \lt z, the remainder when 2025x2025x is divided by zz is less than the remainder when 2025y2025y is divided by z.z. What is the sum of the elements of S?S?

30413041

35423542

37503750

40444044

43194319

答案:E
难度评级:2380
小提示:

条件表示映射 k2025kmodzk \mapsto 2025k \bmod z0,1,,z10, 1, \ldots, z-1 上严格递增。

The condition says the map k2025kmodzk \mapsto 2025k \bmod z is strictly increasing on 0,1,,z10, 1, \ldots, z-1

大提示:

00 开始的 0,1,,z10, 1, \ldots, z-1 的递增重排只能是自身,所以迫使 20251(modz)2025 \equiv 1 \pmod z

An increasing rearrangement of 0,1,,z10, 1, \ldots, z-1 starting at 00 must be the identity, forcing 20251(modz)2025 \equiv 1 \pmod z

解答:

条件要求 k2025kmodzk \mapsto 2025k \bmod z 在集合 {0,1,,z1}\{0, 1, \ldots, z-1\} 上严格递增。这些值都是模 zz 后落在 [0,z1][0, z-1] 中的不同数,所以递增列表只能是 0,1,,z10, 1, \ldots, z-1。因此 20251(modz)2025 \equiv 1 \pmod z,即 20242024zz 的倍数。由于 2024=2311232024 = 2^3 \cdot 11 \cdot 23,其所有正因数之和为 (1+2+4+8)(1+11)(1+23)(1+2+4+8)(1+11)(1+23) =151224= 15 \cdot 12 \cdot 24 =4320= 4320。排除 z=1z = 1 后,和为 43194319

所以正确答案是 E

The condition requires k2025kmodzk \mapsto 2025k \bmod z to be strictly increasing on {0,1,,z1}.\{0, 1, \ldots, z-1\}. A strictly increasing list of zz distinct values in [0,z1][0, z-1] must be 0,1,,z1,0, 1, \ldots, z-1, so 20251(modz),2025 \equiv 1 \pmod z, i.e. 20242024 is divisible by z.z. Since 2024=231123,2024 = 2^3 \cdot 11 \cdot 23, the sum of all its divisors is (1+2+4+8)(1+11)(1+23)(1+2+4+8)(1+11)(1+23) =151224= 15 \cdot 12 \cdot 24 =4320.= 4320. Excluding z=1z = 1 leaves 4319.4319.

Thus, the correct answer is E.

24.

有多少个实数满足方程 sin(20πx)=log20(x)\sin(20\pi x) = \log_{20}(x)

How many real numbers satisfy the equation sin(20πx)=log20(x)?\sin(20\pi x) = \log_{20}(x)?

199199

200200

398398

399399

400400

答案:D
难度评级:2520
小提示:

解必须满足 1log20x1-1 \le \log_{20} x \le 1,所以 xx 位于 [120,20]\left[\tfrac{1}{20}, 20\right]

A solution needs 1log20x1,-1 \le \log_{20} x \le 1, so xx lies in [120,20]\left[\tfrac{1}{20}, 20\right]

大提示:

sin(20πx)\sin(20\pi x) 的每个单调半波上,缓慢上升的对数曲线恰好相交一次;在两端仔细清点分支。

On each monotonic half-wave of sin(20πx)\sin(20\pi x) the slowly rising log crosses once; count the branches carefully at both ends

解答:

因为 sin(20πx)1|\sin(20\pi x)|\le1,每个解都位于 [120,20]\left[\tfrac1{20},20\right]。当 x<1x\lt1 时,对数为负,所以 [120,1]\left[\tfrac1{20},1\right] 中只有 1010 个负的正弦波瓣可能有解。每个波瓣在最低点两侧各有一个交点;在最后一个波瓣中,第二个交点就是端点 x=1x=1。因此这一部分贡献 2020 个解。

x>1x\gt1 时,只有正波瓣有贡献。这样的波瓣有 190190 个:对 0k1890\le k\le189,从 1+k101+\tfrac{k}{10}1+k10+1201+\tfrac{k}{10}+\tfrac1{20} 的每个区间中有一个。除第一个之外,每个波瓣都在最高点两侧各有一个交点。第一个波瓣只有一个新交点,因为其左端点是已经计数的解 x=1x=1。因此 x>1x\gt1 再贡献 1+2189=3791+2\cdot189=379 个解。

为完整起见,每个半波瓣上交点唯一,可以通过对两边之差求导来证明。在下降的正半波瓣上,它严格递减。在上升的正半波瓣上,其导数先增后减一次,所以差值只会从负变正一次。对 sin(20πx)+log20x-\sin(20\pi x)+\log_{20}x 使用同样的论证即可处理负波瓣。总数为 20+379=39920+379=399

因此,正确答案是 D

Since sin(20πx)1,|\sin(20\pi x)|\le1, every solution lies in [120,20].\left[\tfrac1{20},20\right]. For x<1x\lt1 the logarithm is negative, so only the 1010 negative sine lobes in [120,1]\left[\tfrac1{20},1\right] can contribute. Each has one crossing on each side of its minimum; on the last lobe, the second crossing is the endpoint x=1.x=1. Hence this part contributes 2020 solutions.

For x>1,x\gt1, only positive lobes contribute. There are 190190 of them: one in each interval from 1+k101+\tfrac{k}{10} to 1+k10+1201+\tfrac{k}{10}+\tfrac1{20} for 0k189.0\le k\le189. Every one after the first has one crossing on each side of its maximum. The first has only one new crossing because its left endpoint is the already-counted solution x=1.x=1. Thus x>1x\gt1 contributes 1+2189=3791+2\cdot189=379 more solutions.

For completeness, the claimed uniqueness on each half-lobe follows by differentiating the difference of the two sides. On a falling positive half-lobe it is strictly decreasing. On a rising positive half-lobe its derivative increases and then decreases once, so the difference crosses from negative to positive only once. Applying the same argument to sin(20πx)+log20x-\sin(20\pi x)+\log_{20}x handles a negative lobe. The total is 20+379=399.20+379=399.

Thus, the correct answer is D.

25.

三个同心圆的半径分别为 112233。一个边长为 ss 的等边三角形在每个圆上各有一个顶点。求 s2s^2

Three concentric circles have radii 1,1, 2,2, 3.3. An equilateral triangle with side length ss has one vertex on each circle. What is s2?s^2?

66

254\dfrac{25}{4}

132\dfrac{13}{2}

274\dfrac{27}{4}

77

答案:E
难度评级:2650
小提示:

若一点到边长为 aa 的等边三角形三个顶点的距离分别为 p,q,rp, q, r,则 p2,q2,r2,a2p^2, q^2, r^2, a^2 之间存在一个对称关系

For a point at distances p,q,rp, q, r from the vertices of an equilateral triangle of side a,a, there is a symmetric relation among p2,q2,r2,a2p^2, q^2, r^2, a^2

大提示:

使用 3(p4+q4+r4+a4)3(p^4 + q^4 + r^4 + a^4) =(p2+q2+r2+a2)2= (p^2 + q^2 + r^2 + a^2)^2,并代入 p,q,r=1,2,3p, q, r = 1, 2, 3

Use 3(p4+q4+r4+a4)3(p^4 + q^4 + r^4 + a^4) =(p2+q2+r2+a2)2= (p^2 + q^2 + r^2 + a^2)^2 with p,q,r=1,2,3p, q, r = 1, 2, 3

解答:

公共圆心到边长为 ss 的等边三角形三个顶点的距离为 1,2,31, 2, 3,因此有恒等式 3(1+16+81+s4)3(1 + 16 + 81 + s^4) =(1+4+9+s2)2= (1 + 4 + 9 + s^2)^2。化简得 2s428s2+98=02s^4 - 28s^2 + 98 = 0,即 (s27)2=0(s^2 - 7)^2 = 0,所以 s2=7s^2 = 7

所以正确答案是 E

For the common center at distances 1,2,31, 2, 3 from the vertices of an equilateral triangle of side s,s, the identity 3(1+16+81+s4)3(1 + 16 + 81 + s^4) =(1+4+9+s2)2= (1 + 4 + 9 + s^2)^2 holds. This simplifies to 2s428s2+98=0,2s^4 - 28s^2 + 98 = 0, i.e. (s27)2=0,(s^2 - 7)^2 = 0, so s2=7.s^2 = 7.

Thus, the correct answer is E.