2012 AMC 12A 详解

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

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

1.

一只小虫在数轴上爬行,起点是 −2-2。它先爬到 −6-6,然后掉头爬到 55。这只小虫一共爬了多少个单位?
A bug crawls along a number line, starting at −2.-2. It crawls to −6,-6, then turns around and crawls to 5.5. How many units does the bug crawl altogether?
99
1111
1313
1414
1515
知识点:绝对值
小提示:
把两段爬行距离相加,而不是只看净位移
Add the two separate crawl distances rather than the net displacement
大提示:
第一段是 ∣−6−(−2)∣|-6-(-2)|,第二段是 ∣5−(−6)∣|5-(-6)|
The first leg is ∣−6−(−2)∣|-6-(-2)| and the second is ∣5−(−6)∣|5-(-6)|
解答:
小虫第一段爬了 ∣−6−(−2)∣=4|-6-(-2)| = 4 个单位,第二段爬了 ∣5−(−6)∣=11|5-(-6)| = 11 个单位。
总距离为 4+11=154 + 11 = 15。
因此,正确答案是 E。
The bug crawls ∣−6−(−2)∣=4|-6-(-2)| = 4 units on the first leg and ∣5−(−6)∣=11|5-(-6)| = 11 units on the second leg.
The total distance is 4+11=15.4 + 11 = 15.
Thus, the correct answer is E.

2.

Cagney 每 2020 秒给一个纸杯蛋糕涂糖霜,Lacey 每 3030 秒给一个纸杯蛋糕涂糖霜。两人一起工作,55 分钟内可以给多少个纸杯蛋糕涂糖霜?
Cagney can frost a cupcake every 2020 seconds and Lacey can frost a cupcake every 3030 seconds. Working together, how many cupcakes can they frost in 55 minutes?
1010
1515
2020
2525
3030
知识点:速率单位换算
难度评级:720
小提示:
先把两人的速度都换成每分钟能完成的个数。
Convert each frosting rate to cupcakes per minute
大提示:
把两个速度相加,再乘以 55 分钟。
Add the two rates, then multiply by 55 minutes
解答:
Cagney 每分钟完成 60÷20=360 \div 20 = 3 个,Lacey 每分钟完成 60÷30=260 \div 30 = 2 个。
55 分钟内,他们能完成 5(2+3)=5⋅5=25。 5(2 + 3) = 5 \cdot 5 = 25\text{。}
所以正确答案是 D。
Cagney can make 60÷20=360 \div 20 = 3 cupcakes per minute, and Lacey can make 60÷30=2.60 \div 30 = 2.
In 55 minutes, they can make 5(2+3)=5⋅5=25. 5(2 + 3) = 5 \cdot 5 = 25.
Thus, D is the correct answer.

3.

一个盒子高 22 厘米、宽 33 厘米、长 55 厘米,可以装 4040 克黏土。第二个盒子的高度是第一个的两倍,宽度是第一个的三倍,长度与第一个相同,可以装 nn 克黏土。求 nn?
A box 22 centimeters high, 33 centimeters wide, and 55 centimeters long can hold 4040 grams of clay. A second box with twice the height, three times the width, and the same length as the first box can hold nn grams of clay. What is n?n?
120120
160160
200200
240240
280280
知识点:体积比与比例
难度评级:880
小提示:
容量与体积成正比
The capacity is proportional to the volume
大提示:
体积被乘以 2×3×12 \times 3 \times 1
The volume is multiplied by 2×3×12 \times 3 \times 1
解答:
第二个盒子的体积是第一个盒子的 2×3×1=62 \times 3 \times 1 = 6 倍,所以它能装的黏土也是 66 倍。
因此 n=6⋅40=240n = 6 \cdot 40 = 240。
因此,正确答案是 D。
The second box has 2×3×1=62 \times 3 \times 1 = 6 times the volume of the first, so it holds 66 times as much clay.
Therefore n=6⋅40=240.n = 6 \cdot 40 = 240.
Thus, the correct answer is D.

4.

一个袋子里有若干弹珠,其中 35\dfrac{3}{5} 是蓝色的,其余是红色的。现在把红色弹珠的数量加倍,而蓝色弹珠数量不变。此时红色弹珠占全部弹珠的几分之几?
In a bag of marbles, 35\dfrac{3}{5} of the marbles are blue and the rest are red. If the number of red marbles is doubled and the number of blue marbles stays the same, what fraction of the marbles will be red?
25\dfrac{2}{5}
37\dfrac{3}{7}
47\dfrac{4}{7}
35\dfrac{3}{5}
45\dfrac{4}{5}
知识点:比与比例分数
难度评级:920
小提示:
把原来的蓝色和红色数量看作比例 3:23:2。
Start with a 3:23:2 ratio of blue to red marbles
大提示:
红色数量加倍后,蓝色与红色的比例变成 3:43:4。
Doubling the red marbles changes the ratio to 3:43:4
解答:
不妨设袋中共有 55 颗弹珠;因为只关心比例,所以可以这样假设。于是蓝色有 33 颗,红色有 22 颗。
红色数量加倍后有 44 颗红弹珠,因此红色所占比例为 44+3=47。 \dfrac{4}{4 + 3} = \dfrac{4}{7}\text{。}
所以正确答案是 C。
WLOG, let the number of marbles in the bag be 5.5. Since we only care about ratios, we can do this. Then there are 33 blue marbles and 22 red marbles.
Doubling the red marbles gives us 44 of them. Then the fraction of red marbles is 44+3=47. \dfrac{4}{4 + 3} = \dfrac{4}{7}.
Thus, C is the correct answer.

5.

一份水果沙拉由蓝莓、覆盆子、葡萄和樱桃组成。水果沙拉中共有 280280 块水果。覆盆子的数量是蓝莓的两倍,葡萄的数量是樱桃的三倍,樱桃的数量是覆盆子的四倍。水果沙拉中有多少颗樱桃?
A fruit salad consists of blueberries, raspberries, grapes, and cherries. The fruit salad has a total of 280280 pieces of fruit. There are twice as many raspberries as blueberries, three times as many grapes as cherries, and four times as many cherries as raspberries. How many cherries are there in the fruit salad?
88
1616
2525
6464
9696
难度评级:1040
小提示:
用蓝莓的数量表示每一种水果的数量
Express every count in terms of the number of blueberries
大提示:
若有 bb 颗蓝莓,则有 2b2b 颗覆盆子,8b8b 颗樱桃,24b24b 颗葡萄
With bb blueberries there are 2b2b raspberries, 8b8b cherries, and 24b24b grapes
解答:
设蓝莓有 bb 颗。则覆盆子有 2b2b 颗,樱桃有 4⋅2b=8b4 \cdot 2b = 8b 颗,葡萄有 3⋅8b=24b3 \cdot 8b = 24b 颗。
总数为 b+2b+8b+24b=35b=280b + 2b + 8b + 24b = 35b = 280,所以 b=8b = 8,樱桃有 8b=648b = 64 颗。
因此,正确答案是 D。
Let bb be the number of blueberries. Then there are 2b2b raspberries, 4⋅2b=8b4 \cdot 2b = 8b cherries, and 3⋅8b=24b3 \cdot 8b = 24b grapes.
The total is b+2b+8b+24b=35b=280,b + 2b + 8b + 24b = 35b = 280, so b=8b = 8 and there are 8b=648b = 64 cherries.
Thus, the correct answer is D.

6.

三个非负整数两两相加得到的和分别为 1212,1717 和 1919。这三个数中的中间那个数是多少?
The sums of three whole numbers taken in pairs are 12,12, 17,17, and 19.19. What is the middle number?
44
55
66
77
88
知识点:方程组
难度评级:1050
小提示:
把三个两两和相加。
Add the three pair sums
大提示:
三个两两和的总和是三个数总和的两倍。
The total of the three pair sums is twice the sum of the three numbers
解答:
设三个数为 a,b,ca, b, c,且 a<b<ca \lt b \lt c。由于三个和都不同,所以这三个数也互不相等。
题意给出 a+b=12,a+c=17, a + b = 12, a + c = 17\text{,} 以及 b+c=19。 b + c = 19\text{。}
把三式相加,得到 2(a+b+c)=48。 2(a + b + c) = 48\text{。}
因此 a+b+c=24, a + b + c = 24\text{,} 再减去 a+c=17, a + c = 17\text{,} 得到 b=7b = 7。
所以正确答案是 D。
Let the three numbers be a,b,ca, b, c where a<b<c.a \lt b \lt c. None of them are equal, since all three sums are different.
Then a+b=12,a+c=17, a + b = 12, a + c = 17, and b+c=19. b + c = 19.
Adding all three equations together gives us 2(a+b+c)=48. 2(a + b + c) = 48.
Then a+b+c=24, a + b + c = 24, from which we can subtract a+c=17, a + c = 17, to get b=7.b = 7.
Thus, D is the correct answer.

