2024 AMC 10B 真题

25 道题 · 75 分钟

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

或直接跳转到某一道题及其解答: 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

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

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

了解 LIVE课程

计时

1:15:00

1.

在一长队人中,从左边数第 10131013 个人同时也是从右边数第 10101010 个人。队伍中共有多少人?
In a long line of people arranged left to right, the 10131013th person from the left is also the 10101010th person from the right. How many people are in the line?
20212021
20222022
20232023
20242024
20252025
答案:B
知识点:基本计数区间内整数计数
小提示:
目标人物左边的人、右边的人,再加上这个人本身,组成整条队伍。
The people to the left of the target person and the people to the right, plus the person themself, make up the whole line
大提示:
左边有 10121012 人,右边有 10091009 人;再加上目标人物。
There are 10121012 people to the left and 10091009 to the right; add these to the target person
解答:
目标人物左边有 1013−1=10121013 - 1 = 1012 人,右边有 1010−1=10091010 - 1 = 1009 人。包括此人自己,总人数为 1012+1009+1=20221012 + 1009 + 1 = 2022。
所以正确答案是 B。
The target person has 1013−1=10121013 - 1 = 1012 people to the left and 1010−1=10091010 - 1 = 1009 people to the right. Including the person themself, the line has 1012+1009+1=20221012 + 1009 + 1 = 2022 people.
Thus, the correct answer is B.

2.

10!−7!⋅6!10! - 7! \cdot 6! 的值是多少?
What is 10!−7!⋅6!?10! - 7! \cdot 6!?
−120-120
00
120120
600600
720720
答案:B
知识点:阶乘
难度评级:1000
小提示:
写成 10!=10⋅9⋅8⋅7!10! = 10 \cdot 9 \cdot 8 \cdot 7!。
Write 10!=10⋅9⋅8⋅7!10! = 10 \cdot 9 \cdot 8 \cdot 7!
大提示:
注意 10⋅9⋅810 \cdot 9 \cdot 8 正好等于 6!6!。
Notice that 10⋅9⋅810 \cdot 9 \cdot 8 equals 6!6!
解答:
有 10!=10⋅9⋅8⋅7!=720⋅7!10! = 10 \cdot 9 \cdot 8 \cdot 7! = 720 \cdot 7!。而 720=6!720 = 6!,所以 10!=6!⋅7!=7!⋅6!10! = 6! \cdot 7! = 7! \cdot 6!。两项相同,因此 10!−7!⋅6!=010! - 7! \cdot 6! = 0。正确答案是 B。
Write 10!=10⋅9⋅8⋅7!=720⋅7!.10! = 10 \cdot 9 \cdot 8 \cdot 7! = 720 \cdot 7!. But 720=6!720 = 6! too, so 10!=6!⋅7!=7!⋅6!.10! = 6! \cdot 7! = 7! \cdot 6!. The two terms are the same. That makes 10!−7!⋅6!=0.10! - 7! \cdot 6! = 0. Therefore, the answer is B.

3.

对多少个整数 xx,有 ∣2x∣≤7π|2x| \le 7\pi?
For how many integer values of xx is ∣2x∣≤7π?|2x| \le 7\pi?
1616
1717
1919
2020
2121
答案:E
难度评级:1090
小提示:
改写为 ∣x∣≤7π2|x| \le \dfrac{7\pi}{2},并估算 7π2\dfrac{7\pi}{2} 的小数值。
Rewrite as ∣x∣≤7π2|x| \le \dfrac{7\pi}{2} and estimate 7π2\dfrac{7\pi}{2} as a decimal
大提示:
因为 7π2≈10.99\dfrac{7\pi}{2} \approx 10.99,所以只需数出从 −10-10 到 1010 的整数。
Since 7π2≈10.99,\dfrac{7\pi}{2} \approx 10.99, count the integers from −10-10 to 1010
解答:
不等式 ∣2x∣≤7π|2x| \le 7\pi 等价于 ∣x∣≤7π2≈10.99|x| \le \dfrac{7\pi}{2} \approx 10.99。满足条件的整数从 −10-10 到 1010,共有 10+10+1=2110 + 10 + 1 = 21 个。
所以正确答案是 E。
The inequality ∣2x∣≤7π|2x| \le 7\pi is equivalent to ∣x∣≤7π2≈10.99.|x| \le \dfrac{7\pi}{2} \approx 10.99. The integers satisfying this run from −10-10 to 10,10, which is 10+10+1=2110 + 10 + 1 = 21 values.
Thus, the correct answer is E.

4.

编号为 11、22、33、…\ldots 的球按下面的过程放入标号为 AA、BB、CC、DD 和 EE 的 55 个箱子。球 11 放入箱子 AA,球 22 和 33 放入箱子 BB。接下来的 33 个球放入箱子 CC,再接下来的 44 个放入箱子 DD,依此类推;把球放入箱子 EE 之后再循环回到箱子 AA。(例如,在这个过程的第 77 步,编号为 2222、2323、…\ldots、2828 的球放入箱子 BB。)球 20242024 放入哪个箱子?
Balls numbered 1,1, 2,2, 3,3, …\ldots are deposited in 55 bins, labeled A,A, B,B, C,C, D,D, and E,E, using the following procedure. Ball 11 is deposited in bin A,A, and balls 22 and 33 are deposited in bin B.B. The next 33 balls are deposited in bin C,C, the next 44 in bin D,D, and so on, cycling back to bin AA after balls are deposited in bin E.E. (For example, balls numbered 22,22, 23,23, …,\ldots, 2828 are deposited in bin BB at step 77 of this process.) In which bin is ball 20242024 deposited?
AA
BB
CC
DD
EE
答案:D
难度评级:1200
小提示:
第 kk 步恰好放入 kk 个球,所以 kk 步后共放入 k(k+1)2\dfrac{k(k+1)}{2} 个球。
At step k,k, exactly kk balls are deposited, so after kk steps a total of k(k+1)2\dfrac{k(k+1)}{2} balls have been placed
大提示:
找到包含球 20242024 的步骤,再注意第 kk 步使用循环 A,B,C,D,EA, B, C, D, E 中位置 (k−1) mod 5(k-1)\bmod 5 的箱。
Find the step containing ball 2024,2024, then note that step kk uses the bin at position (k−1) mod 5(k-1)\bmod 5 in the cycle A,B,C,D,EA, B, C, D, E
解答:
第 kk 步放入 kk 个球,所以第 kk 步后共放入 k(k+1)2\dfrac{k(k+1)}{2} 个球。又 63⋅642=2016\dfrac{63 \cdot 64}{2} = 2016 而 64⋅652=2080\dfrac{64 \cdot 65}{2} = 2080,所以球 20242024 在第 6464 步。
步骤按 A,B,C,D,EA, B, C, D, E 循环,所以第 kk 步使用位置 (k−1) mod 5(k-1) \bmod 5 的箱。这里 (64−1) mod 5=63 mod 5=3(64 - 1) \bmod 5 = 63 \bmod 5 = 3,即第四个箱 DD。
所以正确答案是 D。
Step kk deposits kk balls, so after step kk a total of k(k+1)2\dfrac{k(k+1)}{2} balls have been placed. Since 63⋅642=2016\dfrac{63 \cdot 64}{2} = 2016 and 64⋅652=2080,\dfrac{64 \cdot 65}{2} = 2080, ball 20242024 falls in step 64.64.
The steps cycle through the bins A,B,C,D,E,A, B, C, D, E, so step kk uses position (k−1) mod 5.(k-1) \bmod 5. Here (64−1) mod 5=63 mod 5=3,(64 - 1) \bmod 5 = 63 \bmod 5 = 3, which is the fourth bin, D.D.
Thus, the correct answer is D.

5.

