2022 AMC 12A 详解

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

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

1.

求下式的值:

3+13+13+133+\cfrac{1}{3+\cfrac{1}{3+\frac13}}\text{?}

What is the value of

3+13+13+13?3+\cfrac{1}{3+\cfrac{1}{3+\frac13}}?

3110\dfrac{31}{10}

4915\dfrac{49}{15}

3310\dfrac{33}{10}

10933\dfrac{109}{33}

154\dfrac{15}{4}

知识点:连分数分数
难度评级:890
小提示:

从最里面的分数向外计算

Work from the innermost fraction outward

大提示:

3+13=1033+\dfrac13=\dfrac{10}{3},所以上一层是 3+3103+\dfrac{3}{10}

3+13=103,3+\dfrac13=\dfrac{10}{3}, so the next layer up is 3+3103+\dfrac{3}{10}

解答:

从底部开始化简。最里面的部分是 3+13=1033+\dfrac13=\dfrac{10}{3}

下一层是 3+1103=3+310=33103+\dfrac{1}{\frac{10}{3}}=3+\dfrac{3}{10}=\dfrac{33}{10}

最后,3+13310=3+1033=109333+\dfrac{1}{\frac{33}{10}}=3+\dfrac{10}{33}=\dfrac{109}{33}

因此,正确答案是 D

Simplify from the bottom. The innermost fraction is 3+13=103.3+\dfrac13=\dfrac{10}{3}.

The next layer is 3+1103=3+310=3310.3+\dfrac{1}{\frac{10}{3}}=3+\dfrac{3}{10}=\dfrac{33}{10}.

Finally, 3+13310=3+1033=10933.3+\dfrac{1}{\frac{33}{10}}=3+\dfrac{10}{33}=\dfrac{109}{33}.

Thus, the correct answer is D.

2.

三个数的和为 9696。第一个数是第三个数的 66 倍,第三个数比第二个数少 4040。第一个数与第二个数之差的绝对值是多少?

The sum of three numbers is 96.96. The first number is 66 times the third number, and the third number is 4040 less than the second number. What is the absolute value of the difference between the first and second numbers?

11

22

33

44

55

知识点:方程组换元法
难度评级:1020
小提示:

令第三个数为 tt 并用 tt 表示另外两个数

Let the third number be tt and write the others in terms of tt

大提示:

第一个数是 6t6t,第二个数是 t+40t+40,它们的和为 9696

The first is 6t,6t, the second is t+40,t+40, and they sum to 9696

解答:

令第三个数为 tt。那么第一个数是 6t6t,第二个数是 t+40t+40。它们的和为 6t+(t+40)+t=8t+40=966t+(t+40)+t=8t+40=96\text{,} 所以 t=7t=7

第一个数是 4242,第二个数是 4747, 因此差的绝对值为 55

因此,正确答案是 E

Let the third number be t.t. Then the first is 6t6t and the second is t+40.t+40. Their sum is 6t+(t+40)+t=8t+40=96,6t+(t+40)+t=8t+40=96, so t=7.t=7.

The first number is 4242 and the second is 47,47, so the difference has absolute value 5.5.

Thus, the correct answer is E.

3.

五个矩形 AABBCCDD,和 EE,如下图所示排列成一个正方形。这些矩形的尺寸分别为 1×61\times62×42\times45×65\times62×72\times7,和 2×32\times3。(图形未按比例绘制。)中间的阴影矩形是这五个矩形中的哪一个?

Five rectangles, A,A, B,B, C,C, D,D, and E,E, are arranged in a square as shown below. These rectangles have dimensions 1×6,1\times6, 2×4,2\times4, 5×6,5\times6, 2×7,2\times7, and 2×3,2\times3, respectively. (The figure is not drawn to scale.) Which of the five rectangles is the shaded one in the middle?

AA

BB

CC

DD

EE

知识点:面积铺砖矩形
难度评级:1130
小提示:

五个矩形的面积之和就是正方形的面积,这可以确定边长

The five areas add to the square’s area, which fixes the side length

大提示:

先把大的 5×65\times62×72\times7 矩形放在角上,再放入其余矩形

Anchor the large 5×65\times6 and 2×72\times7 pieces in corners, then fit the rest

解答:

五个矩形的面积分别为 6, 8, 30, 146,\ 8,\ 30,\ 14,和 66,总和为 6464。所以这个正方形是 8×88\times8

CC5×65\times6)放在左上方,DD2×72\times7)沿右边放置,EE2×32\times3)放在左下方,AA1×61\times6)沿底边放置,会留下一个中间的 2×42\times4 空隙,正好是矩形 BB

因此,正确答案是 B

The five areas are 6, 8, 30, 14,6,\ 8,\ 30,\ 14, and 6,6, which sum to 64.64. So the square is 8×8.8\times8.

Placing CC (5×65\times6) across the top left, DD (2×72\times7) up the right side, EE (2×32\times3) in the lower left, and AA (1×61\times6) along the bottom leaves a central 2×42\times4 gap, which is exactly rectangle B.B.

Thus, the correct answer is B.

4.

正整数 nn1818 的最小公倍数为 180180,且 nn4545 的最大公因数为 1515。求 nn 的各位数字之和。

The least common multiple of a positive integer nn and 1818 is 180,180, and the greatest common divisor of nn and 4545 is 15.15. What is the sum of the digits of n?n?

33

66

88

99

1212

难度评级:1200
小提示:

分解 180=22325180=2^2\cdot3^2\cdot5nn 需要比 18=23218=2\cdot3^2 多提供哪些质因数幂

Factor 180=22325180=2^2\cdot3^2\cdot5 and see which powers nn must supply beyond 18=23218=2\cdot3^2

大提示:

gcd(n,45)=15\gcd(n,45)=15 表明其中恰有一个因数 33,且至少有一个因数 55

gcd(n,45)=15\gcd(n,45)=15 forces exactly one factor of 33 and at least one factor of 55

解答:

因为 180=22325180=2^2\cdot3^2\cdot5,且 18=23218=2\cdot3^2,条件 lcm(n,18)=180\operatorname{lcm}(n,18)=180 强制 nn 提供 222^255,同时 33 的幂次至多为 22

gcd(n,45)=gcd(n,325)\gcd(n,45)=\gcd(n,3^2\cdot5) =15=35=15=3\cdot5,可知 nn33 的幂次恰为 1155 的幂次至少为 11

因此 n=2235=60n=2^2\cdot3\cdot5=60,其各位数字之和为 66

因此,正确答案是 B

Since 180=22325180=2^2\cdot3^2\cdot5 and 18=232,18=2\cdot3^2, the condition lcm(n,18)=180\operatorname{lcm}(n,18)=180 forces nn to contribute 222^2 and 5,5, with its power of 33 at most 2.2.

From gcd(n,45)=gcd(n,325)\gcd(n,45)=\gcd(n,3^2\cdot5) =15=35,=15=3\cdot5, the power of 33 in nn is exactly 11 and the power of 55 is at least 1.1.

Therefore n=2235=60,n=2^2\cdot3\cdot5=60, whose digits sum to 6.6.

Thus, the correct answer is B.

5.

在坐标平面中,点 (x1,y1)(x_1,y_1)(x2,y2)(x_2,y_2)出租车距离定义为 x1x2+y1y2|x_1-x_2|+|y_1-y_2|。有多少个整数坐标点 PP,使得 PP 到原点的出租车距离小于或等于 2020

Let the taxicab distance between points (x1,y1)(x_1,y_1) and (x2,y2)(x_2,y_2) in the coordinate plane be given by x1x2+y1y2.|x_1-x_2|+|y_1-y_2|. For how many points PP with integer coordinates is the taxicab distance between PP and the origin less than or equal to 20?20?

441441

761761

841841

921921

924924

知识点:格点等差数列
难度评级:1350
小提示:

分别计数每个“菱形” x+y=k|x|+|y|=k 上的格点

Count the lattice points on each “diamond” x+y=k|x|+|y|=k separately

大提示:

k1k\ge1 时,x+y=k|x|+|y|=k 上有 4k4k 个点,另外还有原点

There are 4k4k points with x+y=k|x|+|y|=k for k1,k\ge1, plus the origin

解答:

对每个 k1k\ge1,集合 x+y=k|x|+|y|=k 恰有 4k4k 个格点,而 k=0k=0 时只有原点一个点。