7.

Mary 把一个圆分成 1212 个扇形。这些扇形的圆心角度数都是整数,并且构成一个等差数列。最小的扇形角的度数最小可能是多少?
Mary divides a circle into 1212 sectors. The central angles of these sectors, measured in degrees, are all integers and they form an arithmetic sequence. What is the degree measure of the smallest possible sector angle?
55
66
88
1010
1212
难度评级:1330
小提示:
设等差数列为 a,a+d,…,a+11da,a+d,\ldots,a+11d。
Let the arithmetic sequence be a,a+d,…,a+11da,a+d,\ldots,a+11d
大提示:
使用 12a+66d=36012a+66d=360,并在 aa 保持正数时让 dd 尽可能大。
Use 12a+66d=36012a+66d=360 and maximize dd while keeping aa positive
解答:
设最小扇形角为 aa,等差数列的公差为 dd。
于是 122(a+a+11d)=12a+66d \dfrac{12}{2}(a + a + 11d) = 12a + 66d 就是这个等差数列的和。
总和是 360360,所以 12a+66d=360 12a + 66d = 360 2a+11d=60。 2a + 11d = 60\text{。}
要使 aa 尽可能小,就要让 dd 尽可能大。若 d=5d = 5,则 aa 不是整数;因此 d=4d = 4,且 a=8a = 8。
所以正确答案是 C。
Let aa be the smallest possible sector angle and dd be the difference in the arithmetic sequence.
Then we have that 122(a+a+11d)=12a+66d \dfrac{12}{2}(a + a + 11d) = 12a + 66d is the sum of the arithmetic sequence.
We have that this sums to 360,360, so 12a+66d=360 12a + 66d = 360 2a+11d=60. 2a + 11d = 60.
We want to minimize a,a, so we maximize d.d. If d=5,d = 5, then aa is not an integer, so d=4d = 4 and a=8.a = 8.
Thus, C is the correct answer.

8.

数 11、22、33、44 和 55 的迭代平均数按如下方式计算。把这五个数按某种顺序排列。先求前两个数的平均数,再求它与第三个数的平均数,然后求所得结果与第四个数的平均数,最后求所得结果与第五个数的平均数。用这个过程能得到的最大可能值与最小可能值之差是多少?
An iterative average of the numbers 1,1, 2,2, 3,3, 4,4, and 55 is computed the following way. Arrange the five numbers in some order. Find the mean of the first two numbers, then find the mean of that with the third number, then the mean of that with the fourth number, and finally the mean of that with the fifth number. What is the difference between the largest and smallest possible values that can be obtained using this procedure?
3116\dfrac{31}{16}
22
178\dfrac{17}{8}
33
6516\dfrac{65}{16}
难度评级:1540
小提示:
把最终的平均数写成一个加权和。
Write the final average as a weighted sum
大提示:
后放入的数权重更大。
Later entries receive larger weights
解答:
设排列顺序为 a,b,c,d,e。 a, b, c, d, e\text{。}
则迭代平均数为 a+b2+c2+d2+e2 \dfrac{\dfrac{\dfrac{\dfrac{a + b}{2} + c}{2} + d}{2} + e}{2}=a+b+2c+4d+8e16。 = \dfrac{a + b + 2c + 4d + 8e}{16}\text{。}
要使结果最小,应按 5,4,3,2,1, 5, 4, 3, 2, 1\text{,} 排列,得到 5+4+6+8+816=3116。 \dfrac{5 + 4 + 6 + 8 + 8}{16} = \dfrac{31}{16}\text{。}
要使结果最大,则反过来排列,得到 1+2+6+16+4016=6516。 \dfrac{1 + 2 + 6 + 16 + 40}{16} = \dfrac{65}{16}\text{。}
两者之差为 6516−3116=3416=178。 \dfrac{65}{16} - \dfrac{31}{16} = \dfrac{34}{16} = \dfrac{17}{8}\text{。}
所以正确答案是 C。
Let the order of the numbers be a,b,c,d,e. a, b, c, d, e.
Then the iterative average is a+b2+c2+d2+e2 \dfrac{\dfrac{\dfrac{\dfrac{a + b}{2} + c}{2} + d}{2} + e}{2}=a+b+2c+4d+8e16. = \dfrac{a + b + 2c + 4d + 8e}{16}.
To minimize this, we make the order 5,4,3,2,1, 5, 4, 3, 2, 1, which gives us a sum of 5+4+6+8+816=3116. \dfrac{5 + 4 + 6 + 8 + 8}{16} = \dfrac{31}{16}.
To maximize it, we have to reverse this order to get an average of 1+2+6+16+4016=6516. \dfrac{1 + 2 + 6 + 16 + 40}{16} = \dfrac{65}{16}.
The difference between these is 6516−3116=3416=178. \dfrac{65}{16} - \dfrac{31}{16} = \dfrac{34}{16} = \dfrac{17}{8}.
Thus, C is the correct answer.

9.

根据闰年规则,年份能被 400400 整除就是闰年,例如 20002000 年;或者能被 44 整除但不能被 100100 整除也是闰年,例如 20122012 年。Charles Dickens 诞辰 200200 周年的庆祝日是 20122012 年二月 77 日,星期二。他出生那天是星期几?
A year is a leap year if and only if the year number is divisible by 400400 (such as 20002000) or is divisible by 44 but not 100100 (such as 20122012). The 200200th anniversary of the birth of novelist Charles Dickens was celebrated on February 7,7, 2012,2012, a Tuesday. On what day of the week was Dickens born?
星期五
Friday
星期六
Saturday
星期日
Sunday
星期一
Monday
星期二
Tuesday
难度评级:1540
小提示:
按模 77 计算星期几的偏移。
Count day shifts modulo 77
大提示:
这 200200 年中要计入闰日,但 19001900 年不是闰年。
In 200200 years, include leap days but exclude 19001900
解答:
平年有 365365 天,向未来移动一年,星期几会向后移动一天,因为 365=52⋅7+1。 365 = 52 \cdot 7 + 1\text{。}
闰年有额外的一天,所以星期几会向后移动两天。
在 18121812 年到 20122012 年之间,有五十个年份是 44 的倍数,但要去掉 19001900 年,所以共有 4949 个闰年。
因此,往回推 200200 年需要往回移动 200+49=249=35⋅7+4 200 + 49 = 249 = 35 \cdot 7 + 4 天,也就是星期几往回移动 44 天。
星期二往前推四天是星期五,也就是 18121812 年二月 77 日。
所以正确答案是 A。
On a typical year with 365365 days, moving one year into the future moves the day of the week forward one since 365=52⋅7+1. 365 = 52 \cdot 7 + 1.
On a leap year however, the day of the week gets moved forward twice since there is an extra day.
Fifty of the years between 20122012 and 18121812 are multiples of 4,4, but we have to discard 1900,1900, which leaves us with 4949 leap years.
Therefore, moving back 200200 years means we have to go back 200+49=249=35⋅7+4 200 + 49 = 249 = 35 \cdot 7 + 4 days, which means we move back 44 days in the week.
This takes us back to Friday, which is the day that corresponds to February 7,7, 1812.1812.
Thus, A is the correct answer.

10.