在下面的式子中,Melanie 把一些加号改成了减号:
1+3+5+7+⋯+97+991 + 3 + 5 + 7 + \cdots + 97 + 99
新式子计算后的值是负数。她最少要把多少个加号改成减号?
In the following expression, Melanie changed some of the plus signs to minus signs:
1+3+5+7+⋯+97+991 + 3 + 5 + 7 + \cdots + 97 + 99
When the new expression was evaluated, it was negative. What is the least number of plus signs that Melanie could have changed to minus signs?
1414
1515
1616
1717
1818
答案:B
难度评级:1300
小提示:
原和为 1+3+⋯+99=502=25001 + 3 + \cdots + 99 = 50^2 = 2500;把值为 vv 的项翻成负号会让总和减少 2v2v。
The original sum is 1+3+⋯+99=502=2500;1 + 3 + \cdots + 99 = 50^2 = 2500; flipping a term of value vv lowers the total by 2v2v
大提示:
要使结果为负,被翻号的项之和必须超过 12501250;优先翻最大的奇数,最大 kk 项之和为 k(100−k)k(100-k)。
To go negative the flipped terms must total more than 1250;1250; flip the largest odd numbers first, where the largest kk of them sum to k(100−k)k(100-k)
解答:
原表达式是前 5050 个正奇数之和,等于 502=250050^2 = 2500。把值为 vv 的项从 ++ 改为 −-,总和会减少 2v2v,所以要使结果为负,翻号项的和必须大于 25002=1250\dfrac{2500}{2} = 1250。
为使项数尽量少,应从 99,97,95,…99, 97, 95, \ldots 开始翻号。最大的 kk 个奇数之和为 k(100−k)k(100 - k)。当 k=14k = 14 时,14⋅86=1204≤125014 \cdot 86 = 1204 \le 1250;当 k=15k = 15 时,15⋅85=1275>125015 \cdot 85 = 1275 \gt 1250。所以 1515 个足够,而 1414 个不够。
所以正确答案是 B。
The original expression sums the first 5050 odd numbers, giving 502=2500.50^2 = 2500. Changing a term of value vv from ++ to −- decreases the total by 2v,2v, so to make the result negative the flipped terms must total more than 25002=1250.\dfrac{2500}{2} = 1250.
To use as few terms as possible, flip the largest odd numbers 99,97,95,…99, 97, 95, \ldots The largest kk of them sum to k(100−k).k(100 - k). With k=14k = 14 this is 14⋅86=1204≤1250,14 \cdot 86 = 1204 \le 1250, but with k=15k = 15 it is 15⋅85=1275>1250.15 \cdot 85 = 1275 \gt 1250. So 1515 sign changes suffice and 1414 do not.
Thus, the correct answer is B.

6.

一个长方形的边长都是整数,面积为 20242024。它的周长最小可能是多少?
A rectangle has integer side lengths and an area of 2024.2024. What is the least possible perimeter of the rectangle?
160160
180180
222222
228228
390390
答案:B
难度评级:1200
小提示:
对固定面积,周长在两条边尽量接近时最小。
For a fixed area, the perimeter is smallest when the two sides are as close to equal as possible
大提示:
2024=23⋅11⋅232024 = 2^3 \cdot 11 \cdot 23;寻找接近 2024≈45\sqrt{2024} \approx 45 的因数对。
2024=23⋅11⋅23;2024 = 2^3 \cdot 11 \cdot 23; look for a factor pair near 2024≈45\sqrt{2024} \approx 45
解答:
若长和宽为 ℓ\ell 和 ww,周长为 2(ℓ+w)2(\ell + w),在 ℓw=2024\ell w = 2024 且两边尽量接近时最小。分解 2024=23⋅11⋅232024 = 2^3 \cdot 11 \cdot 23。最接近 2024≈45\sqrt{2024} \approx 45 的因数对是 44×4644 \times 46,周长为 2(44+46)=1802(44 + 46) = 180。因此正确答案是 B。
The perimeter 2(ℓ+w)2(\ell + w) with ℓw=2024\ell w = 2024 is smallest when ℓ\ell and ww are as close together as possible. Factor 2024=23⋅11⋅23.2024 = 2^3 \cdot 11 \cdot 23. The divisor pair nearest 2024≈45\sqrt{2024} \approx 45 is 44×46,44 \times 46, which gives perimeter 2(44+46)=180.2(44 + 46) = 180. Therefore, the answer is B.

7.

72024+72025+720267^{2024} + 7^{2025} + 7^{2026} 除以 1919 的余数是多少?
What is the remainder when 72024+72025+720267^{2024} + 7^{2025} + 7^{2026} is divided by 19?19?
00
11
77
1111
1818
答案:A
难度评级:1250
小提示:
提出公因子 720247^{2024}。
Factor out 720247^{2024}
大提示:
剩下的因子是 1+7+491 + 7 + 49;检查它与 1919 的关系。
The remaining factor is 1+7+49;1 + 7 + 49; check its relationship to 1919
解答:
提出公共幂:72024+72025+720267^{2024} + 7^{2025} + 7^{2026} =72024(1+7+49)= 7^{2024}(1 + 7 + 49) =72024⋅57= 7^{2024} \cdot 57。而 57=3⋅1957 = 3 \cdot 19,所以整个乘积是 1919 的倍数。余数为 00。因此正确答案是 A。
Pull out the common power: 72024+72025+720267^{2024} + 7^{2025} + 7^{2026} =72024(1+7+49)= 7^{2024}(1 + 7 + 49) =72024⋅57.= 7^{2024} \cdot 57. And 57=3⋅19,57 = 3 \cdot 19, so the product is a multiple of 19.19. The remainder is 0.0. Thus, A is the correct answer.

8.

令 NN 为 4242 的所有正整数因数的乘积。NN 的个位数字是多少?
Let NN be the product of all the positive integer divisors of 42.42. What is the units digit of N?N?
00
22
44
66
88
答案:D
难度评级:1310
小提示:
一个有 dd 个因数的数,其所有因数的乘积等于这个数的 d2\tfrac{d}{2} 次方。
A number with dd divisors has divisor product equal to itself raised to the d2\tfrac{d}{2} power
大提示:
42=2⋅3⋅742 = 2 \cdot 3 \cdot 7 有 88 个因数,所以 N=424N = 42^4;只需跟踪个位数字。
42=2⋅3⋅742 = 2 \cdot 3 \cdot 7 has 88 divisors, so N=424;N = 42^4; track only the units digit
解答:
因为 42=2⋅3⋅742 = 2 \cdot 3 \cdot 7 有 (1+1)3=8(1+1)^3 = 8 个因数,可以把每个因数和它的互补因数配对,所以 N=4282=424N = 42^{\frac{8}{2}} = 42^4。只看个位数字,24=162^4 = 16 的个位是 66,所以 42442^4 也是如此。因此正确答案是 D。
Since 42=2⋅3⋅742 = 2 \cdot 3 \cdot 7 has (1+1)3=8(1+1)^3 = 8 divisors, we can pair each divisor with its complement, so N=4282=424.N = 42^{\frac{8}{2}} = 42^4. Only the units digit matters, and 24=162^4 = 16 ends in 6,6, so 42442^4 does too. Therefore, the answer is D.

9.

实数 aa,bb 和 cc 的算术平均数为 00。a2a^2,b2b^2 和 c2c^2 的算术平均数为 1010。abab,acac 和 bcbc 的算术平均数是多少?
Real numbers a,a, b,b, and cc have arithmetic mean 0.0. The arithmetic mean of a2,a^2, b2,b^2, and c2c^2 is 10.10. What is the arithmetic mean of ab,ab, ac,ac, and bc?bc?
−5-5
−103-\dfrac{10}{3}
−109-\dfrac{10}{9}
00
109\dfrac{10}{9}
答案:A
难度评级:1350
小提示:
平均数为 00 表示 a+b+c=0a + b + c = 0;平均数为 1010 表示 a2+b2+c2=30a^2 + b^2 + c^2 = 30。
Mean 00 means a+b+c=0;a + b + c = 0; mean 1010 means a2+b2+c2=30a^2 + b^2 + c^2 = 30
大提示:
使用 (a+b+c)2(a + b + c)^2 =a2+b2+c2= a^2 + b^2 + c^2 +2(ab+bc+ca)+ 2(ab + bc + ca)。
Use (a+b+c)2(a + b + c)^2 =a2+b2+c2= a^2 + b^2 + c^2 +2(ab+bc+ca)+ 2(ab + bc + ca)
解答:
由平均数可得 a+b+c=0a + b + c = 0 且 a2+b2+c2=30a^2 + b^2 + c^2 = 30。平方第一个等式:(a+b+c)2(a+b+c)^2 =a2+b2+c2= a^2 + b^2 + c^2 +2(ab+bc+ca)+ 2(ab + bc + ca)。于是 0=30+2(ab+bc+ca)0 = 30 + 2(ab + bc + ca),所以 ab+bc+ca=−15ab + bc + ca = -15。它们的平均数为 −153=−5-\frac{15}{3} = -5。因此正确答案是 A。
The means tell us a+b+c=0a + b + c = 0 and a2+b2+c2=30.a^2 + b^2 + c^2 = 30. Square the first: (a+b+c)2(a+b+c)^2 =a2+b2+c2= a^2 + b^2 + c^2 +2(ab+bc+ca),+ 2(ab + bc + ca), so 0=30+2(ab+bc+ca)0 = 30 + 2(ab + bc + ca) and ab+bc+ca=−15.ab + bc + ca = -15. Their mean is −153=−5.-\frac{15}{3} = -5. Thus, A is the correct answer.