总数为 1+k=1204k=1+420212=1+840=841 \begin{aligned} &1+\sum_{k=1}^{20}4k=1+4\cdot\frac{20\cdot21}{2} \\ &=1+840=841 \end{aligned}\text{。}

因此,正确答案是 C

For each k1,k\ge1, the set x+y=k|x|+|y|=k contains exactly 4k4k lattice points, and k=0k=0 gives the single origin.

The total is 1+k=1204k=1+420212=1+840=841. \begin{aligned} &1+\sum_{k=1}^{20}4k=1+4\cdot\frac{20\cdot21}{2} \\ &=1+840=841. \end{aligned}

Thus, the correct answer is C.

6.

一个数据集由 66 个不一定互异的正整数组成:1177552255,和 XX。这 66 个数的平均数等于数据集中的某个数。所有正的 XX 值之和是多少?

A data set consists of 66 (not distinct) positive integers: 1,1, 7,7, 5,5, 2,2, 5,5, and X.X. The average (arithmetic mean) of the 66 numbers equals a value in the data set. What is the sum of all positive values of X?X?

1010

2626

3232

3636

4040

难度评级:1270
小提示:

五个已知数之和为 2020,所以平均数是 20+X6\dfrac{20+X}{6}

The five known numbers sum to 20,20, so the mean is 20+X6\dfrac{20+X}{6}

大提示:

平均数必须等于 1,2,5,71,2,5,7,或 XX;其中只有一些会给出正的 XX

The mean must equal one of 1,2,5,7,1,2,5,7, or X;X; only some give positive XX

解答:

已知数的和为 2020,所以平均数为 20+X6\dfrac{20+X}{6},且它必须等于数据集中的某个数。

令它等于 55X=10X=10;等于 77X=22X=22;等于 XX 本身得 20+X=6X20+X=6X,所以 X=4X=4。等于 1122 会给出负的 XX

符合条件的正值为 10,22,410,22,4,总和为 3636

因此,正确答案是 D

The known numbers sum to 20,20, so the mean is 20+X6,\dfrac{20+X}{6}, which must equal an element of the set.

Setting it to 55 gives X=10;X=10; to 77 gives X=22;X=22; and to XX itself gives 20+X=6X,20+X=6X, so X=4.X=4. Values 11 and 22 give negative X.X.

The positive values are 10,22,4,10,22,4, summing to 36.36.

Thus, the correct answer is D.

7.

一个长方形如图被分成 55 个区域。每个区域要涂成一种纯色,可选颜色为红、橙、黄、蓝、绿。相接触的区域必须涂成不同颜色,颜色可以重复使用。共有多少种不同的涂色方法?

A rectangle is partitioned into 55 regions as shown. Each region is to be painted a solid color - red, orange, yellow, blue, or green - so that regions that touch are painted different colors, and colors can be used more than once. How many different colorings are possible?

120120

270270

360360

540540

720720

知识点:图论乘法原理
难度评级:1380
小提示:

先给与最多其他区域相邻的区域涂色

Color the region that borders the most others first

大提示:

有一个区域与另外四个区域都相邻;其余每个区域都必须避开两个已经使用的颜色

One region touches all four others; each remaining region must avoid two already-used colors

解答:

底部中间的区域与其他四个区域都共边。先给它涂色,有 55 种方法。

左上区域与它相邻,有 44 种选择。其余三个区域各与两个已经涂好的区域相邻,而这两个区域颜色不同,所以各有 33 种选择。

总数为 54333=5405\cdot4\cdot3\cdot3\cdot3=540

因此,正确答案是 D

The bottom-middle region shares a border with all four other regions. Color it first in 55 ways.

The top-left region borders it, giving 44 choices. Each of the three remaining regions borders exactly two already-colored regions, which have different colors, leaving 33 choices apiece.

The total is 54333=540.5\cdot4\cdot3\cdot3\cdot3=540.

Thus, the correct answer is D.

8.

无限乘积

103103310333\sqrt[3]{10}\cdot\sqrt[3]{\sqrt[3]{10}}\cdot\sqrt[3]{\sqrt[3]{\sqrt[3]{10}}}\cdots

收敛到一个实数。这个数是多少?

The infinite product

103103310333\sqrt[3]{10}\cdot\sqrt[3]{\sqrt[3]{10}}\cdot\sqrt[3]{\sqrt[3]{\sqrt[3]{10}}}\cdots

evaluates to a real number. What is that number?

10\sqrt{10}

1003\sqrt[3]{100}

10004\sqrt[4]{1000}

1010

1010310\sqrt[3]{10}

知识点:指数等比数列
难度评级:1500
小提示:

把每个因子都写成 1010 的幂

Write every factor as a power of 1010

大提示:

指数为 13,19,127,\dfrac13,\dfrac19,\dfrac1{27},\ldots,构成一个等比数列

The exponents are 13,19,127,,\dfrac13,\dfrac19,\dfrac1{27},\ldots, a geometric series

解答:

kk 个因子是对 1010 连取 kk 次立方根,也就是 1013k10^{\frac{1}{3^k}}

这个乘积等于 1010 的如下幂:13+19+127+=13113=12 \begin{aligned} &\frac13+\frac19+\frac1{27}+\cdots=\frac{\frac{1}{3}}{1-\frac{1}{3}} \\ &=\frac12 \end{aligned}\text{。}

所以乘积的值为 1012=1010^{\frac{1}{2}}=\sqrt{10}

因此,正确答案是 A

The kkth factor is 1010 raised to the kk-fold cube root, namely 1013k.10^{\frac{1}{3^k}}.

The product is 1010 raised to 13+19+127+=13113=12. \begin{aligned} &\frac13+\frac19+\frac1{27}+\cdots=\frac{\frac{1}{3}}{1-\frac{1}{3}} \\ &=\frac12. \end{aligned}

So the value is 1012=10.10^{\frac{1}{2}}=\sqrt{10}.

Thus, the correct answer is A.

9.

万圣节时,3131 个孩子走进校长办公室要糖果。他们可以分为三类:有些总是说谎;有些总是说真话;有些交替说谎和说真话。交替者可以任意选择第一次回答是谎话还是真话,但之后每句话的真假都与前一句相反。校长按以下顺序问每个人相同的三个问题。

“你是说真话者吗?”校长给每个回答“是”的 2222 个孩子一颗糖。

“你是交替者吗?”校长给每个回答“是”的 1515 个孩子一颗糖。

“你是说谎者吗?”校长给每个回答“是”的 99 个孩子一颗糖。

校长一共给总是说真话的孩子发了多少颗糖?

On Halloween 3131 children walked into the principal’s office asking for candy. They can be classified into three types: some always lie; some always tell the truth; and some alternately lie and tell the truth. The alternaters arbitrarily choose their first response, either a lie or the truth, but each subsequent statement has the opposite truth value from its predecessor. The principal asked everyone the same three questions in this order.

“Are you a truth-teller?” The principal gave a piece of candy to each of the 2222 children who answered yes.

“Are you an alternater?” The principal gave a piece of candy to each of the 1515 children who answered yes.

“Are you a liar?” The principal gave a piece of candy to each of the 99 children who answered yes.

How many pieces of candy in all did the principal give to the children who always tell the truth?

77

1212

2121

2727

3131

难度评级:1530
小提示:

分析三种类型的孩子对每个问题会怎样回答

Work out how each of the three types answers each question

大提示:

只有先说谎的交替者会在最后一个问题回答“是”,这可以确定他们的人数

Only alternaters who lie first answer the last question yes, which pins down their count

解答:

对“你是说真话者吗?”这个问题,说真话者和说谎者都会回答“是”,而交替者中只有这次说谎的人会回答“是”。对“你是交替者吗?”这个问题,说谎者回答“是”,交替者中只有这次说真话的人回答“是”。对“你是说谎者吗?”这个问题,只有这次说谎的交替者回答“是”。

按第一次回答拆分交替者。先说谎的交替者回答模式为(谎话,真话,谎话),所以三个问题都回答“是”;先说真话的交替者回答模式为(真话,谎话,真话),所以三个问题都不回答“是”。最后一个问题的 99 个“是”正好都是先说谎的交替者,因此他们有 99 人。