一个三角形面积为 3030,有一条边长为 1010,到这条边的中线长为 99。设 θ\theta 为这条边与该中线形成的锐角。求 sin⁡θ\sin\theta?
A triangle has area 30,30, one side of length 10,10, and the median to that side of length 9.9. Let θ\theta be the acute angle formed by that side and the median. What is sin⁡θ?\sin\theta?
310\dfrac{3}{10}
13\dfrac{1}{3}
920\dfrac{9}{20}
23\dfrac{2}{3}
910\dfrac{9}{10}
难度评级:1610
小提示:
中线把一个三角形分成面积相等的两个三角形
A median splits a triangle into two pieces of equal area
大提示:
其中一个半三角形的两边为 55 和 99,夹角为 θ\theta,面积为 1515
One half-triangle has sides 55 and 99 with included angle θ\theta and area 1515
解答:
这条中线把原三角形分成两个面积相等的三角形,每个面积为 1515。其中一个三角形有两条边长分别为 55(底边的一半)和 99(中线),它们的夹角为 θ\theta。
它的面积为 12⋅5⋅9sin⁡θ=15\tfrac12 \cdot 5 \cdot 9 \sin\theta = 15,所以 sin⁡θ=2⋅155⋅9=23\sin\theta = \dfrac{2 \cdot 15}{5 \cdot 9} = \dfrac{2}{3}。
因此,正确答案是 D。
The median divides the triangle into two triangles of equal area 15.15. One of them has the two sides of length 55 (half the base) and 99 (the median) meeting at angle θ.\theta.
Its area is 12⋅5⋅9sin⁡θ=15,\tfrac12 \cdot 5 \cdot 9 \sin\theta = 15, so sin⁡θ=2⋅155⋅9=23.\sin\theta = \dfrac{2 \cdot 15}{5 \cdot 9} = \dfrac{2}{3}.
Thus, the correct answer is D.

11.

Alex、Mel 和 Chelsea 玩一个有 66 轮的游戏。每一轮只有一个获胜者,且各轮结果相互独立。每一轮 Alex 获胜的概率是 12\dfrac12,Mel 获胜的可能性是 Chelsea 的两倍。Alex 赢三轮、Mel 赢二轮、Chelsea 赢一轮的概率是多少?
Alex, Mel, and Chelsea play a game that has 66 rounds. In each round there is a single winner, and the outcomes of the rounds are independent. For each round the probability that Alex wins is 12,\dfrac12, and Mel is twice as likely to win as Chelsea. What is the probability that Alex wins three rounds, Mel wins two rounds, and Chelsea wins one round?
572\dfrac{5}{72}
536\dfrac{5}{36}
16\dfrac{1}{6}
13\dfrac{1}{3}
11
难度评级:1540
小提示:
先求出每位玩家每轮获胜的概率
First find each player’s per-round win probability
大提示:
因为 P(Mel)+P(Chelsea)=12P(\text{Mel}) + P(\text{Chelsea}) = \dfrac12 且 P(Mel)=2P(Chelsea)P(\text{Mel}) = 2P(\text{Chelsea}),再乘以排列数 6!3! 2! 1!\dfrac{6!}{3!\,2!\,1!}
Since P(Mel)+P(Chelsea)=12P(\text{Mel}) + P(\text{Chelsea}) = \dfrac12 and P(Mel)=2P(Chelsea),P(\text{Mel}) = 2P(\text{Chelsea}), multiply by the number 6!3! 2! 1!\dfrac{6!}{3!\,2!\,1!} of arrangements
解答:
Alex 获胜的概率为 12\tfrac12,其余两人共享剩下的 12\tfrac12。因为 Mel 获胜的可能性是 Chelsea 的两倍,P(Mel)=13P(\text{Mel}) = \tfrac13,P(Chelsea)=16P(\text{Chelsea}) = \tfrac16。
获胜顺序 AAAMMCAAAMMC 的排列数为 6!3! 2! 1!=60\dfrac{6!}{3!\,2!\,1!} = 60。概率为 60⋅(12)3(13)2(16)=60432=536。 \begin{aligned} 60 \cdot \left(\tfrac12\right)^3 \left(\tfrac13\right)^2 \left(\tfrac16\right) &= \frac{60}{432} \\ &= \frac{5}{36} \end{aligned}\text{。}
因此,正确答案是 B。
Since Alex wins with probability 12,\tfrac12, the others share the remaining 12.\tfrac12. With Mel twice as likely as Chelsea, P(Mel)=13P(\text{Mel}) = \tfrac13 and P(Chelsea)=16.P(\text{Chelsea}) = \tfrac16.
The number of orderings of the wins AAAMMCAAAMMC is 6!3! 2! 1!=60.\dfrac{6!}{3!\,2!\,1!} = 60. The probability is 60⋅(12)3(13)2(16)=60432=536. \begin{aligned} 60 \cdot \left(\tfrac12\right)^3 \left(\tfrac13\right)^2 \left(\tfrac16\right) &= \frac{60}{432} \\ &= \frac{5}{36}. \end{aligned}
Thus, the correct answer is B.

12.

一个正方形区域 ABCDABCD 在边 CDCD 上的点 (0,1)(0, 1) 处与方程为 x2+y2=1x^2 + y^2 = 1 的圆外切。顶点 AA 和 BB 在方程为 x2+y2=4x^2 + y^2 = 4 的圆上。这个正方形的边长是多少?
A square region ABCDABCD is externally tangent to the circle with equation x2+y2=1x^2 + y^2 = 1 at the point (0,1)(0, 1) on the side CD.CD. Vertices AA and BB are on the circle with equation x2+y2=4.x^2 + y^2 = 4. What is the side length of this square?
10+510\dfrac{\sqrt{10} + 5}{10}
255\dfrac{2\sqrt{5}}{5}
223\dfrac{2\sqrt{2}}{3}
219−45\dfrac{2\sqrt{19} - 4}{5}
9−175\dfrac{9 - \sqrt{17}}{5}
难度评级:1770
小提示:
利用关于 yy 轴的对称性,设 A=(a,b)A = (a, b),B=(−a,b)B = (-a, b)
Use the symmetry across the yy-axis to write A=(a,b)A = (a, b) and B=(−a,b)B = (-a, b)
大提示:
边长水平方向为 2a2a,竖直方向为 b−1b - 1,所以 b=2a+1b = 2a + 1;代入 a2+b2=4a^2 + b^2 = 4
The side length is 2a2a horizontally and b−1b - 1 vertically, so b=2a+1b = 2a + 1; substitute into a2+b2=4a^2 + b^2 = 4
解答:
由对称性,设 A=(a,b)A = (a, b),其中 a>0a \gt 0,且 B=(−a,b)B = (-a, b)。正方形位于切点 (0,1)(0,1) 上方,所以它的水平宽度为 2a2a,高度为 b−1b - 1。
由于二者相等,2a=b−12a = b - 1,因此 b=2a+1b = 2a + 1。
代入 a2+b2=4a^2 + b^2 = 4,得到 5a2+4a−3=05a^2 + 4a - 3 = 0。正根为 a=19−25a = \dfrac{\sqrt{19} - 2}{5},所以边长为 2a=219−452a = \dfrac{2\sqrt{19} - 4}{5}。
因此,正确答案是 D。
By symmetry let A=(a,b)A = (a, b) with a>0a \gt 0 and B=(−a,b).B = (-a, b). The square sits on the tangent point (0,1),(0,1), so its horizontal width is 2a2a and its height is b−1.b - 1.
Since these are equal, 2a=b−1,2a = b - 1, giving b=2a+1.b = 2a + 1.
Substituting into a2+b2=4a^2 + b^2 = 4 yields 5a2+4a−3=0.5a^2 + 4a - 3 = 0. The positive root is a=19−25,a = \dfrac{\sqrt{19} - 2}{5}, so the side length is 2a=219−45.2a = \dfrac{2\sqrt{19} - 4}{5}.
Thus, the correct answer is D.

13.