10.

四边形 ABCDABCD 是平行四边形,EE 是边 AD‾\overline{AD} 的中点。令 FF 为直线 EBEB 和 ACAC 的交点。四边形 CDEFCDEF 的面积与三角形 CFBCFB 的面积之比是多少?
Quadrilateral ABCDABCD is a parallelogram, and EE is the midpoint of the side AD‾.\overline{AD}. Let FF be the intersection of lines EBEB and AC.AC. What is the ratio of the area of quadrilateral CDEFCDEF to the area of triangle CFB?CFB?
5:45 : 4
4:34 : 3
3:23 : 2
5:35 : 3
2:12 : 1
答案:A
小提示:
面积比在仿射变换下不变,所以可用 A=(0,0)A = (0,0)、B=(1,0)B = (1,0)、C=(1,1)C = (1,1)、D=(0,1)D = (0,1) 来计算。
Area ratios are unchanged by an affine map, so compute with A=(0,0),A = (0,0), B=(1,0),B = (1,0), C=(1,1),C = (1,1), D=(0,1)D = (0,1)
大提示:
求出直线 ACAC 和 EBEB 的交点 FF,再使用鞋带公式。
Find FF as the intersection of line ACAC with line EB,EB, then use the shoelace formula
解答:
面积比在仿射变换下不变,所以取方便坐标:A=(0,0)A = (0,0)、B=(1,0)B = (1,0)、C=(1,1)C = (1,1)、D=(0,1)D = (0,1),此时 E=(0,12)E = (0, \tfrac12)。直线 ACAC 为 y=xy = x,直线 EBEB 从 (0,12)(0, \tfrac12) 到 (1,0)(1, 0),它们相交于 F=(13,13)F = (\tfrac13, \tfrac13)。用鞋带公式可得四边形 CDEFCDEF 的面积为 512\tfrac{5}{12},三角形 CFBCFB 的面积为 13\tfrac13。所以比值为 512:13=5:4\tfrac{5}{12} : \tfrac13 = 5 : 4。因此正确答案是 A。
Area ratios don’t change under an affine map, so drop in convenient coordinates: A=(0,0),A = (0,0), B=(1,0),B = (1,0), C=(1,1),C = (1,1), D=(0,1),D = (0,1), which makes E=(0,12).E = (0, \tfrac12). Line ACAC is y=x,y = x, and line EBEB runs from (0,12)(0, \tfrac12) to (1,0);(1, 0); they cross at F=(13,13).F = (\tfrac13, \tfrac13). The shoelace formula gives quadrilateral CDEFCDEF area 512\tfrac{5}{12} and triangle CFBCFB area 13.\tfrac13. So the ratio is 512:13=5:4.\tfrac{5}{12} : \tfrac13 = 5 : 4. Therefore, the answer is A.

11.

下图中,WXYZWXYZ 是长方形,且 WX=4WX = 4、WZ=8WZ = 8。点 MM 在 XY‾\overline{XY} 上,点 AA 在 YZ‾\overline{YZ} 上,且 ∠WMA\angle WMA 是直角。△WXM\triangle WXM 与 △WAZ\triangle WAZ 的面积相等。求 △WMA\triangle WMA 的面积。
In the figure below WXYZWXYZ is a rectangle with WX=4WX = 4 and WZ=8.WZ = 8. Point MM lies on XY‾,\overline{XY}, point AA lies on YZ‾,\overline{YZ}, and ∠WMA\angle WMA is a right angle. The areas of △WXM\triangle WXM and △WAZ\triangle WAZ are equal. What is the area of △WMA?\triangle WMA?
1313
1414
1515
1616
1717
答案:C
难度评级:1460
小提示:
设 X=(0,0)X = (0,0)、W=(0,4)W = (0,4)、Y=(8,0)Y = (8,0)、Z=(8,4)Z = (8,4),并令 M=(m,0)M = (m, 0)、A=(8,a)A = (8, a)。
Place X=(0,0),X = (0,0), W=(0,4),W = (0,4), Y=(8,0),Y = (8,0), Z=(8,4),Z = (8,4), with M=(m,0)M = (m, 0) and A=(8,a)A = (8, a)
大提示:
直角条件给出 MW→⋅MA→=0\overrightarrow{MW} \cdot \overrightarrow{MA} = 0,等面积条件给出第二个方程;解出 mm 和 aa。
The right angle gives MW→⋅MA→=0,\overrightarrow{MW} \cdot \overrightarrow{MA} = 0, and the equal-area condition gives a second equation; solve for mm and aa
解答:
设 X=(0,0)X = (0,0)、W=(0,4)W = (0,4)、Y=(8,0)Y = (8,0)、Z=(8,4)Z = (8,4),其中 M=(m,0)M = (m, 0) 在 XY‾\overline{XY} 上,A=(8,a)A = (8, a) 在 YZ‾\overline{YZ} 上。
因为 ∠WMA=90∘\angle WMA = 90^\circ,所以 MW→⋅MA→\overrightarrow{MW} \cdot \overrightarrow{MA} =(−m)(8−m)= (-m)(8-m) +4a=0+ 4a = 0,即 4a=m(8−m)4a = m(8-m)。面积为 [△WXM]=12⋅4⋅m=2m[\triangle WXM] = \tfrac12 \cdot 4 \cdot m = 2m 而 [△WAZ][\triangle WAZ] =12⋅8⋅(4−a)= \tfrac12 \cdot 8 \cdot (4 - a) =4(4−a)= 4(4 - a)。面积相等给出 m=8−2am = 8 - 2a。
把 a=8−m2a = \tfrac{8-m}{2} 代入 4a=m(8−m)4a = m(8-m),得 2(8−m)=m(8−m)2(8-m) = m(8-m),所以 m=2m = 2,a=3a = 3。另一个代数根 m=8m=8 会导致 M=A=YM=A=Y,此时 ∠WMA\angle WMA 没有定义,所以不成立。于是取 W=(0,4)W = (0,4)、M=(2,0)M = (2,0)、A=(8,3)A = (8,3),得 [△WMA]=12 ∣2(3−4)+8(4−0)∣=12(30)=15。 \begin{aligned} [\triangle WMA] &= \tfrac12\,\bigl|2(3 - 4) + 8(4 - 0)\bigr| \\ &= \tfrac12 (30) = 15 \end{aligned}\text{。}
所以正确答案是 C。
Set X=(0,0),X = (0,0), W=(0,4),W = (0,4), Y=(8,0),Y = (8,0), Z=(8,4),Z = (8,4), with M=(m,0)M = (m, 0) on XY‾\overline{XY} and A=(8,a)A = (8, a) on YZ‾.\overline{YZ}.
Since ∠WMA=90∘,\angle WMA = 90^\circ, MW→⋅MA→\overrightarrow{MW} \cdot \overrightarrow{MA} =(−m)(8−m)= (-m)(8-m) +4a=0,+ 4a = 0, so 4a=m(8−m).4a = m(8-m). The areas give [△WXM]=12⋅4⋅m=2m[\triangle WXM] = \tfrac12 \cdot 4 \cdot m = 2m and [△WAZ][\triangle WAZ] =12⋅8⋅(4−a)= \tfrac12 \cdot 8 \cdot (4 - a) =4(4−a).= 4(4 - a). Setting these equal yields m=8−2a.m = 8 - 2a.
Substituting a=8−m2a = \tfrac{8-m}{2} into 4a=m(8−m)4a = m(8-m) gives 2(8−m)=m(8−m),2(8-m) = m(8-m), so m=2m = 2 and a=3.a = 3. The other algebraic root, m=8,m=8, gives M=A=YM=A=Y and no defined angle ∠WMA,\angle WMA, so it is invalid. Then with W=(0,4),W = (0,4), M=(2,0),M = (2,0), A=(8,3),A = (8,3), [△WMA]=12 ∣2(3−4)+8(4−0)∣=12(30)=15. \begin{aligned} [\triangle WMA] &= \tfrac12\,\bigl|2(3 - 4) + 8(4 - 0)\bigr| \\ &= \tfrac12 (30) = 15. \end{aligned}
Thus, the correct answer is C.