第二个问题的 1515 个“是”来自说谎者和这 99 个交替者,所以说谎者有 66 人。第一个问题的 2222 个“是”来自说真话者、说谎者以及这 99 个交替者,所以说真话者有 2269=722-6-9=7 人。

说真话者只会在第一个问题回答“是”,每人得到一颗糖,共 71=77\cdot1=7 颗。

因此,正确答案是 A

To “Are you a truth-teller?” the truth-tellers and liars both answer yes, and only alternaters who lie on this question answer yes. To “Are you an alternater?” the liars answer yes, and among alternaters only those telling the truth on this question answer yes. To “Are you a liar?” only alternaters lying on this question answer yes.

Split the alternaters by first response. Those starting with a lie answer (lie, truth, lie), so they say yes to all three questions; those starting truthful answer (truth, lie, truth) and say yes to none of the three. The 99 yeses on the last question are exactly the lie-first alternaters, so there are 99 of them.

The second question’s 1515 yeses are the liars plus these 9,9, so there are 66 liars. The first question’s 2222 yeses are truth-tellers plus liars plus the 9,9, so the truth-tellers number 2269=7.22-6-9=7.

Truth-tellers answer yes only to the first question, receiving one candy each, for 71=77\cdot1=7 pieces.

Thus, the correct answer is A.

10.

有多少种方法可以把 111414 的数分成 77 对,使得每一对中较大的数至少是较小的数的 22 倍?

What is the number of ways the numbers from 11 to 1414 can be split into 77 pairs such that for each pair, the greater number is at least 22 times the smaller number?

108108

120120

126126

132132

144144

难度评级:1570
小提示:

mm 只有在 2m142m\le14 时才可能是一对中较小的数

A number mm can be the smaller of its pair only if 2m142m\le14

大提示:

所以 1177 是较小元素,881414 是较大元素;从限制最紧的较小数开始分配

So 1177 are the smaller elements and 881414 the larger; assign greedily from the tightest smaller number

解答:

任何大于或等于 88 的数都不能作为较小元素(它的两倍超过 1414),所以 881414 都是较大元素,1177 都是较小元素。

将每个较小数 ss 配到一个较大数 g2sg\ge2s。从限制最强的开始:s=7s=7 强制 g=14g=1411 种);然后 s=6s=6 可配剩下的 {12,13}\{12,13\}22 种);s=5s=533 种;s=4s=444 种;s=3s=333 种;s=2s=222 种;s=1s=111 种。

匹配数为 1234321=1441\cdot2\cdot3\cdot4\cdot3\cdot2\cdot1=144

因此,正确答案是 E

Any number 88 or larger cannot be a smaller element (its double exceeds 1414), so 881414 are all larger elements and 1177 are all smaller elements.

Match each smaller ss to a larger g2s.g\ge2s. Processing from the most restrictive: s=7s=7 forces g=14g=14 (11 way); then s=6s=6 has {12,13}\{12,13\} left (22); s=5s=5 has 3;3; s=4s=4 has 4;4; s=3s=3 has 3;3; s=2s=2 has 2;2; s=1s=1 has 1.1.

The number of matchings is 1234321=144.1\cdot2\cdot3\cdot4\cdot3\cdot2\cdot1=144.

Thus, the correct answer is E.

11.

求所有满足以下条件的实数 xx 的乘积:数轴上 log6x\log_6 xlog69\log_6 9 的距离,等于 log610\log_6 1011 的距离的两倍。

What is the product of all real numbers xx such that the distance on the number line between log6x\log_6 x and log69\log_6 9 is twice the distance on the number line between log610\log_6 10 and 1?1?

1010

1818

2525

3636

8181

知识点:对数绝对值
难度评级:1530
小提示:

log6101=log6106=log653\log_6 10-1=\log_6\dfrac{10}{6}=\log_6\dfrac53

log6101=log6106=log653\log_6 10-1=\log_6\dfrac{10}{6}=\log_6\dfrac53

大提示:

条件为 log6x9=log6259\left|\log_6\dfrac{x}{9}\right|=\log_6\dfrac{25}{9}

The condition is log6x9=log6259\left|\log_6\dfrac{x}{9}\right|=\log_6\dfrac{25}{9}

解答:

右侧的距离为 log6101=log653|\log_6 10-1|=\log_6\dfrac53,所以它的两倍为 2log653=log62592\log_6\dfrac53=\log_6\dfrac{25}{9}

因此 log6x9=log6259\left|\log_6\dfrac{x}{9}\right|=\log_6\dfrac{25}{9},得 x9=259\dfrac{x}{9}=\dfrac{25}{9}x9=925\dfrac{x}{9}=\dfrac{9}{25},所以 x=25x=25x=8125x=\dfrac{81}{25}

它们的乘积为 258125=8125\cdot\dfrac{81}{25}=81

因此,正确答案是 E

The right-hand distance is log6101=log653,|\log_6 10-1|=\log_6\dfrac53, so twice it is 2log653=log6259.2\log_6\dfrac53=\log_6\dfrac{25}{9}.

Thus log6x9=log6259,\left|\log_6\dfrac{x}{9}\right|=\log_6\dfrac{25}{9}, giving x9=259\dfrac{x}{9}=\dfrac{25}{9} or x9=925,\dfrac{x}{9}=\dfrac{9}{25}, so x=25x=25 or x=8125.x=\dfrac{81}{25}.

Their product is 258125=81.25\cdot\dfrac{81}{25}=81.

Thus, the correct answer is E.

12.

在正四面体 ABCDABCD 中,设 MMAB\overline{AB} 的中点。求 cos(CMD)\cos(\angle CMD)

Let MM be the midpoint of AB\overline{AB} in regular tetrahedron ABCD.ABCD. What is cos(CMD)?\cos(\angle CMD)?

14\dfrac14

13\dfrac13

25\dfrac25

12\dfrac12

32\dfrac{\sqrt3}{2}

难度评级:1630
小提示:

设棱长为 11,则 CMCMDMDM 是两个等边面的中线

CMCM and DMDM are medians of equilateral faces with edge length 11

大提示:

CM=DM=32CM=DM=\dfrac{\sqrt3}{2}CD=1CD=1;在 CMD\triangle CMD 中使用余弦定理

CM=DM=32CM=DM=\dfrac{\sqrt3}{2} and CD=1;CD=1; apply the Law of Cosines in CMD\triangle CMD

解答:

取棱长为 11。因为 MMAB\overline{AB} 的中点,线段 CMCMDMDM 是等边三角形面的高,长度都为 32\dfrac{\sqrt3}{2}。另外 CD=1CD=1

CMD\triangle CMD 中由余弦定理,cos(CMD)=34+341234=1232=13 \begin{aligned} \cos(\angle CMD) &=\frac{\frac34+\frac34-1}{2\cdot\frac34} \\ &=\frac{\frac{1}{2}}{\frac{3}{2}}=\frac13 \end{aligned}\text{。}

因此,正确答案是 B

Take edge length 1.1. Since MM is the midpoint of AB,\overline{AB}, segments CMCM and DMDM are altitudes of the equilateral faces, each of length 32.\dfrac{\sqrt3}{2}. Also CD=1.CD=1.

By the Law of Cosines in CMD,\triangle CMD, cos(CMD)=34+341234=1232=13. \begin{aligned} \cos(\angle CMD) &=\frac{\frac34+\frac34-1}{2\cdot\frac34} \\ &=\frac{\frac{1}{2}}{\frac{3}{2}}=\frac13. \end{aligned}

Thus, the correct answer is B.

13.

R\mathcal{R} 是复平面中的一个区域,由所有可写成复数 z1z_1z2z_2 之和的复数 zz 组成,其中 z1z_1 在线段上,该线段的端点为 334i4i,且 z2z_2 的模至多为 11。最接近 R\mathcal{R} 面积的整数是多少?

Let R\mathcal{R} be the region in the complex plane consisting of all complex numbers zz that can be written as the sum of complex numbers z1z_1 and z2,z_2, where z1z_1 lies on the segment with endpoints 33 and 4i,4i, and z2z_2 has magnitude at most 1.1. What integer is closest to the area of R?\mathcal{R}?

1313

1414

1515

1616

1717

知识点:面积距离公式
难度评级:1660
小提示:

R\mathcal{R} 是到该线段距离不超过 11 的所有点

R\mathcal{R} is the set of all points within distance 11 of the segment

大提示:

线段长度为 55,所以 R\mathcal{R} 是一个 5×25\times2 的矩形加上两个半圆

The segment has length 5,5, so R\mathcal{R} is a 5×25\times2 rectangle capped by two half-disks

解答:

给线段上的每个点加上半径为 11 的圆盘,会扫出所有到该线段距离不超过 11 的点。从 334i4i 的线段长度为 32+42=5\sqrt{3^2+4^2}=5

这个“体育场”形状由一个 5×25\times2 的矩形和两个半径为 11 的半圆组成,面积为 52+π(1)2=10+π13.145\cdot2+\pi(1)^2=10+\pi\approx13.14\text{。}

最接近的整数是 1313

因此,正确答案是 A

Adding a disk of radius 11 to every point of the segment sweeps out all points within distance 11 of it. The segment from 33 to 4i4i has length 32+42=5.\sqrt{3^2+4^2}=5.

This “stadium” is a 5×25\times2 rectangle plus two half-disks of radius 1,1, with area 52+π(1)2=10+π13.14.5\cdot2+\pi(1)^2=10+\pi\approx13.14.

The closest integer is 13.13.

Thus, the correct answer is A.

14.

求下式的值:

(log5)3+(log20)3+(log8)(log0.25) \begin{aligned} &(\log 5)^3+(\log 20)^3 \\ &\quad {}+(\log 8)(\log 0.25) \end{aligned}

其中 log\log 表示常用对数。

What is the value of

(log5)3+(log20)3+(log8)(log0.25) \begin{aligned} &(\log 5)^3+(\log 20)^3 \\ &\quad {}+(\log 8)(\log 0.25) \end{aligned}

where log\log denotes the base-ten logarithm?

32\dfrac32

74\dfrac74

22

94\dfrac94

33

难度评级:1730
小提示:

u=log2u=\log 2;则 log5=1u\log 5=1-ulog20=1+u\log 20=1+u

Let u=log2;u=\log 2; then log5=1u\log 5=1-u and log20=1+u\log 20=1+u

大提示:

另有 log8=3u\log 8=3ulog0.25=2u\log 0.25=-2u;使用 a3+b3=(a+b)(a2ab+b2)a^3+b^3=(a+b)(a^2-ab+b^2)

Also log8=3u\log 8=3u and log0.25=2u;\log 0.25=-2u; use a3+b3=(a+b)(a2ab+b2)a^3+b^3=(a+b)(a^2-ab+b^2)

解答:

u=log2u=\log 2。则 log5=1u\log 5=1-ulog20=1+u\log 20=1+ulog8=3u\log 8=3u,且 log0.25=2u\log 0.25=-2u

a=1u, b=1+ua=1-u,\ b=1+u,则 a+b=2a+b=2ab=1u2ab=1-u^2,所以 a3+b3=(a+b)((a+b)23ab)=2(43(1u2))=2+6u2 \begin{gathered} a^3+b^3 \\ =(a+b)\big((a+b)^2-3ab\big) \\ =2\big(4-3(1-u^2)\big) \\ =2+6u^2 \end{gathered}\text{。}

最后一项是 (3u)(2u)=6u2(3u)(-2u)=-6u^2,因此总和为 2+6u26u2=22+6u^2-6u^2=2

因此,正确答案是 C

Let u=log2.u=\log 2. Then log5=1u,\log 5=1-u, log20=1+u,\log 20=1+u, log8=3u,\log 8=3u, and log0.25=2u.\log 0.25=-2u.

With a=1u, b=1+u,a=1-u,\ b=1+u, we have a+b=2a+b=2 and ab=1u2,ab=1-u^2, so a3+b3=(a+b)((a+b)23ab)=2(43(1u2))=2+6u2. \begin{gathered} a^3+b^3 \\ =(a+b)\big((a+b)^2-3ab\big) \\ =2\big(4-3(1-u^2)\big) \\ =2+6u^2. \end{gathered}

The last term is (3u)(2u)=6u2,(3u)(-2u)=-6u^2, so the total is 2+6u26u2=2.2+6u^2-6u^2=2.

Thus, the correct answer is C.

15.

多项式 10x339x2+29x610x^3-39x^2+29x-6 的根分别是一个长方体的高、长、宽。将原长方体的每条棱都增加 22 个单位,形成一个新的长方体。新长方体的体积是多少?

The roots of the polynomial 10x339x2+29x610x^3-39x^2+29x-6 are the height, length, and width of a rectangular box (right rectangular prism). A new rectangular box is formed by lengthening each edge of the original box by 22 units. What is the volume of the new box?

245\dfrac{24}{5}

425\dfrac{42}{5}

815\dfrac{81}{5}

3030

4848

知识点:韦达定理体积
难度评级:1630
小提示:

由韦达定理,r+s+t=3910r+s+t=\dfrac{39}{10}rs+rt+st=2910rs+rt+st=\dfrac{29}{10}rst=35rst=\dfrac35

By Vieta, r+s+t=3910,r+s+t=\dfrac{39}{10}, rs+rt+st=2910,rs+rt+st=\dfrac{29}{10}, rst=35rst=\dfrac35

大提示:

用这些对称和展开 (r+2)(s+2)(t+2)(r+2)(s+2)(t+2)

Expand (r+2)(s+2)(t+2)(r+2)(s+2)(t+2) using these symmetric sums

解答:

设根为 r,s,tr,s,t。由韦达定理,r+s+t=3910r+s+t=\dfrac{39}{10}rs+rt+st=2910rs+rt+st=\dfrac{29}{10},且 rst=610=35rst=\dfrac{6}{10}=\dfrac35

新体积为 (r+2)(s+2)(t+2)=rst+2(rs+rt+st)+4(r+s+t)+8=35+5810+15610+8=30 \begin{gathered} (r+2)(s+2)(t+2) \\ =rst+2(rs+rt+st) \\ \quad {}+4(r+s+t)+8 \\ =\frac35+\frac{58}{10} \\ \quad {}+\frac{156}{10}+8 \\ =30 \end{gathered}\text{。}

因此,正确答案是 D

Let the roots be r,s,t.r,s,t. By Vieta’s formulas, r+s+t=3910,r+s+t=\dfrac{39}{10}, rs+rt+st=2910,rs+rt+st=\dfrac{29}{10}, and rst=610=35.rst=\dfrac{6}{10}=\dfrac35.

The new volume is (r+2)(s+2)(t+2)=rst+2(rs+rt+st)+4(r+s+t)+8=35+5810+15610+8=30. \begin{gathered} (r+2)(s+2)(t+2) \\ =rst+2(rs+rt+st) \\ \quad {}+4(r+s+t)+8 \\ =\frac35+\frac{58}{10} \\ \quad {}+\frac{156}{10}+8 \\ =30. \end{gathered}

Thus, the correct answer is D.

16.

三角数是可以写成 tn=1+2+3++nt_n=1+2+3+\cdots+n 形式的正整数,其中 nn 为正整数。最小的三个同时也是完全平方数的三角数为 t1=1=12t_1=1=1^2t8=36=62t_8=36=6^2t49=1225=352t_{49}=1225=35^2。第四小的同时也是完全平方数的三角数的各位数字之和是多少?

A triangular number is a positive integer that can be expressed in the form tn=1+2+3++n,t_n=1+2+3+\cdots+n, for some positive integer n.n. The three smallest triangular numbers that are also perfect squares are t1=1=12,t_1=1=1^2, t8=36=62,t_8=36=6^2, and t49=1225=352.t_{49}=1225=35^2. What is the sum of the digits of the fourth smallest triangular number that is also a perfect square?

66

99

1212

1818

2727

难度评级:1800
小提示:

n(n+1)2=y2\frac{n(n+1)}{2}=y^2 改写为佩尔方程 (2n+1)28y2=1(2n+1)^2-8y^2=1

Rewrite n(n+1)2=y2\frac{n(n+1)}{2}=y^2 as the Pell equation (2n+1)28y2=1(2n+1)^2-8y^2=1

大提示:

(2n+1)+y8(2n+1)+y\sqrt8 乘以 3+83+\sqrt8,依次生成正整数解

Generate successive positive solutions by multiplying (2n+1)+y8(2n+1)+y\sqrt8 by 3+83+\sqrt8

解答:

tn=y2t_n=y^2,则 n(n+1)2=y2\frac{n(n+1)}{2}=y^2,即 (2n+1)28y2=1(2n+1)^2-8y^2=1。正的佩尔方程解可依次通过将 (2n+1)+y8(2n+1)+y\sqrt8 乘以 3+83+\sqrt8 得到。

(2n+1,y)=(3,1)(2n+1,y)=(3,1) 开始,依次得到 (17,6)(17,6)(99,35)(99,35),然后是 (577,204)(577,204)。因此第四个值对应 n=288n=288,并且等于 2042=41616204^2=41616

它的数位和为 4+1+6+1+6=184+1+6+1+6=18

因此,正确答案是 D

If tn=y2,t_n=y^2, then n(n+1)2=y2,\frac{n(n+1)}{2}=y^2, or (2n+1)28y2=1.(2n+1)^2-8y^2=1. The positive Pell solutions occur successively by multiplying (2n+1)+y8(2n+1)+y\sqrt8 by 3+8.3+\sqrt8.

Starting from (2n+1,y)=(3,1),(2n+1,y)=(3,1), this gives (17,6),(17,6), (99,35),(99,35), and then (577,204).(577,204). Thus the fourth value has n=288n=288 and equals 2042=41616.204^2=41616.

The sum of its digits is 4+1+6+1+6=18.4+1+6+1+6=18.

Thus, the correct answer is D.

17.

aa 为实数,使得方程

a(sinx+sin(2x))=sin(3x)a\cdot(\sin x+\sin(2x))=\sin(3x)

在区间 (0,π)(0,\pi) 中有多于一个解。所有这样的 aa 组成的集合可写为 (p,q)(q,r)(p,q)\cup(q,r),其中 ppqqrr 是满足 p<q<rp\lt q\lt r 的实数。求 p+q+rp+q+r

Suppose aa is a real number such that the equation

a(sinx+sin(2x))=sin(3x)a\cdot(\sin x+\sin(2x))=\sin(3x)

has more than one solution in the interval (0,π).(0,\pi). The set of all such aa can be written in the form (p,q)(q,r),(p,q)\cup(q,r), where p,p, q,q, and rr are real numbers with p<q<r.p\lt q\lt r. What is p+q+r?p+q+r?

4-4

1-1

00

11

44

难度评级:1990
小提示:

使用 sin2x=2sinxcosx\sin 2x=2\sin x\cos xsin3x=sinx(4cos2x1)\sin 3x=\sin x(4\cos^2 x-1)

Use sin2x=2sinxcosx\sin 2x=2\sin x\cos x and sin3x=sinx(4cos2x1)\sin 3x=\sin x(4\cos^2 x-1)

大提示:

除以 sinx\sin x 后,注意 x=2π3x=\dfrac{2\pi}{3}(此时 cosx=12\cos x=-\tfrac12)总是一个解

After dividing by sinx,\sin x, note x=2π3x=\dfrac{2\pi}{3} (where cosx=12\cos x=-\tfrac12) is always a solution

解答:

(0,π)(0,\pi) 上,sinx0\sin x\ne0,所以两边除以 sinx\sin xa(1+2cosx)=4cos2x1=(2cosx1)(2cosx+1) \begin{gathered} a(1+2\cos x)=4\cos^2 x-1 \\ =(2\cos x-1)(2\cos x+1) \end{gathered}\text{。}

cosx=12\cos x=-\tfrac12(即 x=2π3x=\tfrac{2\pi}{3})时,两边都为零,因此这对每个 aa 都是一个解。否则可以约去 1+2cosx1+2\cos xa=2cosx1a=2\cos x-1,即 cosx=a+12\cos x=\dfrac{a+1}{2}

它给出 (0,π)(0,\pi) 中第二个解的条件正是 1<a+12<1-1\lt\dfrac{a+1}{2}\lt1,即 a(3,1)a\in(-3,1),且当 a=2a=-2 时这个解与 x=2π3x=\tfrac{2\pi}{3} 相同,不是不同的解。

因此有多于一个解时,a(3,2)(2,1)a\in(-3,-2)\cup(-2,1),所以 p+q+r=32+1=4p+q+r=-3-2+1=-4

因此,正确答案是 A

Since sinx0\sin x\ne0 on (0,π),(0,\pi), divide by sinx:\sin x: a(1+2cosx)=4cos2x1=(2cosx1)(2cosx+1). \begin{gathered} a(1+2\cos x)=4\cos^2 x-1 \\ =(2\cos x-1)(2\cos x+1). \end{gathered}

When cosx=12\cos x=-\tfrac12 (that is, x=2π3x=\tfrac{2\pi}{3}) both sides vanish, so this is a solution for every a.a. Otherwise we may cancel 1+2cosx1+2\cos x to get a=2cosx1,a=2\cos x-1, i.e. cosx=a+12.\cos x=\dfrac{a+1}{2}.

This yields a second solution in (0,π)(0,\pi) exactly when 1<a+12<1,-1\lt\dfrac{a+1}{2}\lt1, that is a(3,1),a\in(-3,1), and it is distinct from x=2π3x=\tfrac{2\pi}{3} unless a=2.a=-2.

So more than one solution occurs for a(3,2)(2,1),a\in(-3,-2)\cup(-2,1), giving p+q+r=32+1=4.p+q+r=-3-2+1=-4.

Thus, the correct answer is A.

18.

TkT_k 是坐标平面的一个变换:先将平面绕原点逆时针旋转 kk 度,然后关于 yy 轴反射。求最小的正整数 nn 使得依次执行变换 T1T_1T2T_2T3T_3\ldotsTnT_n 后,点 (1,0)(1,0) 回到自身。

Let TkT_k be the transformation of the coordinate plane that first rotates the plane kk degrees counterclockwise around the origin and then reflects the plane across the yy-axis. What is the least positive integer nn such that performing the sequence of transformations T1,T_1, T2,T_2, T3,T_3, ,\ldots, TnT_n returns the point (1,0)(1,0) back to itself?

359359

360360

719719

720720

721721

知识点:变换分类讨论
难度评级:2010
小提示:

角度为 θ\theta 的点在 TkT_k 下变为角度 (180k)θ(180-k)-\theta

A point at angle θ\theta is sent by TkT_k to angle (180k)θ(180-k)-\theta

大提示:

追踪 (1,0)(1,0) 的角度;还要考虑 nn 为奇数、总变换为反射的情形

Track the angle of (1,0);(1,0); also consider odd n,n, where the net map is a reflection

解答:

角度为 θ\theta 的点旋转 kk^\circ 后角度变为 θ+k\theta+k,再关于 yy 轴反射会把角度 ϕ\phi 变为 180ϕ180-\phi。所以 TkT_kθ\theta 变为 (180k)θ(180-k)-\theta

从角度 00 的点 (1,0)(1,0) 出发,依次应用 T1,T2,T_1,T_2,\ldots 得到的角度为 179,1,178,2,177,179,-1,178,-2,177,\ldots。经过偶数 2m2m 步后角度为 m-m,经过奇数 2m+12m+1 步后角度为 179m179-m

点要回到原位,角度必须是 360360^\circ 的倍数。偶数情形要求 m=360m=360,即 n=720n=720。奇数情形要求 179m=0179-m=0,即 m=179m=179n=359n=359,此时总反射固定 (1,0)(1,0)

满足条件的最小 nn359359

因此,正确答案是 A

Rotating a point at angle θ\theta by kk^\circ gives θ+k,\theta+k, and reflecting across the yy-axis sends angle ϕ\phi to 180ϕ.180-\phi. So TkT_k sends θ\theta to (180k)θ.(180-k)-\theta.

Starting from (1,0)(1,0) at angle 0,0, applying T1,T2,T_1,T_2,\ldots gives angles 179,1,178,2,177,.179,-1,178,-2,177,\ldots. After an even number 2m2m of steps the angle is m,-m, and after an odd number 2m+12m+1 it is 179m.179-m.

For the point to return, the angle must be a multiple of 360.360^\circ. The even case needs m=360,m=360, i.e. n=720.n=720. The odd case needs 179m=0,179-m=0, i.e. m=179m=179 and n=359,n=359, where the net reflection fixes (1,0).(1,0).

The least such nn is 359.359.

Thus, the correct answer is A.

19.