油漆工 Paula 和她的两名助手各自以固定但不同的速度刷漆。他们总是上午 8:008:00 开始工作,并且三人每天午餐休息的时间相同。
星期一,三人一起刷完了一栋房子的 50%50\%,并在下午 4:004:00 停工。星期二,Paula 不在,两名助手只刷完了房子的 24%24\%,并在下午 2:122:12 停工。星期三,Paula 独自工作,到晚上 7:127:12 完成整栋房子。
每天的午餐休息是多少分钟?
Paula the painter and her two helpers each paint at constant, but different, rates. They always start at 8:008:00 AM, and all three always take the same amount of time to eat lunch.
On Monday the three of them painted 50%50\% of a house, quitting at 4:004:00 PM. On Tuesday, when Paula wasn’t there, the two helpers painted only 24%24\% of the house and quit at 2:122:12 PM. On Wednesday Paula worked by herself and finished the house by working until 7:127:12 P.M.
How long, in minutes, was each day’s lunch break?
3030
3636
4242
4848
6060
知识点:速率方程组
难度评级:1940
小提示:
设午餐休息为 mm 分钟。
Let the lunch break be mm minutes
大提示:
使用星期一对应 p+hp+h,星期二对应 hh,星期三对应 pp。
Use Monday for p+hp+h, Tuesday for hh, and Wednesday for pp
解答:
设午餐休息为 mm 分钟,Paula 的工作速度为每分钟 pp 个百分点,两名助手的合计速度为每分钟 hh 个百分点。
星期一给出 (p+h)(480−m)=50(p+h)(480-m)=50。星期二给出 h(372−m)=24h(372-m)=24。星期三剩余工作量为百分之 2626,所以 p(672−m)=26p(672-m)=26。
由后两式相加再减去第一式,得到 108h−192p=0108h-192p=0,所以 h=169ph=\dfrac{16}{9}p。
代入星期一的方程得 259p(480−m)=50\dfrac{25}{9}p(480-m)=50,而星期三方程为 p(672−m)=26p(672-m)=26。联立解得 m=48m=48。
所以正确答案是 D。
Let the lunch break be mm minutes, Paula’s rate be pp percent per minute, and the helpers’ combined rate be hh percent per minute.
Monday gives (p+h)(480−m)=50(p+h)(480-m)=50. Tuesday gives h(372−m)=24h(372-m)=24. Since the remaining work on Wednesday was 2626 percent, Wednesday gives p(672−m)=26p(672-m)=26.
Adding the Tuesday and Wednesday equations and subtracting the Monday equation gives 108h−192p=0108h-192p=0, so h=169ph=\dfrac{16}{9}p.
Substituting into Monday gives 259p(480−m)=50\dfrac{25}{9}p(480-m)=50, while Wednesday gives p(672−m)=26p(672-m)=26. Solving these two equations gives m=48m=48.
Thus, D is the correct answer.

14.

图中的闭合曲线由 99 段全等圆弧组成,每段圆弧长为 2π3\dfrac{2\pi}{3},每段对应圆的圆心都是边长为 22 的正六边形的某个顶点。该闭合曲线围成的面积是多少?
The closed curve in the figure is made up of 99 congruent circular arcs each of length 2π3,\dfrac{2\pi}{3}, where each of the centers of the corresponding circles is among the vertices of a regular hexagon of side 2.2. What is the area enclosed by the curve?
2π+62\pi+6
2π+432\pi+4\sqrt{3}
3π+43\pi+4
2π+33+22\pi+3\sqrt{3}+2
π+63\pi+6\sqrt{3}
难度评级:1900
小提示:
每段圆弧都是单位圆上的 120∘120^\circ 弧。
Each arc is a 120∘120^\circ arc of a unit circle
大提示:
把这些扇形块围绕正六边形重新拼接。
Rearrange the sector pieces around the regular hexagon
解答:
每段圆弧的半径都是 11,长度都是 2π3\frac{2\pi}{3},所以对应的各个扇形面积都相同。如图所示,这些扇形块可以重新拼接:添加到正六边形上的部分合起来恰好构成一个单位圆。
正六边形由六个边长为 22 的等边三角形拼成,所以它的面积为 6(34⋅22)=63。6\left(\dfrac{\sqrt3}{4}\cdot2^2\right)=6\sqrt3\text{。} 再加上那个单位圆,围成的总面积为 π+63\pi+6\sqrt3。
所以正确答案是 E。
Each arc has radius 11 and length 2π3,\frac{2\pi}{3}, so the corresponding circular sectors all have the same area. As the diagram shows, the sector pieces may be rearranged: everything added to the regular hexagon combines to exactly one unit circle.
The regular hexagon is made of six equilateral triangles of side 2,2, so its area is 6(34⋅22)=63.6\left(\dfrac{\sqrt3}{4}\cdot2^2\right)=6\sqrt3. Adding the unit circle gives a total enclosed area of π+63.\pi+6\sqrt3.
Thus, E is the correct answer.

15.

一个 3×33 \times 3 的正方形被分成 99 个单位小方格。每个小方格独立随机地染成白色或黑色,两种颜色的可能性相同。
然后把整个正方形绕中心顺时针旋转 90∘90^{\circ},并把每个位于原来黑格位置上的白格染成黑色,其余方格的颜色都保持不变。最终整个网格全为黑色的概率是多少?
A 3×33 \times 3 square is partitioned into 99 unit squares. Each unit square is painted either white or black with each color being equally likely, chosen independently and at random.
The square is then rotated 90∘90^{\circ} clockwise about its center, and every white square in a position formerly occupied by a black square is painted black. The colors of all other squares are left unchanged. What is the probability the grid is now entirely black?
49512\dfrac{49}{512}
764\dfrac{7}{64}
1211024\dfrac{121}{1024}
81512\dfrac{81}{512}
932\dfrac{9}{32}
难度评级:1960
小提示:
四个角在旋转下形成一个 44 循环。
Corner squares form a 44-cycle under rotation
大提示:
对每个 44 循环,数出不会让白格接到白色前驱的染色情况。
For each 44-cycle, count colorings with no white square receiving a white predecessor
解答:
中心格必须一开始就是黑色,贡献概率 12\dfrac12。四个角在旋转下形成一个循环,四个边中点也形成另一个相同的循环。
对一个 44 循环,除非有一个白格被旋转到原本也是白格的位置,否则最后四个位置都会变黑。成功的初始颜色序列为 BBBBBBBB、BBBWBBBW 的四种旋转,以及 BWBWBWBW 的两种旋转,共 77 种,占 1616 种。
边中点循环有相同的独立计数。因此概率为 12(716)2=49512\dfrac12\left(\dfrac7{16}\right)^2=\dfrac{49}{512}。
所以正确答案是 A。
The center square must initially be black, contributing probability 12\dfrac12. The four corner squares form one cycle under the rotation, and the four edge-middle squares form another identical cycle.
For one 44-cycle, the final four positions are all black unless a white square is rotated into a position that was also white. The successful initial colorings are BBBBBBBB, the four rotations of BBBWBBBW, and the two rotations of BWBWBWBW, for 77 colorings out of 1616.
The same count applies to the edge-middle cycle, independently. Therefore the probability is 12(716)2=49512\dfrac12\left(\dfrac7{16}\right)^2=\dfrac{49}{512}.
Thus, A is the correct answer.

16.

圆 C1C_1 的圆心 OO 在圆 C2C_2 上。两个圆相交于 XX 和 YY。点 ZZ 在 C1C_1 外部,且在圆 C2C_2 上,并满足 XZ=13XZ = 13,OZ=11OZ = 11,YZ=7YZ = 7。圆 C1C_1 的半径是多少?
Circle C1C_1 has its center OO lying on circle C2.C_2. The two circles meet at XX and Y.Y. Point ZZ in the exterior of C1C_1 lies on circle C2C_2 and XZ=13,XZ = 13, OZ=11,OZ = 11, and YZ=7.YZ = 7. What is the radius of circle C1?C_1?
55
26\sqrt{26}
333\sqrt{3}
272\sqrt{7}
30\sqrt{30}
知识点:余弦定理弦圆
难度评级:1870
小提示:
设半径为 rr,则 OX=OY=rOX = OY = r;这些是 C2C_2 的等弦,因此在 ZZ 处所对的角相等
Let rr be the radius, so OX=OY=rOX = OY = r; these equal chords of C2C_2 subtend equal angles at ZZ
大提示:
对三角形 XZOXZO 和 YZOYZO 使用余弦定理,并令两个 cos⁡∠Z\cos\angle Z 的表达式相等
Apply the Law of Cosines to triangles XZOXZO and YZOYZO and set the two expressions for cos⁡∠Z\cos\angle Z equal
解答:
设 C1C_1 的半径为 rr,所以 OX=OY=rOX = OY = r。它们是 C2C_2 的等弦,因此在 ZZ 处所对角相等:∠XZO=∠OZY\angle XZO = \angle OZY。
对三角形 XZOXZO 和 YZOYZO 使用余弦定理,132+112−r22⋅13⋅11=72+112−r22⋅7⋅11。 \begin{aligned} &\frac{13^2 + 11^2 - r^2}{2 \cdot 13 \cdot 11} \\ &= \frac{7^2 + 11^2 - r^2}{2 \cdot 7 \cdot 11} \end{aligned}\text{。}
清去分母并求解,得到 r2=30r^2 = 30,所以 r=30r = \sqrt{30}。
因此,正确答案是 E。
Let rr be the radius of C1,C_1, so OX=OY=r.OX = OY = r. These are equal chords of C2,C_2, so they subtend equal angles at Z:Z: ∠XZO=∠OZY.\angle XZO = \angle OZY.
Applying the Law of Cosines to triangles XZOXZO and YZO,YZO, 132+112−r22⋅13⋅11=72+112−r22⋅7⋅11. \begin{aligned} &\frac{13^2 + 11^2 - r^2}{2 \cdot 13 \cdot 11} \\ &= \frac{7^2 + 11^2 - r^2}{2 \cdot 7 \cdot 11}. \end{aligned}
Clearing denominators and solving gives r2=30,r^2 = 30, so r=30.r = \sqrt{30}.
Thus, the correct answer is E.