12.

来自不同国家的 100100 名学生在一次数学竞赛中相遇。每名学生会说相同数量的语言,并且对任意两名学生 AA 和 BB,学生 AA 会说某种学生 BB 不会说的语言,同时学生 BB 也会说某种学生 AA 不会说的语言。所有学生会说的语言种类总数最少可能是多少?
A group of 100100 students from different countries meet at a mathematics competition. Each student speaks the same number of languages, and, for every pair of students AA and B,B, student AA speaks some language that student BB does not speak, and student BB speaks some language that student AA does not speak. What is the least possible total number of languages spoken by all the students?
99
1010
1212
5151
100100
答案:A
难度评级:1500
小提示:
把每名学生会说的语言看作一个集合;题设表示没有一个集合包含另一个集合。
Give each student the set of languages they speak; the condition means no set contains another
大提示:
大小相同且不同的集合不会互相包含,所以需要某个 kk 使 (nk)≥100\binom{n}{k} \ge 100。
Equal-size distinct sets never contain one another, so you need (nk)≥100\binom{n}{k} \ge 100 for some kk
解答:
把每名学生会说的语言看作一个集合。条件表示没有人的集合包含另一个人的集合。每个人会说同样数量 kk 种语言,而两个不同的 kk 元集合不可能互相包含,所以只需要有 100100 个不同的 kk 元子集。设语言总数为 nn,需要 (nk)≥100\binom{n}{k} \ge 100。当 n=8n = 8 时最多为 (84)=70\binom{8}{4} = 70,不足 100100。但 (94)=126≥100\binom{9}{4} = 126 \ge 100。因此 99 种语言既足够也必要。正确答案是 A。
Give each student the set of languages they speak. The condition says no one’s set sits inside another’s. Everyone speaks the same number kk of languages, and two distinct kk-element sets can never contain each other, so all we need is 100100 different kk-subsets of the nn languages, i.e. (nk)≥100.\binom{n}{k} \ge 100. With n=8n = 8 the best we can manage is (84)=70,\binom{8}{4} = 70, short of 100.100. But (94)=126≥100.\binom{9}{4} = 126 \ge 100. So 99 languages are both enough and necessary. Therefore, the answer is A.

13.

正整数 xx 和 yy 满足方程 x+y=1183\sqrt{x} + \sqrt{y} = \sqrt{1183}。x+yx + y 的最小可能值是多少?
Positive integers xx and yy satisfy the equation x+y=1183.\sqrt{x} + \sqrt{y} = \sqrt{1183}. What is the minimum possible value of x+y?x + y?
585585
595595
623623
700700
791791
答案:B
难度评级:1560
小提示:
1183=7⋅1321183 = 7 \cdot 13^2,所以 1183=137\sqrt{1183} = 13\sqrt{7}。
1183=7⋅132,1183 = 7 \cdot 13^2, so 1183=137\sqrt{1183} = 13\sqrt{7}
大提示:
于是 x=a7\sqrt{x} = a\sqrt{7}、y=b7\sqrt{y} = b\sqrt{7},且 a+b=13a + b = 13;最小化 x+y=7(a2+b2)x + y = 7(a^2 + b^2)。
Then x=a7\sqrt{x} = a\sqrt{7} and y=b7\sqrt{y} = b\sqrt{7} with a+b=13;a + b = 13; minimize x+y=7(a2+b2)x + y = 7(a^2 + b^2)
解答:
因为 1183=7⋅1321183 = 7 \cdot 13^2,所以 1183=137\sqrt{1183} = 13\sqrt7。把所给等式两边平方,可知 xy\sqrt{xy} 是有理数。因此 xx 与 yy 有相同的无平方因子部分:记 x=da2x=da^2 和 y=db2y=db^2,其中 dd 无平方因子,而 a,ba,b 为正整数。于是 (a+b)d=137(a+b)\sqrt d=13\sqrt7,所以 d=7d=7,a+b=13a+b=13。因此 x+y=7(a2+b2)x+y=7(a^2+b^2),它在 aa 与 bb 尽量接近时取到最小值。取 a=6a=6 和 b=7b=7,得 x+y=7(36+49)=595x+y=7(36+49)=595。因此正确答案是 B。
Since 1183=7⋅132,1183 = 7 \cdot 13^2, we have 1183=137.\sqrt{1183} = 13\sqrt7. Squaring the given equation shows that xy\sqrt{xy} is rational. Thus xx and yy have the same squarefree part: write x=da2x=da^2 and y=db2,y=db^2, where dd is squarefree and a,ba,b are positive integers. Then (a+b)d=137,(a+b)\sqrt d=13\sqrt7, so d=7d=7 and a+b=13.a+b=13. Therefore x+y=7(a2+b2),x+y=7(a^2+b^2), which is smallest when aa and bb are as close as possible. Taking a=6a=6 and b=7b=7 gives x+y=7(36+49)=595.x+y=7(36+49)=595. Thus, B is the correct answer.

14.

飞镖盘是坐标平面中的区域 BB,由满足 ∣x∣+∣y∣≤8|x| + |y| \le 8 的点 (x,y)(x, y) 组成。目标区域 TT 满足 (x2+y2−25)2≤49(x^2 + y^2 - 25)^2 \le 49。一支飞镖随机落在 BB 中。它落在 TT 中的概率可表示为 mn⋅π\dfrac{m}{n} \cdot \pi,其中 mm 和 nn 是互质的正整数。求 m+nm + n。
A dartboard is the region BB in the coordinate plane consisting of points (x,y)(x, y) such that ∣x∣+∣y∣≤8.|x| + |y| \le 8. A target TT is the region where (x2+y2−25)2≤49.(x^2 + y^2 - 25)^2 \le 49. A dart is thrown and lands at a random point in B.B. The probability that the dart lands in TT can be expressed as mn⋅π,\dfrac{m}{n} \cdot \pi, where mm and nn are relatively prime positive integers. What is m+n?m + n?
3939
7171
7373
7575
135135
答案:B
难度评级:1600
小提示:
区域 BB 是对角线长为 1616 的正方形,且 (x2+y2−25)2≤49(x^2+y^2-25)^2 \le 49 等价于 18≤x2+y2≤3218 \le x^2 + y^2 \le 32。
The region BB is a square with diagonals of length 16,16, and (x2+y2−25)2≤49(x^2+y^2-25)^2 \le 49 means 18≤x2+y2≤3218 \le x^2 + y^2 \le 32
大提示:
环形区域 TT 的面积为 π(32−18)\pi(32 - 18);检查其外半径 32\sqrt{32} 恰好到达 BB 的边,所以 TT 完全位于 BB 内。
The annulus TT has area π(32−18);\pi(32 - 18); check that its outer radius 32\sqrt{32} exactly reaches the sides of B,B, so TT lies entirely inside BB
解答:
飞镖靶 ∣x∣+∣y∣≤8|x| + |y| \le 8 是一个对角线长为 1616 的正方形,面积为 12⋅16⋅16=128\tfrac12 \cdot 16 \cdot 16 = 128。目标条件 (x2+y2−25)2≤49(x^2 + y^2 - 25)^2 \le 49 等价于 −7≤x2+y2−25≤7-7 \le x^2 + y^2 - 25 \le 7,即 18≤x2+y2≤3218 \le x^2 + y^2 \le 32,这是一个面积为 π(32−18)=14π\pi(32 - 18) = 14\pi 的圆环。
原点到正方形一条边(如 x+y=8x + y = 8)的距离为 82=32\dfrac{8}{\sqrt2} = \sqrt{32},正好等于环形区域外半径,所以整个环形区域都在 BB 内。概率为 14π128=764π\dfrac{14\pi}{128} = \dfrac{7}{64}\pi,因此 m+n=7+64=71m + n = 7 + 64 = 71。
所以正确答案是 B。
The dartboard ∣x∣+∣y∣≤8|x| + |y| \le 8 is a square with diagonals 16,16, so its area is 12⋅16⋅16=128.\tfrac12 \cdot 16 \cdot 16 = 128. The target condition (x2+y2−25)2≤49(x^2 + y^2 - 25)^2 \le 49 means −7≤x2+y2−25≤7,-7 \le x^2 + y^2 - 25 \le 7, i.e. 18≤x2+y2≤32,18 \le x^2 + y^2 \le 32, an annulus of area π(32−18)=14π.\pi(32 - 18) = 14\pi.
The distance from the origin to a side of the square (for instance x+y=8x + y = 8) is 82=32,\dfrac{8}{\sqrt2} = \sqrt{32}, exactly the annulus’s outer radius. So the annulus is tangent to the square and lies entirely within B.B. The probability is 14π128=764π,\dfrac{14\pi}{128} = \dfrac{7}{64}\pi, giving m+n=7+64=71.m + n = 7 + 64 = 71.
Thus, the correct answer is B.