假设 1313 张编号为 112233\ldots1313 的卡片排成一行。任务是按数字递增顺序拿起它们,并反复从左到右扫描。在下面的例子中,第一次扫描拿起卡片 112233,第二次扫描拿起 4455,第三次扫描拿起 66,第四次扫描拿起 7788991010,第五次扫描拿起 111112121313。在 13!13! 种卡片排列中,有多少种会使这 1313 张卡片恰好在两次扫描中被拿起?

Suppose that 1313 cards numbered 1,1, 2,2, 3,3, ,\ldots, 1313 are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards 1,1, 2,2, 33 are picked up on the first pass, 44 and 55 on the second pass, 66 on the third pass, 7,7, 8,8, 9,9, 1010 on the fourth pass, and 11,11, 12,12, 1313 on the fifth pass. For how many of the 13!13! possible orderings of the cards will the 1313 cards be picked up in exactly two passes?

40824082

40954095

40964096

81788178

81918191

知识点:排列找规律
难度评级:2010
小提示:

当下一个要拿的数位于前一个数的左边时,就必须开始新一轮扫描

A new pass begins exactly when the next number to pick up lies to the left of the previous one

大提示:

两次扫描意味着位置序列 pos(1),,pos(13)\text{pos}(1),\ldots,\text{pos}(13) 恰好有一个下降

Two passes means the sequence of positions pos(1),,pos(13)\text{pos}(1),\ldots,\text{pos}(13) has exactly one descent

解答:

pos(k)\text{pos}(k) 为卡片 kk 的位置。正好在 pos(k+1)<pos(k)\text{pos}(k+1)\lt\text{pos}(k) 时需要开始新一轮扫描,因此扫描次数等于序列 pos(1),pos(2),,pos(13)\text{pos}(1),\text{pos}(2),\ldots,\text{pos}(13) 的下降数加一。

要构造至多有一个下降的排列,只需选出排在可能的下降之前的那些元素,并把两块都按递增顺序写出。这样的子集共有 2132^{13} 个。其中 1414 个初始段 ,{1},,{1,,13}\varnothing,\{1\},\ldots,\{1,\ldots,13\} 不产生下降;其余每个子集都恰好给出一个含一个下降的排列。因此总数为 21314=81782^{13}-14=8178

因此,正确答案是 D

Let pos(k)\text{pos}(k) be the position of card k.k. A fresh pass is needed exactly when pos(k+1)<pos(k),\text{pos}(k+1)\lt\text{pos}(k), so the number of passes is one more than the number of descents in the sequence pos(1),pos(2),,pos(13).\text{pos}(1),\text{pos}(2),\ldots,\text{pos}(13).

To build a permutation with at most one descent, choose the entries before the possible descent and write both chosen blocks in increasing order. There are 2132^{13} subsets. The 1414 initial segments ,{1},,{1,,13}\varnothing,\{1\},\ldots,\{1,\ldots,13\} produce no descent; every other subset produces a unique permutation with one descent. Hence the count is 21314=8178.2^{13}-14=8178.

Thus, the correct answer is D.

20.

等腰梯形 ABCDABCD 的平行边为 AD\overline{AD}BC\overline{BC},且 BC<ADBC\lt ADAB=CDAB=CD。平面上有一点 PP,满足 PA=1PA=1PB=2PB=2PC=3PC=3,且 PD=4PD=4。求 BCAD\dfrac{BC}{AD}

Isosceles trapezoid ABCDABCD has parallel sides AD\overline{AD} and BC,\overline{BC}, with BC<ADBC\lt AD and AB=CD.AB=CD. There is a point PP in the plane such that PA=1,PA=1, PB=2,PB=2, PC=3,PC=3, and PD=4.PD=4. What is BCAD?\dfrac{BC}{AD}?

14\dfrac14

13\dfrac13

12\dfrac12

23\dfrac23

34\dfrac34

难度评级:2110
小提示:

A=(p,0)A=(-p,0)D=(p,0)D=(p,0)B=(q,h)B=(-q,h)C=(q,h)C=(q,h),使梯形关于 yy 轴对称

Put A=(p,0),A=(-p,0), D=(p,0),D=(p,0), B=(q,h),B=(-q,h), C=(q,h),C=(q,h), symmetric about the yy-axis

大提示:

PA2PD2PA^2-PD^2PB2PC2PB^2-PC^2 都等于 PPxx 坐标的一个倍数

Both PA2PD2PA^2-PD^2 and PB2PC2PB^2-PC^2 equal a multiple of the xx-coordinate of PP

解答:

将梯形放成关于 yy 轴对称:A=(p,0)A=(-p,0)D=(p,0)D=(p,0)B=(q,h)B=(-q,h)C=(q,h)C=(q,h),并设 P=(x,y)P=(x,y)

PA2PD2=4pxPA^2-PD^2=4px =116=15=1-16=-15PB2PC2=4qxPB^2-PC^2=4qx =49=5=4-9=-5。两式相除得 pq=3\dfrac{p}{q}=3

因为 AD=2pAD=2pBC=2qBC=2q,所以 BCAD=qp=13\dfrac{BC}{AD}=\dfrac{q}{p}=\dfrac13

因此,正确答案是 B

Place the trapezoid symmetric about the yy-axis: A=(p,0),A=(-p,0), D=(p,0),D=(p,0), B=(q,h),B=(-q,h), C=(q,h),C=(q,h), with P=(x,y).P=(x,y).

Then PA2PD2=4pxPA^2-PD^2=4px =116=15=1-16=-15 and PB2PC2=4qxPB^2-PC^2=4qx =49=5.=4-9=-5. Dividing gives pq=3.\dfrac{p}{q}=3.

Since AD=2pAD=2p and BC=2q,BC=2q, we get BCAD=qp=13.\dfrac{BC}{AD}=\dfrac{q}{p}=\dfrac13.

Thus, the correct answer is B.

21.

P(x)=x2022+x1011+1P(x)=x^{2022}+x^{1011}+1。下列哪个多项式整除 P(x)P(x)

Let P(x)=x2022+x1011+1.P(x)=x^{2022}+x^{1011}+1. Which of the following polynomials divides P(x)?P(x)?

x2x+1x^2-x+1

x2+x+1x^2+x+1

x4+1x^4+1

x6x3+1x^6-x^3+1

x6+x3+1x^6+x^3+1

知识点:单位根多项式
难度评级:2170
小提示:

因子 D(x)D(x) 可行,当且仅当 DD 的每个根 ζ\zeta 都满足 ζ2022+ζ1011+1=0\zeta^{2022}+\zeta^{1011}+1=0

A divisor D(x)D(x) works iff every root ζ\zeta of DD satisfies ζ2022+ζ1011+1=0\zeta^{2022}+\zeta^{1011}+1=0

大提示:

x6+x3+1x^6+x^3+1 它的根是本原 99 次单位根,所以 ζ3\zeta^3 是本原三次单位根

For x6+x3+1x^6+x^3+1 the roots are primitive 99th roots of unity, so ζ3\zeta^3 is a primitive cube root of unity

解答:

如果 ζ\zeta 是某个因子的根,则必须有 P(ζ)=ζ2022+ζ1011+1=0P(\zeta)=\zeta^{2022}+\zeta^{1011}+1=0

x6+x3+1x^6+x^3+1 的根是本原 99 次单位根,因此 ζ9=1\zeta^9=1。将指数对 99 取模,由 202262022\equiv6101131011\equiv3 可得 ζ6+ζ3+1\zeta^6+\zeta^3+1。这里 ω=ζ3\omega=\zeta^3 是本原三次单位根,所以该式等于 ω2+ω+1=0\omega^2+\omega+1=0

其他四个选项不成立:代入它们的根会得到非零值(例如本原三次单位根会给出 P=3P=3)。

因此,正确答案是 E

If ζ\zeta is a root of a divisor, then P(ζ)=ζ2022+ζ1011+1=0P(\zeta)=\zeta^{2022}+\zeta^{1011}+1=0 is required.

The roots of x6+x3+1x^6+x^3+1 are the primitive 99th roots of unity, so ζ9=1.\zeta^9=1. Reducing exponents modulo 9,9, 202262022\equiv6 and 10113,1011\equiv3, giving ζ6+ζ3+1.\zeta^6+\zeta^3+1. Here ω=ζ3\omega=\zeta^3 is a primitive cube root of unity, so this equals ω2+ω+1=0.\omega^2+\omega+1=0.