17.

设 SS 是 {1,2,3,…,30}\{1, 2, 3, \ldots, 30\} 的一个子集,且 SS 中任意两个不同元素的和都不能被 55 整除。SS 的最大可能大小是多少?
Let SS be a subset of {1,2,3,…,30}\{1, 2, 3, \ldots, 30\} with the property that no pair of distinct elements in SS has a sum divisible by 5.5. What is the largest possible size of S?S?
1010
1313
1515
1616
1818
难度评级:1800
小提示:
按模 55 的余数给这些数分类;每一类都有 66 个数
Sort the numbers by their remainder modulo 55; there are 66 numbers in each class
大提示:
余数 11 和 44 不能同时出现,22 和 33 也不能同时出现,并且最多只能选一个 55 的倍数
Residues 11 and 44 cannot both appear, nor can 22 and 3,3, and at most one multiple of 55 is allowed
解答:
按模 55 的余数将 {1,…,30}\{1, \ldots, 30\} 分组;每类有 66 个数。当余数组合为 0+00{+}0、1+41{+}4 或 2+32{+}3 时,和能被 55 整除。
因此 SS 最多使用一个 ≡0\equiv 0 的数,并且在 {1},{4}\{1\}, \{4\} 两类中最多选一类,在 {2},{3}\{2\}, \{3\} 两类中最多选一类。这最多允许 1+6+6=131 + 6 + 6 = 13 个数。
集合 {1,2,6,7,11,12\{1, 2, 6, 7, 11, 12 16,17,21,2216, 17, 21, 22 26,27,30}26, 27, 30\} 可以达到 1313,所以最大值为 1313。
因此,正确答案是 B。
Group {1,…,30}\{1, \ldots, 30\} by residue modulo 5;5; each class has 66 numbers. A sum is divisible by 55 when the residues are 0+0,0{+}0, 1+4,1{+}4, or 2+3.2{+}3.
So SS can use at most one number ≡0,\equiv 0, and only one of the classes {1},{4}\{1\}, \{4\} and only one of {2},{3}.\{2\}, \{3\}. That allows at most 1+6+6=131 + 6 + 6 = 13 numbers.
The set {1,2,6,7,11,12,\{1, 2, 6, 7, 11, 12, 16,17,21,22,16, 17, 21, 22, 26,27,30}26, 27, 30\} achieves 13,13, so the maximum is 13.13.
Thus, the correct answer is B.

18.

三角形 ABCABC 满足 AB=27AB = 27、AC=26AC = 26、BC=25BC = 25。设 II 为 △ABC\triangle ABC 内角平分线的交点。求 BIBI?
Triangle ABCABC has AB=27,AB = 27, AC=26,AC = 26, and BC=25.BC = 25. Let II denote the intersection of the internal angle bisectors of △ABC.\triangle ABC. What is BI?BI?
1515
5+26+335 + \sqrt{26} + 3\sqrt{3}
3263\sqrt{26}
23546\dfrac{2}{3}\sqrt{546}
939\sqrt{3}
难度评级:1980
小提示:
从 II 向边作垂线;从 BB 引出的切线段长度为 s−bs - b
Drop perpendiculars from II to the sides; the tangent segment from BB has length s−bs - b
大提示:
用面积 =rs= rs 和海伦公式求内切圆半径,再使用两直角边为 rr 和 BDBD 的直角三角形
Find the inradius from area =rs= rs and Heron’s formula, then use the right triangle with legs rr and BDBD
解答:
设 DD 为内心 II 到 BCBC 的垂足。切线段长度 BD=s−ACBD = s - AC,其中 s=12(25+26+27)=39s = \tfrac12(25 + 26 + 27) = 39,所以 BD=39−26=13BD = 39 - 26 = 13。
由海伦公式,面积为 39⋅14⋅13⋅12\sqrt{39 \cdot 14 \cdot 13 \cdot 12},内切圆半径满足 r2=(s−a)(s−b)(s−c)sr^2 = \dfrac{(s-a)(s-b)(s-c)}{s} =14⋅13⋅1239= \dfrac{14 \cdot 13 \cdot 12}{39} =56= 56。
在直角三角形 BDIBDI 中,BI2=r2+BD2BI^2 = r^2 + BD^2 =56+169= 56 + 169 =225= 225,所以 BI=15BI = 15。
因此,正确答案是 A。
Let DD be the foot of the perpendicular from the incenter II to BC.BC. The tangent length BD=s−AC,BD = s - AC, where s=12(25+26+27)=39,s = \tfrac12(25 + 26 + 27) = 39, so BD=39−26=13.BD = 39 - 26 = 13.
By Heron’s formula the area is 39⋅14⋅13⋅12,\sqrt{39 \cdot 14 \cdot 13 \cdot 12}, and the inradius satisfies r2=(s−a)(s−b)(s−c)sr^2 = \dfrac{(s-a)(s-b)(s-c)}{s} =14⋅13⋅1239= \dfrac{14 \cdot 13 \cdot 12}{39} =56.= 56.
In right triangle BDI,BDI, BI2=r2+BD2BI^2 = r^2 + BD^2 =56+169= 56 + 169 =225,= 225, so BI=15.BI = 15.
Thus, the correct answer is A.

19.

Adam、Benin、Chiang、Deshawn、Esther 和 Fiona 都有网络账号。在这六个人之间,有些但不是所有人互为好友;他们没有小组外的好友。若每个人的好友数都相同,则可能的好友关系图共有多少种?
Adam, Benin, Chiang, Deshawn, Esther, and Fiona have internet accounts. Some, but not all, of them are internet friends with each other, and none of them has an internet friend outside this group. Each of them has the same number of internet friends. In how many different ways can this happen?
6060
170170
290290
320320
660660
难度评级:2140
小提示:
按共同的好友数分类。
Case on the common number of friends
大提示:
好友图的补图会把度数 11 与 44、度数 22 与 33 配对。
Use complements to pair the 11-friend and 44-friend cases, and the 22-friend and 33-friend cases
解答:
按每个人拥有的好友数分类。由于好友图既不是空图也不是完全图,这个数从 11 到 44。
注意,11 个好友和 22 个好友的情况,分别通过取补图与 44 个好友和 33 个好友的情况对应,因为确定谁是好友也就确定了谁不是好友。
情况 11:每个人有 11 个好友
这意味着 66 个人必须分成 33 对,每对中的两人互为好友。
第一个人的好友有 55 种选择,剩下 44 个人。
下一位未配对者的好友有 33 种选择,剩余的 22 个人则必须互为好友。
因此这种情况共有 3⋅5=153 \cdot 5 = 15 种可能。
情况 22:每个人有 22 个好友
这种情况有两种可能。第一种是分成两个三人组,每组三人彼此都是好友。
选择第一个三人组有 (63)=20\binom{6}{3} = 20 种方法。由于两个组可以互换,必须除以 22,得到 20÷2=1020 \div 2 = 10 种配置。
第二种可能是好友关系形成一个 66 环。
六个人沿环的每一种排列都给出这样的图。选择起点会使每个图被计算 66 次,选择遍历方向又会被计算 22 次,因此不同的 66 环共有 6!6⋅2=60\frac{6!}{6\cdot2}=60 个。再加上 1010 个两三角形配置,本情况共有 10+60=7010+60=70 种配置。
所以总配置数为 2(15+70)=170。 2(15 + 70) = 170\text{。}
所以正确答案是 B。
We case on the value of friends that each person has. This value ranges from 11 to 44, since the graph is neither empty nor complete.
Note that the cases for 11 and 22 friends correspond with the case for 44 and 33 friends, since choosing who are friends determines who are not friends.
Case 1:1: everyone has 11 friend
This means that the 66 people must split up into 33 pairs where the people in each pair are friends.
There are 55 choices for the friend for the first person. This leaves 44 people remaining.
There are then 33 choices for the friend of the next unpaired person. The remaining 22 people are then forced to be friends.
Therefore, there are 3⋅5=153 \cdot 5 = 15 possibilities for this case.
Case 2:2: everyone has 22 friends
There are two possibilities for this case. There could be two triples where everyone in a triple is friends with each other.
For this possibility, there are (63)=20\binom{6}{3} = 20 ways to choose the people in the first triple. We have to divide by 22 since we can swap the pairs. This gives us 20÷2=1020 \div 2 = 10 configurations.
The second possibility is that the friends form one 66-cycle.
Every ordering of the six people around a cycle gives such a graph. Each graph is counted 66 times by the choice of starting person and 22 times by the direction of traversal, so there are 6!6⋅2=60\frac{6!}{6\cdot2}=60 distinct 66-cycles. Together with the 1010 pairs of triangles, this case has 10+60=7010+60=70 configurations.
The total number of arrangements is then 2(15+70)=170. 2(15 + 70) = 170.
Thus, B is the correct answer.