15.

一个由 99 个实数组成的列表包括 11、2.22.2、3.23.2、5.25.2、6.26.2、77,以及 xx,yy,zz,其中 x≤y≤zx \le y \le z。这个列表的极差为 77,平均数和中位数都是正整数。有多少个有序三元组 (x,y,z)(x, y, z) 可能?
A list of 99 real numbers consists of 1,1, 2.2,2.2, 3.2,3.2, 5.2,5.2, 6.2,6.2, 7,7, as well as x,x, y,y, zz with x≤y≤z.x \le y \le z. The range of the list is 7,7, and the mean and median are both positive integers. How many ordered triples (x,y,z)(x, y, z) are possible?
11
22
33
44
无限多个
infinitely many
答案:C
小提示:
六个固定数之和为 24.824.8,所以平均数为整数时,x+y+zx + y + z 的小数部分必须为 0.20.2。
The six fixed numbers sum to 24.8,24.8, so the mean is an integer only when x+y+zx + y + z ends in 0.20.2
大提示:
极差条件给出三种情形:(min⁡,max⁡)=(0,7), (1,8)(\min,\max)=(0,7),\ (1,8),或 (t,t+7)(t,t+7),其中 0<t<10\lt t\lt1
The range condition gives three cases: (min⁡,max⁡)=(0,7), (1,8),(\min,\max)=(0,7),\ (1,8), or (t,t+7)(t,t+7) with 0<t<10\lt t\lt1
解答:
六个固定数之和为 24.824.8,取值范围为 [1,7][1,7]。整个列表的最小值与最大值有三种可能的安排。
若最小值与最大值为 00 和 77,则 x=0x=0 且 z≤7z\le7。此时平均数为整数只能取 33 或 44,分别要求 y+z=2.2y+z=2.2 或 11.211.2。前者使中位数变成 2.22.2。后者若要中位数为整数,必须 y=5y=5,从而 z=6.2z=6.2。这给出 (0,5,6.2)(0,5,6.2)。
若最小值与最大值为 11 和 88,则 z=8z=8,而平均数为整数要求 x+y=3.2x+y=3.2 或 12.212.2。前者使中位数变成 3.23.2;后者只有在 x=6, y=6.2x=6,\ y=6.2 时中位数才是整数。这给出 (6,6.2,8)(6,6.2,8)。
最后,若两个极值都由新数给出,写成 x=t, z=t+7x=t,\ z=t+7,其中 0<t<10\lt t\lt1。平均数必须为 44,所以 y=4.2−2ty=4.2-2t。中位数是 1,2.2,3.2,5.2,6.2,7,y1,2.2,3.2,5.2,6.2,7,y 中的第四个数;只有当 y=4y=4 时它才是整数,此时 t=0.1t=0.1。于是第三个三元组是 (0.1,4,7.1)(0.1,4,7.1),总共恰有 33 个。
所以正确答案是 C。
The six fixed numbers sum to 24.824.8 and span [1,7].[1,7]. There are three possible arrangements of the overall extremes.
If the extremes are 00 and 7,7, then x=0x=0 and z≤7.z\le7. The only possible integer means are 33 and 4,4, requiring y+z=2.2y+z=2.2 or 11.2.11.2. The first makes the median 2.2.2.2. In the second, an integer median forces y=5,y=5, hence z=6.2.z=6.2. This gives (0,5,6.2).(0,5,6.2).
If the extremes are 11 and 8,8, then z=8z=8 and the integer mean forces x+y=3.2x+y=3.2 or 12.2.12.2. The first makes the median 3.2;3.2; the second has an integer median only for x=6, y=6.2.x=6,\ y=6.2. This gives (6,6.2,8).(6,6.2,8).
Finally, if both extremes are new, write x=t, z=t+7x=t,\ z=t+7 with 0<t<1.0\lt t\lt1. The mean must be 4,4, so y=4.2−2t.y=4.2-2t. The median is the fourth number among 1,2.2,3.2,5.2,6.2,7,y;1,2.2,3.2,5.2,6.2,7,y; it is an integer only when y=4,y=4, giving t=0.1.t=0.1. Thus the third triple is (0.1,4,7.1),(0.1,4,7.1), and there are exactly 33 in all.
Thus, the correct answer is C.

16.

Jerry 喜欢玩数字。有一天,他把从 11 到 20242024 的所有整数都写在白板上。然后他反复选择白板上的四个数,擦掉它们,并用它们的和或积替代。(例如,Jerry 的第一步可能擦掉 11,22,33 和 55,然后在白板上写下它们的和 1111,或它们的积 3030。)反复进行这个操作后,Jerry 注意到白板上剩下的所有数都是奇数。此时白板上最多可能还剩多少个整数?
Jerry likes to play with numbers. One day, he wrote all the integers from 11 to 20242024 on the whiteboard. Then he repeatedly chose four numbers on the whiteboard, erased them, and replaced them by either their sum or their product. (For example, Jerry’s first step might have been to erase 1,1, 2,2, 3,3, and 5,5, and then write either 11,11, their sum, or 30,30, their product, on the whiteboard.) After repeatedly performing this operation, Jerry noticed that all the remaining numbers on the whiteboard were odd. What is the maximum possible number of integers on the whiteboard at that time?
10101010
10111011
10121012
10131013
10141014
答案:A
难度评级:1800
小提示:
每次操作把 44 个数变成 11 个数,所以数量减少 33;要最大化剩余数量,就要最小化操作次数。
Each move turns 44 numbers into 1,1, so the count drops by 3;3; maximizing the count means minimizing the moves
大提示:
共有 10121012 个偶数,而每次操作至多使偶数的个数减少 33 个。
There are 10121012 even entries, and any move decreases their number by at most 33
解答:
在 1,…,20241, \ldots, 2024 中有 10121012 个偶数和 10121012 个奇数。每次操作把 44 个数换成 11 个数,所以总数减少 33。如果某次操作用掉 ee 个偶数,那么它写下的结果要么是奇数,使偶数的个数减少 ee;要么是偶数,使偶数的个数减少 e−1e-1。无论哪种情形,偶数的个数至多减少 33。因此要消去全部 10121012 个偶数,至少需要 ⌈10123⌉=338\lceil\frac{1012}{3}\rceil=338 次操作。这个次数可以达到:先做 337337 次求和,每次取一个奇数和三个偶数,再做一次求和,取三个奇数和最后一个偶数。这样每次写下的都是奇数。因此白板上最多能剩下 2024−3⋅338=10102024-3\cdot338=1010 个数。因此正确答案是 A。
Among 1,…,20241, \ldots, 2024 there are 10121012 even numbers and 10121012 odd numbers. Each operation replaces 44 entries by 1,1, so the total count falls by 3.3. If a move consumes ee even entries, its output is either odd, reducing the even count by e,e, or even, reducing it by e−1.e-1. In either case the even count falls by at most 3.3. Therefore eliminating all 10121012 even entries takes at least ⌈10123⌉=338\lceil\frac{1012}{3}\rceil=338 moves. This is achievable: use 337337 sums containing one odd and three evens, then one sum containing three odds and the final even. Every output is odd. Thus the maximum remaining count is 2024−3⋅338=1010.2024-3\cdot338=1010. Therefore, the answer is A.

17.