The other four options fail: substituting their roots yields nonzero values (for instance, the primitive cube roots of unity give P=3P=3).

Thus, the correct answer is E.

22.

cc 为实数,且 z1z_1z2z_2 是二次方程 z2cz+10=0z^2-cz+10=0 的两个复数解。点 z1z_1z2z_21z1\dfrac{1}{z_1},和 1z2\dfrac{1}{z_2} 是复平面中一个凸四边形 QQ 的顶点。当 QQ 的面积取得最大值时,cc 最接近下列哪一个数?

Let cc be a real number, and let z1,z_1, z2z_2 be the two complex numbers satisfying the quadratic z2cz+10=0.z^2-cz+10=0. Points z1,z_1, z2,z_2, 1z1,\dfrac{1}{z_1}, and 1z2\dfrac{1}{z_2} are the vertices of a (convex) quadrilateral QQ in the complex plane. When the area of QQ obtains its maximum value, cc is the closest to which of the following?

4.54.5

55

5.55.5

66

6.56.5

难度评级:2270
小提示:

当实数 cc 给出非实根时,z2=z1z_2=\overline{z_1}z1=z2=10|z_1|=|z_2|=\sqrt{10}

For real cc with complex roots, z2=z1z_2=\overline{z_1} and z1=z2=10|z_1|=|z_2|=\sqrt{10}

大提示:

四个点组成一个关于实轴对称的等腰梯形;用根的辐角 θ\theta 表示它的面积

The four points form an isosceles trapezoid symmetric about the real axis; write its area in terms of the root’s angle θ\theta

解答:

若根不是实数,则 z1=10eiθz_1=\sqrt{10}\,e^{i\theta}z2=z1z_2=\overline{z_1},因为 z1z2=10z_1z_2=10。于是 1z1=110eiθ\dfrac{1}{z_1}=\dfrac{1}{\sqrt{10}}e^{-i\theta}1z2=110eiθ\dfrac{1}{z_2}=\dfrac{1}{\sqrt{10}}e^{i\theta}

这个梯形的两条竖边长度分别为 210sinθ2\sqrt{10}\sin\theta2sinθ10\frac{2\sin\theta}{\sqrt{10}},它们之间的水平距离为 (10110)cosθ(\sqrt{10}-\frac{1}{\sqrt{10}})\cos\theta。因此它的面积为 9910sinθcosθ=9920sin2θ \frac{99}{10}\sin\theta\cos\theta =\frac{99}{20}\sin2\theta\text{,}θ=45\theta=45^\circ 时取得最大值。

此时 c=z1+z2c=z_1+z_2 =210cos45=2\sqrt{10}\cos45^\circ =254.47=2\sqrt5\approx4.47,最接近 4.54.5

因此,正确答案是 A

If the roots are non-real, then z1=10eiθz_1=\sqrt{10}\,e^{i\theta} and z2=z1,z_2=\overline{z_1}, since z1z2=10.z_1z_2=10. Then 1z1=110eiθ\dfrac{1}{z_1}=\dfrac{1}{\sqrt{10}}e^{-i\theta} and 1z2=110eiθ.\dfrac{1}{z_2}=\dfrac{1}{\sqrt{10}}e^{i\theta}.

The two vertical sides of this trapezoid have lengths 210sinθ2\sqrt{10}\sin\theta and 2sinθ10,\frac{2\sin\theta}{\sqrt{10}}, and their horizontal separation is (10110)cosθ.(\sqrt{10}-\frac{1}{\sqrt{10}})\cos\theta. Hence its area is 9910sinθcosθ=9920sin2θ, \frac{99}{10}\sin\theta\cos\theta =\frac{99}{20}\sin2\theta, which is maximized at θ=45.\theta=45^\circ.

Then c=z1+z2c=z_1+z_2 =210cos45=2\sqrt{10}\cos45^\circ =254.47,=2\sqrt5\approx4.47, closest to 4.5.4.5.

Thus, the correct answer is A.

23.

hnh_nknk_n 是唯一一对互质的正整数,使得

11+12+13++1n=hnkn\frac11+\frac12+\frac13+\cdots+\frac1n=\frac{h_n}{k_n}\text{。}

LnL_n 表示 112233\ldotsnn 的最小公倍数。对于多少个满足 1n221\le n\le22 的整数 nnkn<Lnk_n\lt L_n

Let hnh_n and knk_n be the unique relatively prime positive integers such that

11+12+13++1n=hnkn.\frac11+\frac12+\frac13+\cdots+\frac1n=\frac{h_n}{k_n}.

Let LnL_n denote the least common multiple of the numbers 1,1, 2,2, 3,3, ,\ldots, n.n. For how many integers nn with 1n221\le n\le22 is kn<Ln?k_n\lt L_n?

00

33

77

88

1010

难度评级:2520
小提示:

HnH_n 写成以 LnL_n 为分母的分数;约分后分母变小,正好意味着有质数从分子 kLnk\sum_k \frac{L_n}{k} 中约掉

Writing HnH_n over Ln,L_n, the reduced denominator is smaller exactly when a prime cancels from the numerator kLnk\sum_k \frac{L_n}{k}

大提示:

对满足 pan<pa+1p^a\le n\lt p^{a+1} 的质数幂 pap^a 检查 pp 是否整除 vp(k)=aLnk\sum_{v_p(k)=a} \frac{L_n}{k}

For a prime power pap^a with pan<pa+1,p^a\le n\lt p^{a+1}, check whether pp divides vp(k)=aLnk\sum_{v_p(k)=a} \frac{L_n}{k}

解答:

LnL_n 总是 knk_n 的倍数,所以 kn<Lnk_n\lt L_n 恰好在某个质数 pp 同时整除 LnL_n 和分子 N=k=1nLnkN=\sum_{k=1}^n \tfrac{L_n}{k} 时成立(即有质数被约掉)。

对具有最大幂 panp^a\le n 的质数 pp,只有满足 vp(k)=av_p(k)=a 的项会使 Lnk\frac{L_n}{k} 不含 pp,其余项都能被 pp 整除。因此 pp 被约掉,当且仅当 vp(k)=aLnk0(modp)\sum_{v_p(k)=a}\tfrac{L_n}{k}\equiv0\pmod p

利用 Hn=Hn1+1nH_n=H_{n-1}+\frac{1}{n} 递推应用这个判定,得到:当 1n51\le n\le5 时,kn=Lnk_n=L_n;当 6n86\le n\le8 时,kn=Ln3k_n=\frac{L_n}{3};当 9n179\le n\le17 时,再次有 kn=Lnk_n=L_n。最后,对 n=18,19,20,21,22n=18,19,20,21,22,比值 Lnkn\frac{L_n}{k_n} 分别为 3,3,15,45,453,3,15,45,45,因此恰好在 n=6,7,8,18,19,20,21,22n=6,7,8,18,19,20,21,22 时发生约分,共有 88 个值。

因此,正确答案是 D

LnL_n is always divisible by kn,k_n, so kn<Lnk_n\lt L_n exactly when some prime pp divides both LnL_n and the numerator N=k=1nLnkN=\sum_{k=1}^n \tfrac{L_n}{k} (i.e. a prime cancels).

For a prime pp with maximal power pan,p^a\le n, only the terms with vp(k)=av_p(k)=a keep pp out of Lnk;\frac{L_n}{k}; all others are divisible by p.p. So pp cancels iff vp(k)=aLnk0(modp).\sum_{v_p(k)=a}\tfrac{L_n}{k}\equiv0\pmod p.

Applying this test recursively with Hn=Hn1+1nH_n=H_{n-1}+\frac{1}{n} gives kn=Lnk_n=L_n for 1n5,1\le n\le5, kn=Ln3k_n=\frac{L_n}{3} for 6n8,6\le n\le8, and kn=Lnk_n=L_n again for 9n17.9\le n\le17. Finally, the ratios Lnkn\frac{L_n}{k_n} for n=18,19,20,21,22n=18,19,20,21,22 are 3,3,15,45,45,3,3,15,45,45, respectively. Thus cancellation occurs precisely for n=6,7,8,18,19,20,21,22,n=6,7,8,18,19,20,21,22, which is 88 values.

Thus, the correct answer is D.

24.