20.

考虑多项式 P(x)=∏k=010(x2k+2k)=(x+1)(x2+2)(x4+4)⋯(x1024+1024)。 \begin{aligned} P(x) &= \prod_{k=0}^{10}\left(x^{2^k} + 2^k\right) \\ &= (x+1)(x^2+2)(x^4+4) \\ &\quad \cdots (x^{1024}+1024) \end{aligned}\text{。}
x2012x^{2012} 的系数等于 2a2^a。求 aa?
Consider the polynomial P(x)=∏k=010(x2k+2k)=(x+1)(x2+2)(x4+4)⋯(x1024+1024). \begin{aligned} P(x) &= \prod_{k=0}^{10}\left(x^{2^k} + 2^k\right) \\ &= (x+1)(x^2+2)(x^4+4) \\ &\quad \cdots (x^{1024}+1024). \end{aligned}
The coefficient of x2012x^{2012} is equal to 2a.2^a. What is a?a?
55
66
77
1010
2424
难度评级:2220
小提示:
每个因子贡献 x2kx^{2^k} 项或常数项 2k2^k;被选中的指数之和必须为 20122012
Each factor contributes either its x2kx^{2^k} term or its constant 2k2^k; the chosen exponents must sum to 20122012
大提示:
将 20122012 写成若干个不同的二的幂之和只有一种方式,所以只有一项会产生 x2012x^{2012}。
There is only one way to write 20122012 as a sum of distinct powers of two, so exactly one term produces x2012x^{2012}
解答:
展开乘积时,次数为 20122012 的项来自某些因子中选取 x2kx^{2^k},使指数和为 20122012。由于二的幂互不相同,这对应于二进制表示 2012=1111101110022012 = 11111011100_2。
这个表示唯一,所以恰好只有一项给出 x2012x^{2012},它的系数是其余因子的常数项 2k2^k 的乘积:这些因子满足 k∈{0,1,5}k \in \{0, 1, 5\}。
系数为 20⋅21⋅25=262^0 \cdot 2^1 \cdot 2^5 = 2^6,所以 a=6a = 6。
因此,正确答案是 B。
Expanding the product, a term of degree 20122012 comes from choosing x2kx^{2^k} from some factors so that the exponents sum to 2012.2012. Since powers of two are distinct, this corresponds to the binary representation 2012=111110111002.2012 = 11111011100_2.
That representation is unique, so exactly one term gives x2012,x^{2012}, and its coefficient is the product of the constants 2k2^k from the remaining factors: those with k∈{0,1,5}.k \in \{0, 1, 5\}.
The coefficient is 20⋅21⋅25=26,2^0 \cdot 2^1 \cdot 2^5 = 2^6, so a=6.a = 6.
Thus, the correct answer is B.

21.

正整数 aa、bb 和 cc 满足 a≥b≥ca\ge b\ge c,且 a2−b2−c2+ab=2011a^2-b^2-c^2+ab=2011 以及 a2+3b2+3c2−3ab−2ac−2bca^2+3b^2+3c^2-3ab-2ac-2bc=−1997。=-1997\text{。} 求 aa。
Let a,a, b,b, and cc be positive integers with a≥b≥ca\ge b\ge c such that a2−b2−c2+ab=2011a^2-b^2-c^2+ab=2011 and a2+3b2+3c2−3ab−2ac−2bca^2+3b^2+3c^2-3ab-2ac-2bc=−1997.=-1997. What is a?a?
249249
250250
251251
252252
253253
难度评级:2220
小提示:
将两个方程相加,得到一个简洁的对称表达式
Add the two equations to get a clean symmetric expression
大提示:
和式化简为 (a−b)2(a-b)^2 +(b−c)2+ (b-c)^2 +(c−a)2=14+ (c-a)^2 = 14,且 14=32+22+1214 = 3^2 + 2^2 + 1^2 是唯一方式
The sum simplifies to (a−b)2(a-b)^2 +(b−c)2+ (b-c)^2 +(c−a)2=14,+ (c-a)^2 = 14, and 14=32+22+1214 = 3^2 + 2^2 + 1^2 uniquely
解答:
将两个方程相加,得到 2a2+2b2+2c22a^2 + 2b^2 + 2c^2 −2ab−2bc−2ca=14- 2ab - 2bc - 2ca = 14,即 (a−b)2+(b−c)2+(c−a)2=14。 \begin{aligned} &(a-b)^2 + (b-c)^2 \\ &\quad {}+ (c-a)^2 = 14 \end{aligned}\text{。}
将 1414 写成三个平方数之和的唯一方式是 9+4+19 + 4 + 1。由于 a≥b≥ca \ge b \ge c,有 a−c=3a - c = 3,且 (a−b,b−c)=(2,1)(a-b, b-c) = (2,1) 或 (1,2)(1,2)。
将 (a,b,c)=(c+3,c+1,c)(a, b, c) = (c+3, c+1, c) 代入第一个方程,得到 3(2c+3)+2(c+1)=20113(2c+3) + 2(c+1) = 2011,所以 c=250c = 250,(a,b,c)=(253,251,250)(a, b, c) = (253, 251, 250)。另一种情况没有整数解。
因此,正确答案是 E。
Adding the two equations gives 2a2+2b2+2c22a^2 + 2b^2 + 2c^2 −2ab−2bc−2ca=14,- 2ab - 2bc - 2ca = 14, that is, (a−b)2+(b−c)2+(c−a)2=14. \begin{aligned} &(a-b)^2 + (b-c)^2 \\ &\quad {}+ (c-a)^2 = 14. \end{aligned}
The only way to write 1414 as a sum of three squares is 9+4+1.9 + 4 + 1. Since a≥b≥c,a \ge b \ge c, we get a−c=3,a - c = 3, with either (a−b,b−c)=(2,1)(a-b, b-c) = (2,1) or (1,2).(1,2).
Substituting (a,b,c)=(c+3,c+1,c)(a, b, c) = (c+3, c+1, c) into the first equation gives 3(2c+3)+2(c+1)=2011,3(2c+3) + 2(c+1) = 2011, so c=250c = 250 and (a,b,c)=(253,251,250).(a, b, c) = (253, 251, 250). The other case has no integer solution.
Thus, the correct answer is E.

22.