在 55 只蜗牛的比赛中,最多只有一次并列,但这次并列可以包含任意数量的蜗牛。例如,比赛结果可能是 Dazzler 第一;Abby、Cyrus 和 Elroy 并列第二;Bruna 第五。共有多少种不同的比赛结果?
In a race among 55 snails, there is at most one tie, but that tie can involve any number of snails. For example, the result of the race might be that Dazzler is first; Abby, Cyrus, and Elroy are tied for second; and Bruna is fifth. How many different results of the race are possible?
180180
361361
420420
431431
720720
答案:D
难度评级:1730
小提示:
分别计算没有并列的结果和恰好有一组并列的结果。
Count results with no tie separately from results with exactly one tied group
大提示:
若并列组有 kk 只蜗牛,先用 (5k)\binom{5}{k} 选出它们,再把剩下的 6−k6 - k 个块排序,有 (6−k)!(6-k)! 种。
For a tied group of kk snails, choose them in (5k)\binom{5}{k} ways and order the 6−k6 - k resulting blocks in (6−k)!(6-k)! ways
解答:
如果没有并列,55 只蜗牛有 5!=1205! = 120 种名次顺序。现在允许恰好一组大小为 kk 的并列,其中 2≤k≤52 \le k \le 5。先用 (5k)\binom{5}{k} 选出这一组,再把它看作一个块,连同其余单个蜗牛一共 6−k6 - k 个块,排列方式为 (6−k)!(6 - k)!。对 kk 求和,得 (52)4!\binom{5}{2}4! +(53)3!+ \binom{5}{3}3! +(54)2!+ \binom{5}{4}2! +(55)1!+ \binom{5}{5}1! =240+60+10+1= 240 + 60 + 10 + 1 =311= 311。加上无并列的 120+311=431120 + 311 = 431 种。因此正确答案是 D。
If nobody ties, the 55 snails finish in 5!=1205! = 120 orders. Now allow exactly one tied group of size kk with 2≤k≤5.2 \le k \le 5. Choose the group in (5k)\binom{5}{k} ways, then treat it as one block, leaving 6−k6 - k blocks to arrange in (6−k)!(6 - k)! ways. Summing over k:k: (52)4!\binom{5}{2}4! +(53)3!+ \binom{5}{3}3! +(54)2!+ \binom{5}{4}2! +(55)1!+ \binom{5}{5}1! =240+60+10+1= 240 + 60 + 10 + 1 =311.= 311. Add the no-tie count: 120+311=431.120 + 311 = 431. Thus, D is the correct answer.

18.

一个整数的 100100 次方除以 125125 时,可能出现多少种不同的余数?
How many different remainders can result when the 100100th power of an integer is divided by 125?125?
11
22
55
2525
125125
答案:B
难度评级:1800
小提示:
分为与 55 互质的整数,以及被 55 整除的整数。
Split into integers coprime to 55 and integers divisible by 55
大提示:
因为 φ(125)=100\varphi(125) = 100,Euler 定理说明当 gcd⁡(n,5)=1\gcd(n,5)=1 时,n100≡1(mod125)n^{100} \equiv 1 \pmod{125};而 55 的倍数满足 n100n^{100} 被 125125 整除。
Since φ(125)=100,\varphi(125) = 100, Euler’s theorem gives n100≡1(mod125)n^{100} \equiv 1 \pmod{125} when gcd⁡(n,5)=1;\gcd(n,5)=1; a multiple of 55 has n100n^{100} divisible by 125125
解答:
若 nn 与 55 互质,则由 φ(125)=100\varphi(125) = 100 和 Euler 定理可得 n100≡1(mod125)n^{100} \equiv 1 \pmod{125}。若 nn 是 55 的倍数,则 n100n^{100} 被 51005^{100} 整除,因而也被 125125 整除,余数为 00。
因此只可能出现余数 00 和 11,共 22 种。
所以正确答案是 B。
If nn is coprime to 5,5, then since φ(125)=100,\varphi(125) = 100, Euler’s theorem gives n100≡1(mod125).n^{100} \equiv 1 \pmod{125}. If nn is a multiple of 5,5, then n100n^{100} is divisible by 5100,5^{100}, hence by 125,125, leaving remainder 0.0.
So the only possible remainders are 00 and 1,1, which is 22 distinct values.
Thus, the correct answer is B.

19.

在下表中,每个问号要替换为“可能”或“不可能”,以表示具有给定斜率的非竖直直线是否可能包含给定数量的格点(两个坐标都是整数的点)。这 1212 个位置中有多少个会填“可能”?
In the following table, each question mark is to be replaced by “Possible” or “Not Possible” to indicate whether a nonvertical line with the given slope can contain the given number of lattice points (points both of whose coordinates are integers). How many of the 1212 entries will be “Possible”?
44
55
66
77
99
答案:C
难度评级:1910
小提示:
一条直线上的两个格点会迫使它的斜率为有理数;因此无理斜率的直线至多含一个格点。
Two lattice points on a line force its slope to be rational; so an irrational slope allows at most one lattice point
大提示:
一条有理斜率且经过一个格点的直线会经过无穷多个格点,所以它要么有 00 个,要么有无穷多个。
A rational-slope line through one lattice point passes through infinitely many, so it has either 00 or infinitely many
解答:
任意两个格点决定的斜率都是有理数。所以无理斜率的直线至多含一个格点:它可以有 00 个(例如 y=2 x+12y = \sqrt2\,x + \tfrac12),也可以恰有 11 个(例如 y=2 xy = \sqrt2\,x),但不可能有两个。有理斜率(包括 00)的直线若经过格点 (x0,y0)(x_0, y_0),则对其最简斜率 pq\tfrac{p}{q},也经过 (x0+q,y0+p)(x_0 + q, y_0 + p),所以会经过无穷多个格点;这样的直线要么没有格点(用无理截距平移即可),要么多于两个,不可能恰有一个或两个。因此每一行正好有两个“可能”。对零斜率和非零有理斜率,是“零个”和“多于两个”两列;对无理斜率,是“零个”和“恰好一个”两列。总数为 66。因此正确答案是 C。
Any two lattice points give a rational slope. So a line with irrational slope holds at most one lattice point: it can have 00 (say y=2 x+12y = \sqrt2\,x + \tfrac12) or exactly 11 (say y=2 xy = \sqrt2\,x), never two. A line with rational slope (zero included) through a lattice point (x0,y0)(x_0, y_0) also passes through (x0+q,y0+p)(x_0 + q, y_0 + p) for its reduced slope pq,\tfrac{p}{q}, so it hits infinitely many; such a line has either 00 lattice points (shift it by an irrational intercept) or more than two, never exactly one or two. So each row gives exactly two “Possible” entries. For zero and nonzero rational slope those are the “zero” and “more than two” columns; for irrational slope, the “zero” and “exactly one” columns. That’s 66 in all. Thus, C is the correct answer.

20.

三双不同的鞋被排成一行,要求没有一只左脚鞋与来自不同双的右脚鞋相邻。这六只鞋共有多少种排法?
Three different pairs of shoes are placed in a row so that no left shoe is next to a right shoe from a different pair. In how many ways can these six shoes be lined up?
6060
7272
9090
108108
120120
答案:A
难度评级:2080
小提示:
规则表示:只要一只左脚鞋挨着一只右脚鞋,它们必须来自同一双。
The rule says: wherever a left shoe touches a right shoe, they must be mates from the same pair
大提示:
按六个位置的左右脚模式分类;每个左右脚切换的位置都会确定一双鞋。
Case on the left/right pattern of the six spots; each place where the side switches pins down one pair
解答:
只要左右脚模式中一个 LL 与一个 RR 相邻,这两只鞋就必须是一双。因此内部连续段的长度不能为 11:其中唯一一只鞋会被迫同时成为两侧鞋子的配对。三只 LL 和三只 RR 的唯一可能模式是 LLLRRRLLLRRR,RRRLLLRRRLLL,LLRRRLLLRRRL,LRRLLRLRRLLR,LRRRLLLRRRLL,RLLLRRRLLLRR,RLLRRLRLLRRL,和 RRLLLRRRLLLR。对任意一种只切换一次的模式,选择切换处的一双并排列剩余鞋子,得到 3⋅2⋅2=123\cdot2\cdot2=12 种排列。其他六种模式各有 66 种把三双鞋分配到切换处的方法。因此总数为 2⋅12+6⋅6=602\cdot12+6\cdot6=60。所以答案是 A。
Wherever an LL meets an RR in the side pattern, those two shoes must be mates. Thus an interior run cannot have length 1:1: its lone shoe would have to be the mate of both neighbors. With three LL’s and three RR’s, the only possible patterns are LLLRRR,LLLRRR, RRRLLL,RRRLLL, LLRRRL,LLRRRL, LRRLLR,LRRLLR, LRRRLL,LRRRLL, RLLLRR,RLLLRR, RLLRRL,RLLRRL, and RRLLLR.RRLLLR. For either one-switch pattern, choose the pair at the switch and order the remaining shoes, giving 3⋅2⋅2=123\cdot2\cdot2=12 arrangements. Each of the other six patterns has 66 assignments of the three pairs to its switches. Hence the total is 2⋅12+6⋅6=60.2\cdot12+6\cdot6=60. Therefore, the answer is A.