用数字 0011223344 组成长度为 55 的字符串。有多少个这样的字符串满足:对每个 j{1,2,3,4}j\in\{1,2,3,4\},至少有 jj 个数字小于 jj?(例如,0221402214 满足条件,因为它含有至少 11 个小于 11 的数字,至少 22 个小于 22 的数字,至少 33 个小于 33 的数字,且至少 44 个小于 44 的数字。字符串 2340423404 不满足条件,因为它不含至少 22 个小于 22 的数字。)

How many strings of length 55 formed from the digits 0,0, 1,1, 2,2, 3,3, 44 are there such that for each j{1,2,3,4},j\in\{1,2,3,4\}, at least jj of the digits are less than j?j? (For example, 0221402214 satisfies the condition because it contains at least 11 digit less than 1,1, at least 22 digits less than 2,2, at least 33 digits less than 3,3, and at least 44 digits less than 4.4. The string 2340423404 does not satisfy the condition because it does not contain at least 22 digits less than 2.2.)

500500

625625

10891089

11991199

12961296

难度评级:2380
小提示:

“至少有 jj 个数字小于 jj” 意味着第 jj 小的数字至多为 j1j-1

“At least jj digits are less than jj” means the jjth smallest digit is at most j1j-1

大提示:

这些正是长度为 55 的停车函数;使用 66 个车位的圆形停车计数

These are parking functions of length 5;5; use the circular-parking count with 66 spaces

解答:

将五个数字排序为 d(1)d(2)d(5)d_{(1)}\le d_{(2)}\le\cdots\le d_{(5)}。条件“至少有 jj 个数字小于 jj”等价于对 j=1,2,3,4j=1,2,3,4,有 d(j)j1d_{(j)}\le j-1,即 d(1)=0, d(2)1d_{(1)}=0,\ d_{(2)}\le1 d(3)2, d(4)3\ d_{(3)}\le2,\ d_{(4)}\le3(而 d(5)4d_{(5)}\le4 自动成立)。

这些字符串恰好是长度为 55 的停车函数。为计数,将 66 个停车位排成圆形,让 55 辆有标号的汽车任意选择首选车位。每辆车向前行驶到第一个空位。在 656^5 个偏好字符串中,同时旋转所有偏好会使唯一的空位依次经过全部 66 个位置。因此,恰有 656=64=1296\frac{6^5}{6}=6^4=1296 个字符串使指定车位为空。将这个车位选作额外的第六个车位,恰好得到上述排序不等式。

因此,正确答案是 E

Sort the five digits as d(1)d(2)d(5).d_{(1)}\le d_{(2)}\le\cdots\le d_{(5)}. The requirement “at least jj digits less than jj” is equivalent to d(j)j1d_{(j)}\le j-1 for j=1,2,3,4,j=1,2,3,4, i.e. d(1)=0, d(2)1,d_{(1)}=0,\ d_{(2)}\le1,  d(3)2, d(4)3\ d_{(3)}\le2,\ d_{(4)}\le3 (with d(5)4d_{(5)}\le4 automatic).

These strings are exactly the parking functions of length 5.5. To count them, arrange 66 parking spaces in a circle and let 55 labeled cars choose arbitrary preferred spaces. Each car moves forward to the first open space. Among the 656^5 preference strings, rotating all preferences cycles the unique empty space through all 66 positions. Therefore exactly 656=64=1296\frac{6^5}{6}=6^4=1296 strings leave a specified space empty. Choosing that space as the extra sixth space gives precisely the sorted inequalities above.

Thus, the correct answer is E.

25.

一个半径为整数 rr 的圆以 (r,r)(r,r) 为圆心。对 1i141\le i\le14,有若干条互不相同、长度为 cic_i 的线段,连接点 (0,ai)(0,a_i)(bi,0)(b_i,0),并且都与该圆相切,其中 aia_ibib_icic_i 都是正整数,且 c1c2c14c_1\le c_2\le\cdots\le c_{14}。当 rr 取尽可能小的值时,c14c1\dfrac{c_{14}}{c_1} 是多少?

A circle with integer radius rr is centered at (r,r).(r,r). Distinct line segments of length cic_i connect points (0,ai)(0,a_i) to (bi,0)(b_i,0) for 1i141\le i\le14 and are tangent to the circle, where ai,a_i, bi,b_i, and cic_i are all positive integers and c1c2c14.c_1\le c_2\le\cdots\le c_{14}. What is the ratio c14c1\dfrac{c_{14}}{c_1} for the least possible value of r?r?

215\dfrac{21}{5}

8513\dfrac{85}{13}

77

395\dfrac{39}{5}

1717

难度评级:2650
小提示:

(0,a)(0,a)(b,0)(b,0) 的线段与该圆相切时,rr 是直角三角形两直角边 a,ba,b 的内切圆半径或半周长

A segment from (0,a)(0,a) to (b,0)(b,0) tangent to this circle makes rr the inradius or the semiperimeter of the right triangle with legs a,ba,b

大提示:

在内切圆半径情形,(a2r)(b2r)=2r2(a-2r)(b-2r)=2r^2,所以 2r22r^2 的正因数个数就是有方向线段的条数

For the inradius case, (a2r)(b2r)=2r2,(a-2r)(b-2r)=2r^2, so positive divisors of 2r22r^2 count the oriented segments

解答:

圆心为 (r,r)(r,r)、半径为 rr 的圆与两条坐标轴都相切。从 (0,a)(0,a)(b,0)(b,0) 的线段满足 a2+b2=c2a^2+b^2=c^2;当 rr 等于以 a,ba,b 为直角边的直角三角形的内切圆半径 a+bc2\tfrac{a+b-c}{2} 或半周长 a+b+c2\tfrac{a+b+c}{2} 时,该线段与圆相切。

在内切圆半径情形中,令 x=a2rx=a-2ry=b2ry=b-2r。则 xy=2r2xy=2r^2,每个正因数 xx 确定一条有方向的线段,其中 a=x+2ra=x+2rb=2r2x+2rb=\frac{2r^2}{x}+2rc=x+2r2x+2rc=x+\frac{2r^2}{x}+2r。因此恰有 d(2r2)d(2r^2) 条这样的线段。

r=1,2,3,4,5r=1,2,3,4,5 时,数量分别为 2,4,6,6,62,4,6,6,6,且半周长情形不可能,因为最小的整数直角三角形半周长为 66。当 r=6r=6 时,d(72)=12d(72)=12,而 33-44-55 三角形再贡献两条有方向的线段。因此 66 是最小可能半径,并且恰好给出 1414 条线段。

两个半周长情形的线段满足 c=5c=5。在内切圆半径族中,c=x+72x+12c=x+\frac{72}{x}+12x=1x=17272 时最大,得到 c=85c=85。因此 c1=5c_1=5c14=85c_{14}=85,并且 c14c1=17\frac{c_{14}}{c_1}=17

因此,正确答案是 E

The circle centered (r,r)(r,r) with radius rr is tangent to both axes. A segment from (0,a)(0,a) to (b,0)(b,0) with a2+b2=c2a^2+b^2=c^2 is tangent to it when rr equals either the inradius a+bc2\tfrac{a+b-c}{2} or the semiperimeter a+b+c2\tfrac{a+b+c}{2} of the right triangle with legs a,b.a,b.

In the inradius case, put x=a2rx=a-2r and y=b2r.y=b-2r. Then xy=2r2,xy=2r^2, and every positive divisor xx determines one oriented segment, with a=x+2r,a=x+2r, b=2r2x+2r,b=\frac{2r^2}{x}+2r, and c=x+2r2x+2r.c=x+\frac{2r^2}{x}+2r. Thus there are exactly d(2r2)d(2r^2) such segments.

For r=1,2,3,4,5,r=1,2,3,4,5, these counts are 2,4,6,6,6,2,4,6,6,6, and no semiperimeter case is possible because the smallest integer right triangle has semiperimeter 6.6. At r=6,r=6, d(72)=12,d(72)=12, and the 33-44-55 triangle contributes two more oriented segments. Hence 66 is the least possible radius and gives exactly 1414 segments.

The two semiperimeter segments have c=5.c=5. In the inradius family, c=x+72x+12c=x+\frac{72}{x}+12 is largest at x=1x=1 or 72,72, giving c=85.c=85. Therefore c1=5,c_1=5, c14=85,c_{14}=85, and c14c1=17.\frac{c_{14}}{c_1}=17.

Thus, the correct answer is E.