不同平面 p1p_1、p2p_2、…\ldots、pkp_k 与立方体 QQ 的内部相交。设 SS 为 QQ 的各个面的并,且 P=⋃j=1kpjP = \bigcup_{j=1}^{k} p_j。PP 与 SS 的交集,由 QQ 的每个面上任意两条边的中点之间的所有线段的并组成。kk 的最大可能值与最小可能值之差是多少?
Distinct planes p1,p_1, p2,p_2, …,\ldots, pkp_k intersect the interior of a cube Q.Q. Let SS be the union of the faces of QQ and let P=⋃j=1kpj.P = \bigcup_{j=1}^{k} p_j. The intersection of PP and SS consists of the union of all segments joining the midpoints of every pair of edges belonging to the same face of Q.Q. What is the difference between the maximum and the minimum possible values of k?k?
88
1212
2020
2323
2424
难度评级:2460
小提示:
在每个面上,所画线段连接边的中点;将一个平面的截面分类为正方形、长方形、三角形或六边形
On each face the drawn segments join midpoints of edges; classify a plane’s cross-section as a square, rectangle, triangle, or hexagon
大提示:
对最大值,计算每种类型的所有平面;对最小值,用尽可能少的平面覆盖全部 2424 条短线段和 1212 条长线段
For the maximum, count all planes of each type; for the minimum, cover all 2424 short and 1212 long segments with as few planes as possible
解答:
在每个面上,所需线段都连接边的中点。一个平面截立方体时,会在各面上形成四种对称图形之一:经过中点的正方形(这样的平面有 33 个)、每条边对应一个长方形(1212 个平面)、每个顶点对应一个三角形(88 个平面),或每对相对顶点对应一个正六边形(44 个平面)。
全部使用时得到最大值 k=3+12+8+4=27k = 3 + 12 + 8 + 4 = 27。
完整图形由 2424 条短线段和 1212 条长线段组成。正方形平面所含短、长线段数为 (0,4)(0,4),长方形为 (2,2)(2,2),三角形为 (3,0)(3,0),六边形为 (6,0)(6,0)。给每条短线段权重 11,每条长线段权重 32\frac{3}{2}。每个平面覆盖的权重至多为 66,而全部所需线段的总权重为 24+(32)12=4224+(\frac{3}{2})12=42。因此至少需要 77 个平面。44 个六边形平面覆盖全部 2424 条短线段,33 个正方形平面覆盖全部 1212 条长线段,所以 k=7k=7 可以达到。
两者之差为 27−7=2027 - 7 = 20。
因此,正确答案是 C。
On every face, the required segments join midpoints of edges. A plane cutting the cube meets the faces in one of four symmetric shapes: a square through midpoints (33 such planes), a rectangle per edge (1212 planes), a triangle per vertex (88 planes), or a regular hexagon per pair of opposite vertices (44 planes).
Using all of them gives the maximum k=3+12+8+4=27.k = 3 + 12 + 8 + 4 = 27.
The full figure consists of 2424 short segments and 1212 long segments. A square plane contains (0,4),(0,4), a rectangle (2,2),(2,2), a triangle (3,0),(3,0), and a hexagon (6,0)(6,0) short and long segments, respectively. Give each short segment weight 11 and each long segment weight 32.\frac{3}{2}. Every plane then covers weight at most 6,6, whereas the required segments have total weight 24+(32)12=42.24+(\frac{3}{2})12=42. Thus at least 77 planes are needed. The 44 hexagon planes cover all 2424 short segments, and the 33 square planes cover all 1212 long segments, so k=7k=7 is attainable.
The difference is 27−7=20.27 - 7 = 20.
Thus, the correct answer is C.

23.

设 SS 是一个正方形,它的一条对角线端点为 (0.1,0.7)(0.1, 0.7) 和 (−0.1,−0.7)(-0.1, -0.7)。从所有实数 xx 和 yy 满足 0≤x≤20120 \le x \le 2012 且 0≤y≤20120 \le y \le 2012 的有序对中,均匀随机选取点 v=(x,y)v = (x, y)。设 T(v)T(v) 是 SS 的平移副本,并以 vv 为中心。由 T(v)T(v) 确定的正方形区域内部恰好包含两个整数坐标点的概率是多少?
Let SS be the square one of whose diagonals has endpoints (0.1,0.7)(0.1, 0.7) and (−0.1,−0.7).(-0.1, -0.7). A point v=(x,y)v = (x, y) is chosen uniformly at random over all pairs of real numbers xx and yy such that 0≤x≤20120 \le x \le 2012 and 0≤y≤2012.0 \le y \le 2012. Let T(v)T(v) be a translated copy of SS centered at v.v. What is the probability that the square region determined by T(v)T(v) contains exactly two points with integer coordinates in its interior?
0.1250.125
0.140.14
0.160.16
0.250.25
0.320.32
难度评级:2340
小提示:
正方形 SS 的对角线长度为 2\sqrt2,面积为 11;利用周期性,把问题化到一个单位晶格格子内
The square SS has diagonals of length 2\sqrt2 and area 1;1; by periodicity, reduce to one unit cell of the lattice
大提示:
T(v)T(v) 包含某个格点,当且仅当 vv 位于以该格点为中心的 SS 的副本内;包含两个格点需要 vv 位于相邻格点为中心的两个副本的重叠部分
T(v)T(v) contains a lattice point exactly when vv lies in the copy of SS centered there; containing two requires vv in the overlap of copies centered at adjacent lattice points
解答:
从 (0.1,0.7)(0.1, 0.7) 到 (−0.1,−0.7)(-0.1, -0.7) 的对角线长度为 0.22+1.42=2\sqrt{0.2^2 + 1.4^2} = \sqrt2,所以 SS 是面积为 11 的正方形。平移图形 T(v)T(v) 包含一个格点,当且仅当 vv 位于以该格点为中心的 SS 副本内部。
内部恰好包含两个格点,要求 vv 位于以两个相邻格点为中心的副本的重叠区域。由周期性,答案等于一个单位格内所有这类重叠区域的总面积。
考虑以 (0,0)(0,0) 和 (1,0)(1,0) 为中心的两个副本。它们的重叠区域是一个长方形。将所给半对角线旋转四分之一圈,可得到相关顶点 (0.7,−0.1)(0.7,-0.1) 和 (0.3,0.1)(0.3,0.1)。沿两组平行边找到交点,可得边长为 0.40.4 和 0.20.2,所以重叠面积是 0.080.08。对角位置的副本不重叠,而水平和竖直相邻的情形贡献相同。计入单位格边界后,概率为 2⋅0.08=0.162\cdot0.08=0.16。
因此,正确答案是 C。
The diagonal from (0.1,0.7)(0.1, 0.7) to (−0.1,−0.7)(-0.1, -0.7) has length 0.22+1.42=2,\sqrt{0.2^2 + 1.4^2} = \sqrt2, so SS is a square of area 1.1. The translate T(v)T(v) contains a lattice point exactly when vv lies inside the copy of SS centered at that point.
Containing exactly two interior lattice points requires vv to lie in the overlap of two copies centered at adjacent lattice points. By periodicity the answer is the total such overlap area within one unit cell.
Consider copies centered at (0,0)(0,0) and (1,0).(1,0). Their overlap is a rectangle. A quarter-turn of the listed half-diagonal gives the relevant vertices (0.7,−0.1)(0.7,-0.1) and (0.3,0.1).(0.3,0.1). Following the two pairs of parallel sides through their intersections gives side lengths 0.40.4 and 0.2,0.2, so the overlap area is 0.08.0.08. Diagonally centered copies do not overlap, and horizontal and vertical adjacencies contribute equally. Accounting for the cell boundaries gives probability 2⋅0.08=0.16.2\cdot0.08=0.16.
Thus, the correct answer is C.

24.