21.

两根直管(圆柱体)的半径分别为 11 和 14\tfrac14,它们平行放置并在平坦地面上相切。下图是正面视图。第三根平行管也放在同一地面上,并且同时与前两根相切。它的可能半径之和是多少?
Two straight pipes (circular cylinders), with radii 11 and 14,\tfrac14, lie parallel and in contact on a flat floor. The figure below shows a head-on view. What is the sum of the possible radii of a third parallel pipe lying on the same floor and in contact with both?
19\dfrac{1}{9}
11
109\dfrac{10}{9}
119\dfrac{11}{9}
199\dfrac{19}{9}
答案:C
难度评级:2120
小提示:
两个半径为 RR 和 rr 的圆放在同一直线上并相切时,它们与地面接触点的水平距离为 2Rr2\sqrt{Rr}。
For two circles of radii RR and rr resting on a line and touching each other, their floor contact points are 2Rr2\sqrt{Rr} apart
大提示:
新管的接触点到大管接触点距离为 2r2\sqrt{r},到小管接触点距离为 r\sqrt{r};它可以在两者之间或外侧。
The new pipe’s contact point is 2r2\sqrt{r} from the big pipe’s and r\sqrt{r} from the small pipe’s; it can sit between them or outside
解答:
两个半径为 RR 和 rr 的圆靠在地面上并互相相切时,它们与地面的接触点水平距离为 2Rr2\sqrt{Rr}。所以半径 11 和 14\tfrac14 的两根管接触地面的点相距 21⋅14=12\sqrt{1 \cdot \tfrac14} = 1。设第三根管半径为 rr。它到大管接触点的距离为 2r2\sqrt{r},到小管接触点的距离为 214r=r2\sqrt{\tfrac14 r} = \sqrt{r}。若夹在两者之间,2r+r=12\sqrt r + \sqrt r = 1,所以 r=13\sqrt r = \tfrac13,r=19r = \tfrac19。若在小管外侧,2r−r=12\sqrt r - \sqrt r = 1,所以 r=1r = 1。(在大管外侧不可能。)半径之和为 19+1=109\tfrac19 + 1 = \tfrac{10}{9}。因此正确答案是 C。
Two circles of radii RR and rr resting on the floor and touching each other have contact points a horizontal distance 2Rr2\sqrt{Rr} apart. So the radius-11 and radius-14\tfrac14 pipes touch the floor 21⋅14=12\sqrt{1 \cdot \tfrac14} = 1 apart. A third pipe of radius rr sits 2r2\sqrt{r} from the big pipe’s contact point and 214r=r2\sqrt{\tfrac14 r} = \sqrt{r} from the small pipe’s. Nestled between them, 2r+r=1,2\sqrt r + \sqrt r = 1, so r=13\sqrt r = \tfrac13 and r=19.r = \tfrac19. Sitting past the small pipe, 2r−r=1,2\sqrt r - \sqrt r = 1, so r=1.r = 1. (Past the big pipe can’t happen.) The sum is 19+1=109.\tfrac19 + 1 = \tfrac{10}{9}. Thus, C is the correct answer.

22.

1616 个人将被分成 44 个不可区分的 44 人委员会。每个委员会有一名主席和一名秘书。这些安排方式的数量可写成 3rM3^r M,其中 rr 和 MM 是正整数,且 MM 不被 33 整除。求 rr。
A group of 1616 people will be partitioned into 44 indistinguishable 44-person committees. Each committee will have one chairperson and one secretary. The number of different ways to make these assignments can be written as 3rM,3^r M, where rr and MM are positive integers and MM is not divisible by 3.3. What is r?r?
55
66
77
88
99
答案:A
小提示:
方式数为 16!(4!)4⋅4!⋅(4⋅3)4\dfrac{16!}{(4!)^4 \cdot 4!} \cdot (4 \cdot 3)^4,也就是分组数乘以每组选择主席和秘书的方式数。
The number of ways is 16!(4!)4⋅4!⋅(4⋅3)4,\dfrac{16!}{(4!)^4 \cdot 4!} \cdot (4 \cdot 3)^4, the partition count times chair/secretary choices per committee
大提示:
用勒让德公式分别数 16!16! 和 4!4! 中因子 33 的个数。
Count factors of 33 in each piece using Legendre’s formula on 16!16! and 4!4!
解答:
先把 1616 个人分成 44 个不可区分的 44 人组,共有 16!(4!)4 4!\dfrac{16!}{(4!)^4 \, 4!} 种方法;每个委员会再选主席和秘书,有 4⋅3=124 \cdot 3 = 12 种,因而贡献因子 12412^4。现在数因子 33。在 16!16! 中有 ⌊163⌋+⌊169⌋=6\lfloor \frac{16}{3} \rfloor + \lfloor \frac{16}{9} \rfloor = 6;分母 (4!)4 4!(4!)^4 \, 4! 贡献 4⋅1+1=54 \cdot 1 + 1 = 5;而 12412^4 贡献 44。指数为 6−5+4=56 - 5 + 4 = 5,所以 r=5r = 5。因此正确答案是 A。
Split 1616 people into 44 indistinguishable groups of 44 in 16!(4!)4 4!\dfrac{16!}{(4!)^4 \, 4!} ways, then each committee picks a chairperson and a secretary in 4⋅3=124 \cdot 3 = 12 ways, a factor of 124.12^4. Now count factors of 3.3. In 16!16! there are ⌊163⌋+⌊169⌋=6;\lfloor \frac{16}{3} \rfloor + \lfloor \frac{16}{9} \rfloor = 6; the denominator (4!)4 4!(4!)^4 \, 4! contributes 4⋅1+1=5;4 \cdot 1 + 1 = 5; and 12412^4 contributes 4.4. The exponent is 6−5+4=5,6 - 5 + 4 = 5, so r=5.r = 5. Therefore, the answer is A.

23.

斐波那契数列定义为 F1=1F_1 = 1、F2=1F_2 = 1,且当 n≥3n \ge 3 时 Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}。下式的值是多少?
F2F1+F4F2+F6F3+⋯+F20F10?\frac{F_2}{F_1} + \frac{F_4}{F_2} + \frac{F_6}{F_3} + \cdots + \frac{F_{20}}{F_{10}}\text{?}
The Fibonacci numbers are defined by F1=1,F_1 = 1, F2=1,F_2 = 1, and Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2} for n≥3.n \ge 3. What is
F2F1+F4F2+F6F3+⋯+F20F10?\frac{F_2}{F_1} + \frac{F_4}{F_2} + \frac{F_6}{F_3} + \cdots + \frac{F_{20}}{F_{10}}?
318318
319319
320320
321321
322322
答案:B
难度评级:2100
小提示:
每项都可化简:F2kFk\dfrac{F_{2k}}{F_k} 是整数;先算几项,如 F2F1=1\dfrac{F_2}{F_1} = 1、F4F2=3\dfrac{F_4}{F_2} = 3、F6F3=4\dfrac{F_6}{F_3} = 4。
Each term simplifies: F2kFk\dfrac{F_{2k}}{F_k} is an integer; compute the first few, such as F2F1=1,\dfrac{F_2}{F_1} = 1, F4F2=3,\dfrac{F_4}{F_2} = 3, F6F3=4\dfrac{F_6}{F_3} = 4
大提示:
这些值是 Lucas 数 Lk=1,3,4,7,11,…L_k = 1, 3, 4, 7, 11, \ldots;求 L1L_1 到 L10L_{10} 的和。
These values are the Lucas numbers Lk=1,3,4,7,11,…;L_k = 1, 3, 4, 7, 11, \ldots; sum L1L_1 through L10L_{10}
解答:
因为 F2k=FkLkF_{2k} = F_k L_k,其中 LkL_k 为第 kk 个 Lucas 数,所以 F2kFk=Lk\dfrac{F_{2k}}{F_k} = L_k。所求和为 L1+L2+⋯+L10=1+3+4+7+11+18+29+47+76+123=319。 \begin{gathered} L_1 + L_2 + \cdots + L_{10} \\ = 1 + 3 + 4 + 7 + 11 + 18 \\ {}+ 29 + 47 + 76 + 123 \\ = 319\text{。} \end{gathered} 等价地,L1+⋯+L10L_1 + \cdots + L_{10} =L12−3= L_{12} - 3 =322−3=319= 322 - 3 = 319。
所以正确答案是 B。
Since F2k=FkLkF_{2k} = F_k L_k where LkL_k is the kkth Lucas number, each term F2kFk=Lk.\dfrac{F_{2k}}{F_k} = L_k. The sum is L1+L2+⋯+L10=1+3+4+7+11+18+29+47+76+123=319. \begin{gathered} L_1 + L_2 + \cdots + L_{10} \\ = 1 + 3 + 4 + 7 + 11 + 18 \\ {}+ 29 + 47 + 76 + 123 \\ = 319. \end{gathered} (Equivalently, L1+⋯+L10L_1 + \cdots + L_{10} =L12−3= L_{12} - 3 =322−3=319.= 322 - 3 = 319.)
Thus, the correct answer is B.