设 {ak}k=12011\{a_k\}_{k=1}^{2011} 为如下定义的实数序列:a1=0.201a_1 = 0.201,a2=(0.2011)a1a_2 = (0.2011)^{a_1},a3=(0.20101)a2a_3 = (0.20101)^{a_2},a4=(0.201011)a3a_4 = (0.201011)^{a_3}。更一般地,ak={(0.20101…0101⏟k+2 位数字)ak−1,若 k 为奇数,(0.20101…01011⏟k+2 位数字)ak−1,若 k 为偶数。 a_k = \begin{cases} \tiny \left(0.\underbrace{20101\ldots0101}_{k+2 \text{ 位数字}}\right)^{a_{k-1}}, & \tiny \text{若 } k \text{ 为奇数,} \\ \tiny \left(0.\underbrace{20101\ldots01011}_{k+2 \text{ 位数字}}\right)^{a_{k-1}}, & \tiny \text{若 } k \text{ 为偶数。} \end{cases}
将序列 {ak}k=12011\{a_k\}_{k=1}^{2011} 中的数按递减顺序重新排列,得到新序列 {bk}k=12011\{b_k\}_{k=1}^{2011}。求所有满足 ak=bka_k = b_k 的整数 kk(其中 1≤k≤20111 \le k \le 2011)的和。
Let {ak}k=12011\{a_k\}_{k=1}^{2011} be the sequence of real numbers defined by a1=0.201,a_1 = 0.201, a2=(0.2011)a1,a_2 = (0.2011)^{a_1}, a3=(0.20101)a2,a_3 = (0.20101)^{a_2}, and a4=(0.201011)a3,a_4 = (0.201011)^{a_3}, and more generally ak={(0.20101…0101⏟k+2 digits)ak−1,if k is odd,(0.20101…01011⏟k+2 digits)ak−1,if k is even. a_k = \begin{cases} \tiny \left(0.\underbrace{20101\ldots0101}_{k+2 \text{ digits}}\right)^{a_{k-1}}, & \tiny \text{if } k \text{ is odd,} \\ \tiny \left(0.\underbrace{20101\ldots01011}_{k+2 \text{ digits}}\right)^{a_{k-1}}, & \tiny \text{if } k \text{ is even.} \end{cases}
Rearranging the numbers in the sequence {ak}k=12011\{a_k\}_{k=1}^{2011} in decreasing order produces a new sequence {bk}k=12011.\{b_k\}_{k=1}^{2011}. What is the sum of all the integers k,k, 1≤k≤2011,1 \le k \le 2011, such that ak=bk?a_k = b_k?
671671
10061006
13411341
20112011
20122012
知识点:指数不等式
难度评级:2460
小提示:
每个底数都在 00 和 11 之间,所以幂运算会反转大小关系;比较相邻项
Each base is between 00 and 1,1, so raising to a power reverses order; compare consecutive terms
大提示:
这些值交错排列:1>a2>a4>⋯>a20101 \gt a_2 \gt a_4 \gt \cdots \gt a_{2010} >a2011>a2009\gt a_{2011} \gt a_{2009} >⋯>a1\gt \cdots \gt a_1;当某项的排名等于其下标时,它保持不动
The values interleave: 1>a2>a4>⋯>a20101 \gt a_2 \gt a_4 \gt \cdots \gt a_{2010} >a2011>a2009\gt a_{2011} \gt a_{2009} >⋯>a1;\gt \cdots \gt a_1; a term is fixed when its rank equals its index
解答:
因为每个底数都严格介于 00 和 11 之间,函数 t↦(底数)tt \mapsto (\text{底数})^t 是递减的,而对 b>0b \gt 0,t↦tbt \mapsto t^b 是递增的。比较各项可得序列的大小顺序为 1>a2>a4>⋯>a2010>a2011>a2009>⋯>a1>0。 \begin{aligned} &1 \gt a_2 \gt a_4 \gt \cdots \gt a_{2010} \\ &\gt a_{2011} \gt a_{2009} \\ &\gt \cdots \gt a_1 \gt 0 \end{aligned}\text{。}
因此在递减排列中,偶数下标项先出现,然后是奇数下标项按反向出现。某项满足 ak=bka_k = b_k 当且仅当它的位置等于它的下标;对递减排列的奇数尾部,这要求 2(k−1006)=2011−k2(k - 1006) = 2011 - k。
解得 3k=40233k = 4023,所以 k=1341k = 1341,这是唯一固定下标,因此所求和为 13411341。
因此,正确答案是 C。
Because each base lies strictly between 00 and 1,1, the function t↦(base)tt \mapsto (\text{base})^t is decreasing, while t↦tbt \mapsto t^b is increasing for b>0.b \gt 0. Comparing terms shows the sequence orders as 1>a2>a4>⋯>a2010>a2011>a2009>⋯>a1>0. \begin{aligned} &1 \gt a_2 \gt a_4 \gt \cdots \gt a_{2010} \\ &\gt a_{2011} \gt a_{2009} \\ &\gt \cdots \gt a_1 \gt 0. \end{aligned}
So in the decreasing arrangement, the even-indexed terms come first, then the odd-indexed terms in reverse. A term satisfies ak=bka_k = b_k exactly when its position equals its index, which for the descending odd tail requires 2(k−1006)=2011−k.2(k - 1006) = 2011 - k.
Solving gives 3k=4023,3k = 4023, so k=1341,k = 1341, the unique fixed index, and the sum is 1341.1341.
Thus, the correct answer is C.

25.

设 f(x)=∣2{x}−1∣f(x) = |2\{x\} - 1|,其中 {x}\{x\} 表示 xx 的小数部分。数 nn 是最小正整数,使得方程 nf(xf(x))=xnf(xf(x)) = x 至少有 20122012 个实数解 xx。求 nn?
注:xx 的小数部分是实数 y={x}y = \{x\},满足 0≤y<10 \le y \lt 1 且 x−yx - y 是整数。
Let f(x)=∣2{x}−1∣f(x) = |2\{x\} - 1| where {x}\{x\} denotes the fractional part of x.x. The number nn is the smallest positive integer such that the equation nf(xf(x))=xnf(xf(x)) = x has at least 20122012 real solutions x.x. What is n?n?
Note: the fractional part of xx is a real number y={x},y = \{x\}, such that 0≤y<10 \le y \lt 1 and x−yx - y is an integer.
3030
3131
3232
6262
6464
难度评级:2720
小提示:
ff 是一个周期性的三角波,且 0≤f(x)≤10 \le f(x) \le 1,所以所有解都在 [0,n][0, n] 内
ff is a periodic triangular wave with 0≤f(x)≤1,0 \le f(x) \le 1, so all solutions lie in [0,n][0, n]
大提示:
在每个单位区间上,y=f(xf(x))y = f(xf(x)) 的图像振荡次数逐渐增加;它与 y=xny = \dfrac{x}{n} 的交点总数为 2n22n^2
On each unit interval the graph of y=f(xf(x))y = f(xf(x)) oscillates a growing number of times; the total number of intersections with y=xny = \dfrac{x}{n} is 2n22n^2
解答:
因为 0≤f(x)≤10 \le f(x) \le 1,每个解都位于 [0,n][0,n] 内。函数 ff 是周期为 11 的三角波。令 g(x)=xf(x)g(x)=xf(x)。对每个整数 a≥1a\ge1,函数 gg 在 [a,a+12)[a,a+\tfrac12) 上从 aa 递减到 00,而在 [a+12,a+1)[a+\tfrac12,a+1) 上从 00 递增到 a+1a+1。第一个区间 [0,12)[0,\tfrac12) 是例外,但它不产生与 y=xny=\frac{x}{n} 的交点。
计数振荡次数,在区间 [a,a+12)[a, a + \tfrac12) 和 [a+12,a+1)[a + \tfrac12, a+1) 上,曲线 y=f(g(x))y = f(g(x)) 与直线 y=xny = \tfrac{x}{n} 的交点总数分别为 2a2a 和 2(a+1)2(a+1)。对 a=0,…,n−1a = 0, \ldots, n-1 求和,得到 ∑a=0n−1(2a+2(a+1))=2n2\sum_{a=0}^{n-1}\bigl(2a + 2(a+1)\bigr) = 2n^2 个实数解。
满足 2n2≥20122n^2 \ge 2012 的最小 nn 是 n=32n = 32,因为 2⋅312=19222 \cdot 31^2 = 1922,而 2⋅322=20482 \cdot 32^2 = 2048。
因此,正确答案是 C。
Since 0≤f(x)≤1,0 \le f(x) \le 1, every solution lies in [0,n].[0,n]. The function ff is a triangular wave of period 1.1. Put g(x)=xf(x).g(x)=xf(x). For each integer a≥1,a\ge1, the function gg decreases from aa to 00 on [a,a+12),[a,a+\tfrac12), while it increases from 00 to a+1a+1 on [a+12,a+1).[a+\tfrac12,a+1). The first interval [0,12)[0,\tfrac12) is exceptional, but it contributes no intersection with y=xn.y=\frac{x}{n}.
Counting the oscillations, on the intervals [a,a+12)[a, a + \tfrac12) and [a+12,a+1)[a + \tfrac12, a+1) the curve y=f(g(x))y = f(g(x)) meets the line y=xny = \tfrac{x}{n} a total of 2a2a and 2(a+1)2(a+1) times. Summing over a=0,…,n−1a = 0, \ldots, n-1 gives ∑a=0n−1(2a+2(a+1))=2n2\sum_{a=0}^{n-1}\bigl(2a + 2(a+1)\bigr) = 2n^2 real solutions.
The smallest nn with 2n2≥20122n^2 \ge 2012 is n=32,n = 32, since 2⋅312=19222 \cdot 31^2 = 1922 and 2⋅322=2048.2 \cdot 32^2 = 2048.
Thus, the correct answer is C.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

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