24.

令
P(m)=m2+m24+m48+m88。 \begin{aligned} P(m) &= \frac{m}{2} + \frac{m^2}{4} \\ &\quad {}+ \frac{m^4}{8} + \frac{m^8}{8} \end{aligned}\text{。}
P(2022)P(2022)、P(2023)P(2023)、P(2024)P(2024) 和 P(2025)P(2025) 中有多少个值是整数?
Let
P(m)=m2+m24+m48+m88. \begin{aligned} P(m) &= \frac{m}{2} + \frac{m^2}{4} \\ &\quad {}+ \frac{m^4}{8} + \frac{m^8}{8}. \end{aligned}
How many of the values of P(2022),P(2022), P(2023),P(2023), P(2024),P(2024), and P(2025)P(2025) are integers?
00
11
22
33
44
答案:E
难度评级:2380
小提示:
通分到分母 88,得到 P(m)=4m+2m2+m4+m88P(m) = \dfrac{4m + 2m^2 + m^4 + m^8}{8}。
Over the common denominator 8,8, P(m)=4m+2m2+m4+m88P(m) = \dfrac{4m + 2m^2 + m^4 + m^8}{8}
大提示:
分别对偶数和奇数 mm 检查 4m+2m2+m4+m8(mod8)4m + 2m^2 + m^4 + m^8 \pmod 8。
Check 4m+2m2+m4+m8(mod8)4m + 2m^2 + m^4 + m^8 \pmod 8 separately for even and odd mm
解答:
通分到 88:P(m)=m8+m4+2m2+4m8P(m) = \dfrac{m^8 + m^4 + 2m^2 + 4m}{8}。若 mm 为偶数,分子每一项都被 88 整除。若 mm 为奇数,则 m2≡m4≡m8≡1m^2 \equiv m^4 \equiv m^8 \equiv 1 且 4m≡4(mod8)4m \equiv 4 \pmod 8,所以分子为 1+1+2+4=8≡0(mod8)1 + 1 + 2 + 4 = 8 \equiv 0 \pmod 8。两种情况下 P(m)P(m) 都是整数,因此 44 个值全是整数。正确答案是 E。
Put everything over 8:8: P(m)=m8+m4+2m2+4m8.P(m) = \dfrac{m^8 + m^4 + 2m^2 + 4m}{8}. If mm is even, every term up top is divisible by 8.8. If mm is odd, then m2≡m4≡m8≡1m^2 \equiv m^4 \equiv m^8 \equiv 1 and 4m≡4(mod8),4m \equiv 4 \pmod 8, so the numerator is 1+1+2+4=8≡0(mod8).1 + 1 + 2 + 4 = 8 \equiv 0 \pmod 8. Either way P(m)P(m) is an integer, so all 44 values are integers. Therefore, the answer is E.

25.

2727 块砖(长方体)的尺寸都是 a×b×ca \times b \times c,其中 aa,bb 和 cc 是两两互质的正整数。这些砖被排成一个 3×3×33 \times 3 \times 3 的长方体块,如下图左侧所示。再加入第 2828 块同样尺寸的砖,并把这些砖重新排成一个 2×2×72 \times 2 \times 7 的长方体块,如右侧所示。新的长方体比旧的高 11 个单位、宽 11 个单位、深 11 个单位。求 a+b+ca + b + c。
Each of 2727 bricks (right rectangular prisms) has dimensions a×b×c,a \times b \times c, where a,a, b,b, and cc are pairwise relatively prime positive integers. These bricks are arranged to form a 3×3×33 \times 3 \times 3 block, as shown on the left below. A 2828th brick with the same dimensions is introduced, and these bricks are reconfigured into a 2×2×72 \times 2 \times 7 block, shown on the right. The new block is 11 unit taller, 11 unit wider, and 11 unit deeper than the old one. What is a+b+c?a + b + c?
8888
8989
9090
9191
9292
答案:E
难度评级:2470
小提示:
旧块的边长为 3a,3b,3c3a, 3b, 3c;新块的边长为 2u,2v,7w2u, 2v, 7w,其中 u,v,wu, v, w 是 a,b,ca, b, c 的某种排列。
The old block has side lengths 3a,3b,3c;3a, 3b, 3c; the new block has side lengths 2u,2v,7w2u, 2v, 7w for some assignment of a,b,ca, b, c to u,v,wu, v, w
大提示:
重新标号,使新块的边长为 7a,2b,2c7a,2b,2c;其中任何一条都不可能等于字母相同的那个 3a+1,3b+1,3c+13a+1,3b+1,3c+1。
Relabel so the new side lengths are 7a,2b,2c;7a,2b,2c; no one of these can equal 3a+1,3b+1,3c+13a+1,3b+1,3c+1 with the same letter
解答:
重新标记砖块的尺寸,使新块的边长为 7a,2b,2c7a,2b,2c。这三条边必定就是旧块的三条边长 3a,3b,3c3a,3b,3c 各增加 11 之后的结果。新边不可能与字母相同的旧边对应:7a=3a+17a=3a+1 没有正整数解,而 2b=3b+12b=3b+1 和 2c=3c+12c=3c+1 会给出负的边长。因此这个对应必定是两个三轮换之一。在其中一种排法下,7a=3c+1,2b=3a+1,2c=3b+1。 \begin{aligned} 7a&=3c+1,\\ 2b&=3a+1,\\ 2c&=3b+1 \end{aligned}\text{。}后两个方程给出 b=3a+12b=\frac{3a+1}{2} 和 c=9a+54c=\frac{9a+5}{4},代入第一个方程得 28a=27a+1928a=27a+19,所以 (a,b,c)=(19,29,44)(a,b,c)=(19,29,44)。另一个三轮换只是把 bb 和 cc 互换。这三个长度两两互质,且 a+b+c=19+29+44=92a+b+c=19+29+44=92。因此正确答案是 E。
Relabel the brick dimensions so the new block has sides 7a,2b,2c.7a,2b,2c. These must be the three old side lengths 3a,3b,3c,3a,3b,3c, each increased by 1.1. A new side cannot match the old side with the same letter: 7a=3a+17a=3a+1 has no positive integer solution, while 2b=3b+12b=3b+1 and 2c=3c+12c=3c+1 would give negative lengths. Therefore the matching must be one of the two three-cycles. In one orientation, 7a=3c+1,2b=3a+1,2c=3b+1. \begin{aligned} 7a&=3c+1,\\ 2b&=3a+1,\\ 2c&=3b+1. \end{aligned} The last two equations give b=3a+12b=\frac{3a+1}{2} and c=9a+54.c=\frac{9a+5}{4}. Substituting into the first gives 28a=27a+19,28a=27a+19, so (a,b,c)=(19,29,44).(a,b,c)=(19,29,44). The other cycle merely exchanges bb and c.c. These lengths are pairwise relatively prime, and a+b+c=19+29+44=92.a+b+c=19+29+44=92. Thus, E is the correct answer.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

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