2010 AMC 12A 真题

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

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

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

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

了解 LIVE课程

计时

1:15:00

1.

(20(2010201))(20-(2010-201)) +(2010(20120))+(2010-(201-20)) 的值是多少?

What is (20(2010201))(20-(2010-201)) +(2010(20120))?+(2010-(201-20))?

4020-4020

00

4040

401401

40204020

答案:C
知识点:整数运算运算顺序
难度评级:770
小提示:

展开负号,并寻找会相消的项。

Distribute the negative signs and look for terms that cancel

大提示:

20102010201201 的项相消后,只剩下两个 2020

After the 20102010 and 201201 terms cancel, only the two 2020s remain

解答:

展开负号可得 (202010+201)+(2010201+20)=40 \begin{aligned} &(20-2010+201) \\ &\quad {}+(2010-201+20)=40 \end{aligned}\text{。}

所以正确答案是 C

Distributing the negative signs gives (202010+201)+(2010201+20)=40. \begin{aligned} &(20-2010+201) \\ &\quad {}+(2010-201+20)=40. \end{aligned}

Thus, C is the correct answer.

2.

一艘渡船从上午 1010 点开始,每小时载游客去一座岛,最后一班在下午 33 点出发。某天船长注意到上午 1010 点那班有 100100 名游客,并且之后每一班的游客数都比前一班少 11 人。那天这艘渡船一共载了多少名游客到岛上?

A ferry boat shuttles tourists to an island every hour starting at 1010 am until its last trip, which starts at 33 pm. One day the boat captain notes that on the 1010 am trip there were 100100 tourists on the ferry boat, and that on each successive trip, the number of tourists was 11 fewer than on the previous trip. How many tourists did the ferry take to the island that day?

585585

594594

672672

679679

694694

答案:A
知识点:等差数列求和
难度评级:970
小提示:

数一数从上午 1010 点到下午 33 点一共有多少班。

Count how many trips run from 1010 am through 33 pm

大提示:

各班人数为 100,99,,95100,99,\ldots,95;把它们相加。

The trip counts are 100,99,,95;100,99,\ldots,95; add them

解答:

渡船共有 66 班:1010 点、1111 点、1212 点、11 点、22 点和 33 点。

游客数分别为 100,99,98,97,96,95100,99,98,97,96,95,所以总数为 6100(1+2+3+4+5)=60015=585 \begin{gathered} 6\cdot100-(1+2+3+4+5) \\ =600-15 \\ =585 \end{gathered}\text{。}

所以正确答案是 A

The ferry makes 66 trips: at 10,10, 11,11, 12,12, 1,1, 2,2, and 3.3.

The numbers of tourists are 100,99,98,97,96,95,100,99,98,97,96,95, so the total is 6100(1+2+3+4+5)=60015=585. \begin{gathered} 6\cdot100-(1+2+3+4+5) \\ =600-15 \\ =585. \end{gathered}

Thus, A is the correct answer.

3.

如图所示,长方形 ABCDABCD 与正方形 EFGHEFGH50%50\% 的面积重叠。正方形 EFGHEFGH 与长方形 ABCDABCD20%20\% 的面积重叠。求 ABAD\dfrac{AB}{AD}

Rectangle ABCD,ABCD, pictured below, shares 50%50\% of its area with square EFGH.EFGH. Square EFGHEFGH shares 20%20\% of its area with rectangle ABCD.ABCD. What is ABAD?\dfrac{AB}{AD}?

44

55

66

88

1010

答案:E
知识点:面积比百分数
难度评级:1120
小提示:

设正方形边长为 ss;阴影重叠部分的宽为 ss,高为 ADAD

Let ss be the side length of the square; the shaded overlap has width ss and height ADAD

大提示:

长方形面积的一半等于重叠面积,得 AB=2sAB=2s;正方形面积的五分之一给出 AD=s5AD=\tfrac{s}{5}

Half the rectangle’s area equals the overlap, giving AB=2s;AB=2s; one fifth of the square’s area gives AD=s5AD=\tfrac{s}{5}

解答:

设正方形 EFGHEFGH 的边长为 ss。重叠部分宽为 ss,高为 ADAD,所以面积为 sADs\cdot AD

因为重叠部分占长方形面积的 50%50\%,所以 sAD=12ABADs\cdot AD=\tfrac12\,AB\cdot AD,从而 AB=2sAB=2s。又因为它占正方形面积的 20%20\%,所以 sAD=15s2s\cdot AD=\tfrac15 s^2,从而 AD=s5AD=\tfrac{s}{5}

因此 ABAD=2ss5=10\dfrac{AB}{AD}=\dfrac{2s}{\frac{s}{5}}=10\text{。}

所以 E 是正确答案。

Let ss be the side length of square EFGH.EFGH. The shaded overlap has width ss and height AD,AD, so its area is sAD.s\cdot AD.

Because the overlap is 50%50\% of the rectangle, sAD=12ABAD,s\cdot AD=\tfrac12\,AB\cdot AD, so AB=2s.AB=2s. Because it is 20%20\% of the square, sAD=15s2,s\cdot AD=\tfrac15 s^2, so AD=s5.AD=\tfrac{s}{5}.

Therefore ABAD=2ss5=10.\dfrac{AB}{AD}=\dfrac{2s}{\frac{s}{5}}=10.

Thus, E is the correct answer.

4.

x<0x\lt0,下列哪一个一定为正?

If x<0,x\lt0, then which of the following must be positive?

xx\dfrac{x}{|x|}

x2-x^2

2x-2^x

x1-x^{-1}

x3\sqrt[3]{x}

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

用一个负数,如 x=1x=-1,检验每个选项。

Test each choice with a negative value such as x=1x=-1

大提示:

x1-x^{-1} 改写为 1x-\dfrac1x;用负数作除数会使符号反转。

Rewrite x1-x^{-1} as 1x;-\dfrac1x; dividing into a negative number flips the sign

解答:

选项 D 为 x1=1x-x^{-1}=-\dfrac1x。当 x<0x\lt0 时,1x<0\dfrac1x\lt0,所以 1x>0-\dfrac1x\gt0

x=1x=-1 可知其他选项不一定为正:xx=1\dfrac{x}{|x|}=-1x2=1-x^2=-12x=12-2^x=-\tfrac12,且 x3=1\sqrt[3]{x}=-1

因此 D 是正确答案。

Choice (D) is x1=1x.-x^{-1}=-\dfrac1x. When x<0,x\lt0, 1x<0,\dfrac1x\lt0, so 1x>0.-\dfrac1x\gt0.

Testing x=1x=-1 shows the other choices need not be positive: xx=1,\dfrac{x}{|x|}=-1, x2=1,-x^2=-1, 2x=12,-2^x=-\tfrac12, and x3=1.\sqrt[3]{x}=-1.

Thus, D is the correct answer.

5.

在一场 100100 箭的射箭比赛进行到一半时,Chelsea 领先 5050 分。每箭射中靶心得 1010 分,其他可能得分为 88442200 分。Chelsea 每箭至少得 44 分。如果 Chelsea 接下来 nn 箭都射中靶心,她就能保证获胜。nn 的最小值是多少?

Halfway through a 100100-shot archery tournament, Chelsea leads by 5050 points. For each shot a bullseye scores 1010 points, with other possible scores being 8,8, 4,4, 2,2, and 00 points. Chelsea always scores at least 44 points on each shot. If Chelsea’s next nn shots are bullseyes she will be guaranteed victory. What is the minimum value for n?n?

3838

4040

4242

4444

4646

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

Chelsea 的对手在剩下的 5050 箭中每箭最多得 1010 分。

Chelsea’s opponent can score at most 1010 points on each of the remaining 5050 shots

大提示:

若有 nn 箭靶心,其他 50n50-n 箭至少 44 分,则需要 10n+4(50n)>5005010n+4(50-n)\gt 500-50

With nn bullseyes and at least 44 points on the other 50n50-n shots, require 10n+4(50n)>5005010n+4(50-n)\gt 500-50

解答:

对手在最后 5050 箭中最多可得 5010=50050\cdot10=500 分。Chelsea 已领先 5050 分,所以她还需要超过 50050=450500-50=450 分。

设 Chelsea 有 nn 箭靶心,得 10n10n 分,其余 50n50-n 箭至少得 4(50n)4(50-n) 分。要保证获胜,需要 10n+4(50n)>45010n+4(50-n)\gt450\text{。} 化简得 6n>2506n\gt250,即 n>4123n\gt41\tfrac23

因此至少需要 4242 箭靶心。

所以正确答案是 C

The opponent can score at most 5010=50050\cdot10=500 on the last 5050 shots. Since Chelsea leads by 50,50, she must score more than 50050=450500-50=450 points on her remaining shots to guarantee victory.

Her nn bullseyes give 10n10n points, and her other 50n50-n shots give at least 4(50n)4(50-n) points, so 10n+4(50n)>450.10n+4(50-n)\gt450. This simplifies to 6n>250,6n\gt250, i.e. n>4123.n\gt41\tfrac23.

Therefore Chelsea needs at least 4242 bullseyes.

Thus, C is the correct answer.

6.

回文数,例如 8343883438,是一个数字反过来读仍相同的数。数 xxx+32x + 32 分别是三位数和四位数回文数。xx 的各位数字之和是多少?

A palindrome, such as 83438,83438, is a number that remains the same when its digits are reversed. The numbers xx and x+32x + 32 are three-digit and four-digit palindromes, respectively. What is the sum of the digits of x?x?

2020

2121

2222

2323

2424

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

将四位回文数限制在 1000100010311031 之间。

Bound the four-digit palindrome between 10001000 and 10311031

大提示:

找出该区间内唯一的回文数,再减去 3232

Find the only palindrome in that interval, then subtract 3232

解答:

因为 xx 至多为 999999,所以 x+32x + 32 至多为 10311031

同时 x+32x + 32 至少为 10001000

这个范围内唯一的回文数是 10011001,所以 x+32x + 32 等于这个数。

于是 x=100132=969x=1001-32=969,它的各位数字之和为 9+6+9=249+6+9=24

所以正确答案是 E

Note that xx is at most 999.999. This means that x+32x + 32 has a maximum of 1031.1031.

Similarly, we have that the minimum value of x+32x + 32 is 1000.1000.

The only palindrome in this range is 1001,1001, so this is what x+32x + 32 equals.

Thus x=100132=969,x=1001-32=969, whose digit sum is 9+6+9=24.9+6+9=24.

Thus, E is the correct answer.

7.

Logan 正在制作他的城镇的比例模型。该城市的水塔高 4040 米,顶部是一个可容纳 100,000100{,}000 升水的球体。Logan 的迷你水塔可容纳 0.10.1 升水。他应该把水塔做成多少米高?

Logan is constructing a scaled model of his town. The city’s water tower stands 4040 meters high, and the top portion is a sphere that holds 100,000100{,}000 liters of water. Logan’s miniature water tower holds 0.10.1 liters. How tall, in meters, should Logan make his tower?

0.040.04

0.4π\dfrac{0.4}{\pi}

0.40.4

4π\dfrac{4}{\pi}

44

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

体积比例是长度比例的立方。

Volume scale is the cube of length scale

大提示:

比较 0.10.1 升和 100000100000 升,再取立方根。

Compare 0.10.1 liters to 100000100000 liters, then take a cube root

解答:

模型与原物的体积比为 0.1100,000=11,000,000\dfrac{0.1}{100{,}000}=\dfrac{1}{1{,}000{,}000}。长度按体积比的立方根缩放,所以模型与原物的高度比为 1100\dfrac1{100}。因此模型的高度应为 40100=0.4\dfrac{40}{100}=0.4 米。

所以正确答案是 C

The model-to-original volume ratio is 0.1100,000=11,000,000.\dfrac{0.1}{100{,}000}=\dfrac{1}{1{,}000{,}000}. Lengths scale by the cube root, so the model-to-original height ratio is 1100.\dfrac1{100}. Therefore the model should be 40100=0.4\dfrac{40}{100}=0.4 meters tall.

Thus, C is the correct answer.

8.

三角形 ABCABC 满足 AB=2ACAB=2 \cdot AC。点 DDEE 分别在 AB\overline{AB}BC\overline{BC} 上,且 BAE=ACD\angle BAE = \angle ACD。设 FF 为线段 AEAECDCD 的交点,并且 CFE\triangle CFE 是等边三角形。求 ACB\angle ACB

Triangle ABCABC has AB=2AC.AB=2 \cdot AC. Let DD and EE be on AB\overline{AB} and BC,\overline{BC}, respectively, such that BAE=ACD.\angle BAE = \angle ACD. Let FF be the intersection of segments AEAE and CD,CD, and suppose that CFE\triangle CFE is equilateral. What is ACB?\angle ACB?

6060^\circ

7575^\circ

9090^\circ

105105^\circ

120120^\circ

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

BAE=ACD=x\angle BAE=\angle ACD=x

Let BAE=ACD=x\angle BAE=\angle ACD=x

大提示:

CFE\triangle CFEAFC\angle AFC,再追角求 BAC\angle BAC

Use CFE\triangle CFE to find AFC,\angle AFC, then angle-chase BAC\angle BAC

解答:

BAE=ACD=x\angle BAE=\angle ACD=x。因为 CFE\triangle CFE 是等边三角形,所以 CFE=60\angle CFE=60^\circ。射线 FAFAFEFE 方向相反,因此 AFC=120\angle AFC=120^\circ

AFC\triangle AFC 中,FAC=180120x\angle FAC=180^\circ-120^\circ-x =60x=60^\circ-x。因为 FF 位于 AEAE 上,这个角就是 EAC\angle EAC。所以 BAC=x+(60x)=60\angle BAC=x+(60^\circ-x)=60^\circ

AC=sAC=s,则 AB=2sAB=2s。由余弦定理,BC2=s2+(2s)22(s)(2s)cos60=3s2 \begin{aligned} BC^2 &= s^2+(2s)^2 \\ &\quad-2(s)(2s)\cos60^\circ \\ &=3s^2 \end{aligned}\text{。}因此三边之比为 1:3:21:\sqrt3:2,且 ABAB 为斜边,所以 ACB=90\angle ACB=90^\circ

所以正确答案是 C

Let BAE=ACD=x.\angle BAE=\angle ACD=x. Because CFE\triangle CFE is equilateral, CFE=60.\angle CFE=60^\circ. Rays FAFA and FEFE are opposite, so AFC=120.\angle AFC=120^\circ.

In AFC,\triangle AFC, we get FAC=180120x\angle FAC=180^\circ-120^\circ-x =60x.=60^\circ-x. Since FF lies on AE,AE, this is EAC.\angle EAC. Hence BAC=x+(60x)=60.\angle BAC=x+(60^\circ-x)=60^\circ.

Put AC=s,AC=s, so AB=2s.AB=2s. The Law of Cosines gives BC2=s2+(2s)22(s)(2s)cos60=3s2. \begin{aligned} BC^2 &= s^2+(2s)^2 \\ &\quad-2(s)(2s)\cos60^\circ \\ &=3s^2. \end{aligned} Thus the side lengths are in the ratio 1:3:2,1:\sqrt3:2, with ABAB the hypotenuse, so ACB=90.\angle ACB=90^\circ.

Thus, C is the correct answer.

9.

一个实心立方体边长为 33 英寸。在每个面的中心切出一个 22 英寸乘 22 英寸的正方形孔。每个切口的边都与立方体的边平行,并且每个孔都贯穿整个立方体。剩余立体的体积是多少立方英寸?

A solid cube has side length 33 inches. A 22-inch by 22-inch square hole is cut into the center of each face. The edges of each cut are parallel to the edges of the cube, and each hole goes all the way through the cube. What is the volume, in cubic inches, of the remaining solid?

77

88

1010

1212

1515

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

对三个长方体孔使用容斥。

Use inclusion-exclusion for the three rectangular holes

大提示:

三个 2×2×32\times2\times3 的孔在中心的 2×2×22\times2\times2 立方体中重叠。

The three 2×2×32\times2\times3 holes overlap in the central 2×2×22\times2\times2 cube

解答:

三个被切出的长方体都在立方体中心相交。

交集是边长为 22 的立方体。因此切除区域的体积为 3223223=3616=20 \begin{align*}3 \cdot 2 \cdot 2 \cdot 3 - 2 \cdot 2^3 &= 36 - 16 \\&= 20\end{align*}\text{。}

中心区域被全部 33 个孔包含,因此要减去重复计入的两次。

剩余体积为 3320=2720=7 3^3 - 20 = 27 - 20 = 7\text{。}

所以正确答案是 A

Note that all the cut out solids intersect in the middle of the cube.

This region of intersection is a cube with side length 2.2. Then the volume of the cutout region is 3223223=3616=20. \begin{align*}3 \cdot 2 \cdot 2 \cdot 3 - 2 \cdot 2^3 &= 36 - 16 \\&= 20.\end{align*}

We have to subtract out the center region twice since it is included in all 33 regions.

The remaining volume is then 3320=2720=7. 3^3 - 20 = 27 - 20 = 7.

Thus, A is the correct answer.

10.

一个等差数列的前四项为 pp993pq3p-q3p+q3p+q。这个数列的第 20102010 项是多少?

The first four terms of an arithmetic sequence are p,p, 9,9, 3pq,3p-q, and 3p+q.3p+q. What is the 20102010th term of this sequence?

80418041

80438043

80458045

80478047

80498049

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

公差等于 (3p+q)(3pq)=2q(3p+q)-(3p-q)=2q

The common difference equals (3p+q)(3pq)=2q(3p+q)-(3p-q)=2q

大提示:

同时 9p=2q9-p=2q,且 (3pq)9=2q(3p-q)-9=2q;解出 ppqq

Also 9p=2q9-p=2q and (3pq)9=2q;(3p-q)-9=2q; solve for pp and qq

解答:

相邻两项之差都是公差 dd,且 d=(3p+q)(3pq)=2qd=(3p+q)-(3p-q)=2q

由前两项可得 9p=d=2q9-p=d=2q,由第二、三项可得 (3pq)9=d=2q(3p-q)-9=d=2q。解得 p=5p=5q=2q=2d=4d=4

因此第 20102010 项为 p+2009d=5+20094=8041 \begin{aligned} p+2009d &= 5+2009\cdot4 \\ &= 8041 \end{aligned}\text{。}

所以正确答案是 A

Consecutive terms differ by a common difference d.d. From the last two terms, d=(3p+q)(3pq)=2q.d=(3p+q)-(3p-q)=2q.

From the first two terms, 9p=d=2q,9-p=d=2q, and from the second and third, (3pq)9=d=2q.(3p-q)-9=d=2q. Solving this system gives p=5,p=5, q=2,q=2, and d=4.d=4.

The 20102010th term is p+2009d=5+20094=8041. \begin{aligned} p+2009d &= 5+2009\cdot4 \\ &= 8041. \end{aligned}

Thus, A is the correct answer.

11.

方程 7x+7=8x7^{x+7}=8^x 的解可表示为 x=logb77x=\log_b 7^7。求 bb

The solution of the equation 7x+7=8x7^{x+7}=8^x can be expressed in the form x=logb77.x=\log_b 7^7. What is b?b?

715\dfrac{7}{15}

78\dfrac{7}{8}

87\dfrac{8}{7}

158\dfrac{15}{8}

157\dfrac{15}{7}

答案:C
知识点:对数指数
难度评级:1510
小提示:

x=logb77x=\log_b 7^7 表示 bx=77b^x=7^7

x=logb77x=\log_b 7^7 means bx=77b^x=7^7

大提示:

通过相乘合并底数:(7b)x=7xbx=7x+7(7b)^x=7^x\cdot b^x=7^{x+7}

Multiply to combine the bases: (7b)x=7xbx=7x+7(7b)^x=7^x\cdot b^x=7^{x+7}

解答:

因为 x=logb77x=\log_b 7^7,所以 bx=77b^x=7^7

因此 (7b)x=7xbx=7x77=7x+7=8x \begin{aligned} (7b)^x=7^x\cdot b^x &= 7^x\cdot7^7 \\ &= 7^{x+7}=8^x \end{aligned}\text{。}

由于 x>0x\gt0,可得 7b=87b=8,所以 b=87b=\dfrac{8}{7}

所以正确答案是 C

Since x=logb77,x=\log_b 7^7, we have bx=77.b^x=7^7.

Then (7b)x=7xbx=7x77=7x+7=8x. \begin{aligned} (7b)^x=7^x\cdot b^x &= 7^x\cdot7^7 \\ &= 7^{x+7}=8^x. \end{aligned}

Because x>0,x\gt0, it follows that 7b=8,7b=8, so b=87.b=\dfrac{8}{7}.

Thus, C is the correct answer.

12.

在一片神奇的沼泽中,有两种会说话的两栖动物:蟾蜍总是说真话,青蛙总是说假话。Brian、Chris、LeRoy 和 Mike 四只两栖动物一起住在这片沼泽中,并作出以下陈述。

Brian:“Mike 和我是不同物种。”

Chris:“LeRoy 是青蛙。”

LeRoy:“Chris 是青蛙。”

Mike:“我们四个中至少有两个是蟾蜍。”

这四只两栖动物中有多少只是青蛙?

In a magical swamp there are two species of talking amphibians: toads, whose statements are always true, and frogs, whose statements are always false. Four amphibians, Brian, Chris, LeRoy, and Mike live together in this swamp, and they make the following statements.

Brian: “Mike and I are different species.”

Chris: “LeRoy is a frog.”

LeRoy: “Chris is a frog.”

Mike: “Of the four of us, at least two are toads.”

How many of these four amphibians are frogs?

00

11

22

33

44

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

Chris 和 LeRoy 不可能是同一物种。

Chris and LeRoy cannot have the same species

大提示:

如果 Brian 是蟾蜍,Mike 的陈述会产生矛盾。

If Brian were a toad, Mike’s statement would create a contradiction

解答:

Chris 和 LeRoy 必定属于不同物种:如果 Chris 是蟾蜍,他的话说明 LeRoy 是青蛙;如果 Chris 是青蛙,他这句假话说明 LeRoy 是蟾蜍。因此他们两个中恰好有一只是蟾蜍。

如果 Brian 是蟾蜍,他说的是真话,于是 Mike 是青蛙。如果 Brian 是青蛙,他这句假话意味着他和 Mike 是同一物种,此时 Mike 仍然是青蛙。所以 Mike 一定是青蛙。

因此 Mike 的陈述是假话,也就是说蟾蜍不足两只。而 Chris 和 LeRoy 中已经恰好有一只蟾蜍,所以 Brian 只能是青蛙。于是四只中有一只蟾蜍和 33 只青蛙。

所以正确答案是 D

Chris and LeRoy are of opposite species: if Chris is a toad, his statement makes LeRoy a frog; if Chris is a frog, his false statement makes LeRoy a toad. Thus exactly one of them is a toad.

If Brian is a toad, his true statement makes Mike a frog. If Brian is a frog, his false statement says that he and Mike are the same species, again making Mike a frog. Therefore Mike is always a frog.

Mike’s statement is therefore false, so there are fewer than two toads. Chris and LeRoy already supply exactly one toad, forcing Brian to be a frog. Hence there is one toad and 33 frogs.

Thus, D is the correct answer.

13.

对多少个整数 kk,图像 x2+y2=k2x^2+y^2=k^2xy=kxy=k 不相交?

For how many integer values of kk do the graphs of x2+y2=k2x^2+y^2=k^2 and xy=kxy=k not intersect?

00

11

22

44

88

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

k0k\ne0 时,x2+y2=k2x^2+y^2=k^2 是半径为 k|k| 的圆,而 xy=kxy=k 是双曲线。

For k0,k\ne0, x2+y2=k2x^2+y^2=k^2 is a circle of radius k|k| and xy=kxy=k is a hyperbola

大提示:

双曲线上离原点最近的点到原点距离为 2k\sqrt{2|k|};把它与半径 k|k| 比较。

The hyperbola’s points closest to the origin are at distance 2k;\sqrt{2|k|}; compare with the radius k|k|

解答:

k=0k=0 时,x2+y2=0x^2+y^2=0 的图像是单点 (0,0)(0,0),而 xy=0xy=0 是两条坐标轴,它们在原点相交。

k0k\ne0 时,圆的半径为 k|k|,双曲线 xy=kxy=k 离原点最近的两个顶点到原点距离为 2k\sqrt{2|k|}。两图像相交当且仅当 k2k|k|\ge\sqrt{2|k|},即 k2|k|\ge2

所以只有 k=1|k|=1 时两图像不相交,也就是 k=1k=1k=1k=-1,共有 22 个值。

因此 C 是正确答案。

For k=0,k=0, the graph of x2+y2=0x^2+y^2=0 is the single point (0,0)(0,0) and xy=0xy=0 is the two axes, which meet at the origin, so the graphs intersect.

For k0,k\ne0, the circle has radius k,|k|, and the hyperbola xy=kxy=k has its two vertices nearest the origin at distance 2k.\sqrt{2|k|}. The graphs meet exactly when k2k,|k|\ge\sqrt{2|k|}, that is k2.|k|\ge2.

So they fail to intersect only when k=1,|k|=1, namely k=1k=1 and k=1,k=-1, giving 22 values.

Thus, C is the correct answer.

14.

非退化三角形 ABC\triangle ABC 的边长都是整数,BD\overline{BD} 是角平分线,AD=3AD = 3DC=8DC = 8。周长的最小可能值是多少?

Nondegenerate ABC\triangle ABC has integer side lengths, BD\overline{BD} is an angle bisector, AD=3,AD = 3, and DC=8.DC = 8. What is the smallest possible value of the perimeter?

3030

3333

3535

3636

3737

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

使用角平分线定理。

Use the Angle Bisector Theorem

大提示:

AB:BC=3:8AB:BC=3:8,并且 AC=11AC=11

AB:BC=3:8,AB:BC=3:8, and AC=11AC=11

解答:

由角平分线定理,AB3=BC8 \dfrac{AB}{3} = \dfrac{BC}{8} AB=38BC AB = \dfrac{3}{8} BC\text{。}

为使 ABABBCBC 都是整数,BCBC 必须是 88 的倍数。

若为了最小化周长取 BC=8BC = 8AB=3AB = 3,三角形会退化。

因此 BCBC 必须取 1616,此时 AB=6AB = 6。又 AC=AD+DC=11AC = AD + DC = 11,周长为 16+6+11=33 16 + 6 + 11 = 33\text{。}

所以正确答案是 B

Using the Angle Bisector Theorem, we have that AB3=BC8 \dfrac{AB}{3} = \dfrac{BC}{8} AB=38BC. AB = \dfrac{3}{8} BC.

For ABAB and BCBC to be integers, we must have that BCBC is a multiple of 8.8.

To minimize the perimeter, we can set BC=8BC = 8 and AB=3.AB = 3. This, however, makes the triangle degenerate.

BCBC must then be 1616 and AB=6.AB = 6. Since AC=AD+DC=11,AC = AD + DC = 11, the perimeter is 16+6+11=33. 16 + 6 + 11 = 33.

Thus, B is the correct answer.

15.

一枚硬币被改造后,正面朝上的概率小于 12\dfrac12,抛这枚硬币四次,正面和反面次数相等的概率为 16\dfrac{1}{6}。这枚硬币正面朝上的概率是多少?

A coin is altered so that the probability that it lands on heads is less than 12,\dfrac12, and when the coin is flipped four times, the probability of an equal number of heads and tails is 16.\dfrac{1}{6}. What is the probability that the coin lands on heads?

1536\dfrac{\sqrt{15}-3}{6}

666+212\dfrac{6-\sqrt{6\sqrt6+2}}{12}

212\dfrac{\sqrt2-1}{2}

336\dfrac{3-\sqrt3}{6}

312\dfrac{\sqrt3-1}{2}

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

两次正面、两次反面的概率为 (42)p2(1p)2\binom{4}{2}p^2(1-p)^2

The chance of two heads and two tails is (42)p2(1p)2\binom{4}{2}p^2(1-p)^2

大提示:

这会化为 p(1p)=16p(1-p)=\dfrac16;解二次方程并取 p<12p\lt\dfrac12 的根。

This reduces to p(1p)=16;p(1-p)=\dfrac16; solve the quadratic and take the root with p<12p\lt\dfrac12

解答:

设正面朝上的概率为 pp。抛掷四次恰好出现两次正面和两次反面的概率为 (42)p2(1p)2=6p2(1p)2=16 \begin{aligned} \binom{4}{2}p^2(1-p)^2 &= 6p^2(1-p)^2 \\ &= \frac16 \end{aligned}\text{。}

因此 p2(1p)2=136p^2(1-p)^2=\dfrac{1}{36},所以 p(1p)=16p(1-p)=\dfrac16

这给出 6p26p+1=06p^2-6p+1=0,故 p=3±36p=\dfrac{3\pm\sqrt3}{6}。由于 p<12p\lt\dfrac12,取 p=336p=\dfrac{3-\sqrt3}{6}

因此 D 是正确答案。

Let pp be the probability of heads. The chance of two heads and two tails in four flips is (42)p2(1p)2=6p2(1p)2=16. \begin{aligned} \binom{4}{2}p^2(1-p)^2 &= 6p^2(1-p)^2 \\ &= \frac16. \end{aligned}

Thus p2(1p)2=136,p^2(1-p)^2=\dfrac{1}{36}, so p(1p)=16.p(1-p)=\dfrac16.

This gives 6p26p+1=0,6p^2-6p+1=0, so p=3±36.p=\dfrac{3\pm\sqrt3}{6}. Since p<12,p\lt\dfrac12, we take p=336.p=\dfrac{3-\sqrt3}{6}.

Thus, D is the correct answer.

16.

Bernardo 随机选出 33 个不同的数,这些数来自集合 {1,2,3,4,5,6,7,8,9}\{1,2,3,4,5,6,7,8,9\} 并按降序排列形成一个 33 位数。Silvia 也随机选出 33 个不同的数,这些数来自集合 {1,2,3,4,5,6,7,8}\{1,2,3,4,5,6,7,8\} 并按降序排列形成一个 33 位数。Bernardo 的数大于 Silvia 的数的概率是多少?

Bernardo randomly picks 33 distinct numbers from the set {1,2,3,4,5,6,7,8,9}\{1,2,3,4,5,6,7,8,9\} and arranges them in descending order to form a 33-digit number. Silvia randomly picks 33 distinct numbers from the set {1,2,3,4,5,6,7,8}\{1,2,3,4,5,6,7,8\} and also arranges them in descending order to form a 33-digit number. What is the probability that Bernardo’s number is larger than Silvia’s number?

4772\dfrac{47}{72}

3756\dfrac{37}{56}

23\dfrac{2}{3}

4972\dfrac{49}{72}

3956\dfrac{39}{56}

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

按 Bernardo 是否选到 99 分情况。

Separate cases according to whether Bernardo picks 99

大提示:

若没有 99,两人的数对称,除了选到相同集合的情况。

Without a 9,9, the two numbers are symmetric except when the chosen sets match

解答:

分两种情况:Bernardo 选到 99,或者没有选到。

情况 11 Bernardo 选到 99

固定一个数后,另外两个数有 (82)=28\binom{8}{2} = 28 种选法。

总选法为 (93)=84\binom{9}{3} = 84,所以此情况的概率是 2884=13 \dfrac{28}{84} = \dfrac{1}{3}\text{。}

注意,如果 Bernardo 选到 99,他一定比 Silvia 的数大。

因此本情况中 Bernardo 一定获胜。

情况 22 Bernardo 没有选到 99

这种情况发生的概率为 113=231 - \frac{1}{3} = \frac{2}{3}。此时两人从同一组数字中选择,获胜机会对称。

我们还需要求出两人选到相同数字的概率。Silvia 与 Bernardo 选到同一组数字的概率为 1(83)=156 \dfrac{1}{\binom{8}{3}} = \dfrac{1}{56} 于是此时 Bernardo 的数更大的概率为 11562=55112 \dfrac{1 - \frac{1}{56}}{2} = \dfrac{55}{112}\text{。}

因此 Bernardo 得到较大数的总概率为 13+2355112=3756 \dfrac{1}{3} + \dfrac{2}{3} \cdot \dfrac{55}{112} = \dfrac{37}{56}\text{。}

所以正确答案是 B

There are two cases: Bernardo picks a 99 or he doesn’t.

Case 1:1: Bernardo picks a 99

Since a number is fixed, there are (82)=28\binom{8}{2} = 28 ways to choose the other two numbers.

There are a total of (93)=84\binom{9}{3} = 84 ways to pick all three numbers. The probability is then 2884=13. \dfrac{28}{84} = \dfrac{1}{3}.

Note that if Bernardo picks a 9,9, he automatically has a greater number than Silvia.

This means that Bernardo always wins in this case.

Case 2:2: Bernardo doesn’t pick a 99

There is a 113=231 - \frac{1}{3} = \frac{2}{3} chance of this happening. Since both people are choosing from the same numbers, they have an equal chance of winning.

We still need to find the probability that the numbers are the same. There is a 1(83)=156 \dfrac{1}{\binom{8}{3}} = \dfrac{1}{56} chance that Silvia chooses the same numbers as Bernardo. The probability that Bernardo gets a higher number is then 11562=55112. \dfrac{1 - \frac{1}{56}}{2} = \dfrac{55}{112}.

The total probability of Bernardo getting a higher number is then 13+2355112=3756. \dfrac{1}{3} + \dfrac{2}{3} \cdot \dfrac{55}{112} = \dfrac{37}{56}.

Thus, B is the correct answer.

17.

等角六边形 ABCDEFABCDEF 的边长满足 AB=CD=EF=1AB=CD=EF=1BC=DE=FA=rBC=DE=FA=r\text{。} ACE\triangle ACE 的面积是六边形面积的 70%70\%rr 的所有可能值之和是多少?

Equiangular hexagon ABCDEFABCDEF has side lengths AB=CD=EF=1AB=CD=EF=1 and BC=DE=FA=r.BC=DE=FA=r. The area of ACE\triangle ACE is 70%70\% of the area of the hexagon. What is the sum of all possible values of r?r?

433\dfrac{4\sqrt{3}}{3}

103\dfrac{10}{3}

44

174\dfrac{17}{4}

66

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

将六边形分成 ACE\triangle ACE 和三个角上的三角形。

Split the hexagon into ACE\triangle ACE and three corner triangles

大提示:

r2+r+1r^2+r+1rr 表示两个面积。

Express both areas using r2+r+1r^2+r+1 and rr

解答:

注意 ACE\triangle ACE 是等边三角形。在 ABC\triangle ABC 中用余弦定理,得 AC2=r2+122rcos120AC^2=r^2+1^2-2r\cos120^\circ =r2+r+1=r^2+r+1

因此 ACE\triangle ACE 的面积为 34(r2+r+1) \dfrac{\sqrt3}{4} (r^2 + r + 1)\text{。}

三个角上的三角形 ABC\triangle ABCCDE\triangle CDEEFA\triangle EFA 各自面积为 121rsin120=r34\frac12\cdot1\cdot r\cdot\sin120^\circ=\frac{r\sqrt3}{4}

所以六边形面积为 34(r2+r+1)\dfrac{\sqrt3}{4}(r^2+r+1) +3r34+3\cdot\dfrac{r\sqrt3}{4} =34(r2+4r+1)=\dfrac{\sqrt3}{4}(r^2+4r+1)

条件 [ACE]=70%[ABCDEF][ACE]=70\%\cdot[ABCDEF] 给出 r2+r+1=710(r2+4r+1)r^2+r+1=\dfrac{7}{10}(r^2+4r+1)\text{,} 所以 r26r+1=0r^2-6r+1=0

由韦达定理,rr 的所有可能值之和为 66

因此 E 是正确答案。

Note that ACE\triangle ACE is equilateral. Using the Law of Cosines in ABC,\triangle ABC, we get AC2=r2+122rcos120AC^2=r^2+1^2-2r\cos120^\circ =r2+r+1.=r^2+r+1.

The area of ACE\triangle ACE is then 34(r2+r+1). \dfrac{\sqrt3}{4} (r^2 + r + 1).

The three corner triangles ABC,\triangle ABC, CDE,\triangle CDE, and EFA\triangle EFA each have area 121rsin120=r34.\frac12\cdot1\cdot r\cdot\sin120^\circ=\frac{r\sqrt3}{4}.

Thus the hexagon has area 34(r2+r+1)\dfrac{\sqrt3}{4}(r^2+r+1) +3r34+3\cdot\dfrac{r\sqrt3}{4} =34(r2+4r+1).=\dfrac{\sqrt3}{4}(r^2+4r+1).

The condition [ACE]=70%[ABCDEF][ACE]=70\%\cdot[ABCDEF] gives r2+r+1=710(r2+4r+1),r^2+r+1=\dfrac{7}{10}(r^2+4r+1), so r26r+1=0.r^2-6r+1=0.

By Vieta’s formulas, the sum of the possible values of rr is 6.6.

Thus, E is the correct answer.

18.

一条 1616 步路径要从 (4,4)(-4,-4) 走到 (4,4)(4,4),每一步都使 xx 坐标或 yy 坐标增加 11。有多少条这样的路径在每一步都位于正方形 2x2-2\le x\le22y2-2\le y\le2 的外部或边界上?

A 1616-step path is to go from (4,4)(-4,-4) to (4,4)(4,4) with each step increasing either the xx-coordinate or the yy-coordinate by 1.1. How many such paths stay outside or on the boundary of the square 2x2,-2\le x\le2, 2y2-2\le y\le2 at each step?

9292

144144

15681568

16981698

12,80012{,}800

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

每一步都使 x+yx+y 增加 11,所以路径与直线 x+y=0x+y=0 恰好相交于一个格点。

Each step increases x+yx+y by 1,1, so the path meets the line x+y=0x+y=0 at exactly one lattice point

大提示:

为避开正方形内部,该点只能是 (±2,2),(±3,3)(\pm2,\mp2),(\pm3,\mp3),或 (±4,4)(\pm4,\mp4);分别计数。

To avoid the square’s interior, that point is (±2,2),(±3,3),(\pm2,\mp2),(\pm3,\mp3), or (±4,4);(\pm4,\mp4); count paths through each

解答:

每一步都使 x+yx+y 增加 11,而坐标和从 8-8 变到 88,所以每条路径恰好经过一个满足 x+y=0x+y=0 的格点。

为了不进入开正方形内部,该点 (t,t)(t,-t) 必须满足 t2|t|\ge2,所以它是 (±2,2),(±3,3),(±4,4)(\pm2,\mp2),(\pm3,\mp3),(\pm4,\mp4) 之一。

由对称性,只考虑三点 (4,4),(3,3),(2,2)(-4,4),(-3,3),(-2,2),然后将结果加倍。从 (4,4)(-4,-4)((4j),4j)(-(4-j),4-j) 的路径数为 (8j)\binom{8}{j},继续到 (4,4)(4,4) 的路径数也是 (8j)\binom{8}{j}

因此总数为 2((80)2+(81)2+(82)2)=2(1+64+784)=1698 \begin{gathered} 2\left(\binom80^2+\binom81^2+\binom82^2\right) \\ =2(1+64+784) \\ =1698 \end{gathered}\text{。}

所以正确答案是 D

Every step increases x+yx+y by 1,1, which runs from 8-8 to 8,8, so each path passes through exactly one lattice point with x+y=0.x+y=0.

To stay out of the open square, that point (t,t)(t,-t) must have t2,|t|\ge2, so it is one of (±2,2),(±3,3),(±4,4).(\pm2,\mp2),(\pm3,\mp3),(\pm4,\mp4).

By symmetry consider the three points (4,4),(3,3),(2,2)(-4,4),(-3,3),(-2,2) and double. The number of paths from (4,4)(-4,-4) to ((4j),4j)(-(4-j),4-j) is (8j),\binom{8}{j}, and the number continuing on to (4,4)(4,4) is also (8j).\binom{8}{j}.

Therefore the total is 2((80)2+(81)2+(82)2)=2(1+64+784)=1698. \begin{gathered} 2\left(\binom80^2+\binom81^2+\binom82^2\right) \\ =2(1+64+784) \\ =1698. \end{gathered}

Thus, D is the correct answer.

19.

一排有 20102010 个盒子,每个盒子里有一颗红弹珠;对 1k20101 \le k \le 2010,第 kk 个盒子还含有 kk 颗白弹珠。Isabella 从第一个盒子开始,依次从每个盒子中随机抽取一颗弹珠。她第一次抽到红弹珠时停止。令 P(n)P(n) 为 Isabella 正好抽取 nn 颗弹珠后停止的概率。使 P(n)<12010P(n) \lt \dfrac{1}{2010} 的最小 nn 是多少?

Each of 20102010 boxes in a line contains a single red marble, and for 1k2010,1 \le k \le 2010, the box in the kkth position also contains kk white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let P(n)P(n) be the probability that Isabella stops after drawing exactly nn marbles. What is the smallest value of nn for which P(n)<12010?P(n) \lt \dfrac{1}{2010}?

4545

6363

6464

201201

10051005

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

n1n-1 次必须抽到白弹珠,第 nn 次抽到红弹珠。

The first n1n-1 draws must be white, then the nnth draw red

大提示:

抽到白弹珠的各个概率相乘后会逐项相消:1223n1n\dfrac12\cdot\dfrac23\cdots\dfrac{n-1}{n}

The white probabilities telescope: 1223n1n\dfrac12\cdot\dfrac23\cdots\dfrac{n-1}{n}

解答:

kk 个盒子中有 k+1k + 1 颗弹珠,所以 Isabella 从中抽到白弹珠的概率为 kk+1\dfrac{k}{k + 1}

抽到红弹珠的概率为 1k+1\dfrac{1}{k + 1}。要在抽到第 nn 颗弹珠后停止,前 n1n - 1 颗必须都是白色。

其概率为 1223n1n1n+1 \dfrac{1}{2} \cdot \dfrac{2}{3} \cdot \ldots \cdot \dfrac{n - 1}{n} \cdot \dfrac{1}{n + 1}\text{。}

所有分子都与相邻分母相消,所以这个表达式化为 1n(n+1)\dfrac{1}{n(n + 1)}

需要寻找最小的 nn,使得 1n(n+1)<12010 \dfrac{1}{n(n + 1)} \lt \dfrac{1}{2010} n(n+1)>2010 n(n + 1) \gt 2010\text{。}

因为 4445=1980<201044\cdot45=1980\lt2010,但 4546=2070>201045\cdot46=2070\gt2010,所以最小的 nn4545

所以正确答案是 A

Since there are k+1k + 1 marbles in the kk th box, there is a kk+1\dfrac{k}{k + 1} chance Isabella draws a white marble from it.

The probability of drawing a red marble is then 1k+1.\dfrac{1}{k + 1}. To stop after drawing the nn th marble, the first n1n - 1 marbles must have been white.

This happens with a probability of 1223n1n1n+1. \dfrac{1}{2} \cdot \dfrac{2}{3} \cdot \ldots \cdot \dfrac{n - 1}{n} \cdot \dfrac{1}{n + 1}.

Note that all the numerators cancel with the adjacent denominator, which means that this expression reduces to 1n(n+1).\dfrac{1}{n(n + 1)}.

We have to find the smallest nn such that 1n(n+1)<12010 \dfrac{1}{n(n + 1)} \lt \dfrac{1}{2010} n(n+1)>2010. n(n + 1) \gt 2010.

Since 4445=1980<201044\cdot45=1980\lt2010 but 4546=2070>2010,45\cdot46=2070\gt2010, the smallest such nn is 45.45.

Thus, A is the correct answer.

20.

等差数列 (an)(a_n)(bn)(b_n) 的各项都是整数,且 a1=b1=1<a2b2a_1=b_1=1\lt a_2\le b_2。若对某个 nnanbn=2010a_nb_n=2010,则 nn 的最大可能值是多少?

Arithmetic sequences (an)(a_n) and (bn)(b_n) have integer terms with a1=b1=1<a2b2a_1=b_1=1\lt a_2\le b_2 and anbn=2010a_nb_n=2010 for some n.n. What is the largest possible value of n?n?

22

33

88

288288

20092009

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

写成 an=1+(n1)d1a_n=1+(n-1)d_1bn=1+(n1)d2b_n=1+(n-1)d_2,所以 n1n-1 同时整除 an1a_n-1bn1b_n-1

Write an=1+(n1)d1a_n=1+(n-1)d_1 and bn=1+(n1)d2,b_n=1+(n-1)d_2, so n1n-1 divides both an1a_n-1 and bn1b_n-1

大提示:

检查 20102010 的每对因数,且令 anbna_n\le b_n;然后 n1n-1 必须整除 gcd(an1,bn1)\gcd(a_n-1,b_n-1)

Check each factor pair of 20102010 with anbn;a_n\le b_n; then n1n-1 must divide gcd(an1,bn1)\gcd(a_n-1,b_n-1)

解答:

因为 an=1+(n1)d1a_n=1+(n-1)d_1bn=1+(n1)d2b_n=1+(n-1)d_2,其中 d1,d2d_1,d_2 为整数,所以 n1n-1 同时整除 an1a_n-1bn1b_n-1,从而整除 gcd(an1,bn1)\gcd(a_n-1,b_n-1)

满足 2anbn2\le a_n\le b_n20102010 因数对为 (2,1005)(2,1005)(3,670)(3,670)(5,402)(5,402)(6,335)(6,335)(10,201)(10,201)(15,134)(15,134)(30,67)(30,67)

除了 (15,134)(15,134) 外,每对的 an1a_n-1bn1b_n-1 都互质,迫使 n=2n=2。对于 (15,134)(15,134)gcd(14,133)=7\gcd(14,133)=7,所以 n1n-1 可以等于 77,得到 n=8n=8

数列 an=2n1a_n=2n-1bn=19n18b_n=19n-18 可以达到这个值,因此最大值为 88

所以正确答案是 C

Since an=1+(n1)d1a_n=1+(n-1)d_1 and bn=1+(n1)d2b_n=1+(n-1)d_2 for integers d1,d2,d_1,d_2, the value n1n-1 divides both an1a_n-1 and bn1,b_n-1, hence divides gcd(an1,bn1).\gcd(a_n-1,b_n-1).

The factor pairs of 20102010 with 2anbn2\le a_n\le b_n are (2,1005),(2,1005), (3,670),(3,670), (5,402),(5,402), (6,335),(6,335), (10,201),(10,201), (15,134),(15,134), and (30,67).(30,67).

For every pair except (15,134),(15,134), the numbers an1a_n-1 and bn1b_n-1 are relatively prime, forcing n=2.n=2. For (15,134),(15,134), gcd(14,133)=7,\gcd(14,133)=7, so n1n-1 can equal 7,7, giving n=8.n=8.

The sequences an=2n1a_n=2n-1 and bn=19n18b_n=19n-18 realize this, so the largest value is 8.8.

Thus, C is the correct answer.

21.

函数图像 y=x610x5y=x^6-10x^5 +29x44x3+ax2+29x^4-4x^3+ax^2 除了在三个 xx 值处与直线 y=bx+cy=bx+c 相交外,其余都在该直线上方。这三个值中最大的是多少?

The graph of y=x610x5y=x^6-10x^5 +29x44x3+ax2+29x^4-4x^3+ax^2 lies above the line y=bx+cy=bx+c except at three values of x,x, where the graph and the line intersect. What is the largest of those values?

44

55

66

77

88

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

图像减去直线得到一个非负多项式,并有三个二重根,所以它等于 ((xp)(xq)(xr))2\big((x-p)(x-q)(x-r)\big)^2

The graph minus the line is nonnegative with three double roots, so it equals ((xp)(xq)(xr))2\big((x-p)(x-q)(x-r)\big)^2

大提示:

比较 x5,x4,x3x^5,x^4,x^3 的系数来确定三次多项式,再分解它。

Match the coefficients of x5,x4,x3x^5,x^4,x^3 to determine the cubic, then factor it

解答:

f(x)f(x) 为该图像减去直线所得的函数。它非负,并在三个点处为零,每个零点都是二重根,所以 f(x)=(x3Ax2+BxC)2f(x)=\big(x^3-Ax^2+Bx-C\big)^2\text{。}

比较系数可得 2A=10A=5-2A=-10\Rightarrow A=5,接着 A2+2B=29B=2A^2+2B=29\Rightarrow B=2,再由 2C2AB=4C=8-2C-2AB=-4\Rightarrow C=-8

因此三次式为 x35x2+2x+8x^3-5x^2+2x+8 =(x+1)(x2)(x4)=(x+1)(x-2)(x-4),根为 1,2-1,244。最大值为 44

所以正确答案是 A

Let f(x)f(x) be the graph minus the line. It is nonnegative and vanishes at three points, each a double root, so f(x)=(x3Ax2+BxC)2.f(x)=\big(x^3-Ax^2+Bx-C\big)^2.

Matching coefficients gives 2A=10A=5,-2A=-10\Rightarrow A=5, then A2+2B=29B=2,A^2+2B=29\Rightarrow B=2, then 2C2AB=4C=8.-2C-2AB=-4\Rightarrow C=-8.

Thus the cubic is x35x2+2x+8x^3-5x^2+2x+8 =(x+1)(x2)(x4),=(x+1)(x-2)(x-4), with roots 1,2,-1,2, and 4.4. The largest is 4.4.

Thus, A is the correct answer.

22.

下式的最小值是多少:f(x)=x1+2x1+3x1++119x1 \begin{gathered} f(x) = |x-1|+|2x-1| \\ {}+|3x-1|+\cdots+|119x-1| \end{gathered}\text{?}

What is the minimum value of f(x)=x1+2x1+3x1++119x1? \begin{gathered} f(x) = |x-1|+|2x-1| \\ {}+|3x-1|+\cdots+|119x-1|? \end{gathered}

4949

5050

5151

5252

5353

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

ff 是分段线性函数,拐点在 x=1kx=\tfrac1k;最小值出现在斜率由负变正的位置。

ff is piecewise linear with corners at x=1k;x=\tfrac1k; the minimum is where its slope turns from negative to positive

大提示:

[1m,1m1]\left[\tfrac1m,\tfrac1{m-1}\right] 上,斜率为 7140(m1)m7140-(m-1)m;找出它为零的位置。

On [1m,1m1]\left[\tfrac1m,\tfrac1{m-1}\right] the slope is 7140(m1)m;7140-(m-1)m; find where it vanishes

解答:

函数 ff 是分段线性的,断点在 x=1kx=\tfrac1k。在区间 [1m,1m1]\left[\tfrac1m,\tfrac1{m-1}\right] 上,它的斜率为 k=m119kk=1m1k=7140(m1)m \begin{aligned} &\sum_{k=m}^{119}k \\ &\quad {}-\sum_{k=1}^{m-1}k=7140-(m-1)m\text{,} \end{aligned} 其中 7140=11912027140=\tfrac{119\cdot120}{2}

(m1)m=7140(m-1)m=7140 时斜率为零,即 m=85m=85,所以最小值出现在右端点 x=184x=\tfrac1{84}

在那里,k84k\le84 的项贡献 84k84\tfrac{84-k}{84}k85k\ge85 的项贡献 k8484\tfrac{k-84}{84},所以 f(184)=348684+63084=41.5+7.5=49 \begin{aligned} f\left(\tfrac1{84}\right) &= \frac{3486}{84}+\frac{630}{84} \\ &= 41.5+7.5=49\text{。} \end{aligned}

所以正确答案是 A

The function ff is piecewise linear with breakpoints at x=1k.x=\tfrac1k. On the interval [1m,1m1]\left[\tfrac1m,\tfrac1{m-1}\right] its slope is k=m119kk=1m1k=7140(m1)m, \begin{aligned} &\sum_{k=m}^{119}k \\ &\quad {}-\sum_{k=1}^{m-1}k=7140-(m-1)m, \end{aligned} where 7140=1191202.7140=\tfrac{119\cdot120}{2}.

This slope is zero when (m1)m=7140,(m-1)m=7140, i.e. m=85,m=85, so the minimum occurs at the right endpoint x=184.x=\tfrac1{84}.

There, terms with k84k\le84 contribute 84k84\tfrac{84-k}{84} and terms with k85k\ge85 contribute k8484,\tfrac{k-84}{84}, so f(184)=348684+63084=41.5+7.5=49. \begin{aligned} f\left(\tfrac1{84}\right) &= \frac{3486}{84}+\frac{630}{84} \\ &= 41.5+7.5=49. \end{aligned}

Thus, A is the correct answer.

23.

90!90! 的最后两个非零数字组成的数等于 nn。求 nn

The number obtained from the last two nonzero digits of 90!90! is equal to n.n. What is n?n?

1212

3232

4848

5252

6868

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

去掉产生末尾零的因数,然后模 100100 计算。

Remove the factors making trailing zeroes, then work modulo 100100

大提示:

用模 44 和模 2525 的同余确定最后两位。

Use congruences modulo 44 and modulo 2525 to pin down the last two digits

解答:

90!90! 末尾零的个数为 905+9025=21\left\lfloor\dfrac{90}{5}\right\rfloor+\left\lfloor\dfrac{90}{25}\right\rfloor=21。令 N=90!1021N=\dfrac{90!}{10^{21}}

去掉 102110^{21} 后仍剩下超过两个因数 22,所以 N0(mod4)N\equiv0 \pmod4

AA90!90! 中不能被 55 整除的那些因数之积,BB 为能被 55 整除的那些因数之积。每一块 (5j+1)(5j+2)(5j+3)(5j+4)(5j+1)(5j+2)(5j+3)(5j+4) 都满足 241(mod25)24\equiv-1\pmod{25},一共有 1818 块,所以 A1(mod25)A\equiv1\pmod{25}

BB 中去掉 2121 个因数 55 后,剩余因数可分组为 B521=(1234)(6789)(11121314)(161718)(123)1(mod25) \begin{aligned} \dfrac{B}{5^{21}}={}&(1\cdot2\cdot3\cdot4) \\ &\cdot(6\cdot7\cdot8\cdot9) \\ &\cdot(11\cdot12\cdot13\cdot14) \\ &\cdot(16\cdot17\cdot18)(1\cdot2\cdot3) \\ &\equiv-1\pmod{25} \end{aligned}\text{。}

因此 90!5211(mod25)\dfrac{90!}{5^{21}}\equiv-1\pmod{25}。因为 2212(mod25)2^{21}\equiv2\pmod{25},而 222525 的逆元为 1313,所以 N1312(mod25)N\equiv-13\equiv12\pmod{25}

同时满足 0(mod4)0\pmod412(mod25)12\pmod{25} 的数为 12(mod100)12\pmod{100},所以最后两个非零数字组成 1212

所以正确答案是 A

The number of trailing zeroes in 90!90! is 905+9025=21.\left\lfloor\dfrac{90}{5}\right\rfloor+\left\lfloor\dfrac{90}{25}\right\rfloor=21. Let N=90!1021.N=\dfrac{90!}{10^{21}}.

There are still more than two factors of 22 left after removing 1021,10^{21}, so N0(mod4).N\equiv0 \pmod4.

Let AA be the product of factors of 90!90! not divisible by 5,5, and let BB be the product of the factors divisible by 5.5. Each block (5j+1)(5j+2)(5j+3)(5j+4)(5j+1)(5j+2)(5j+3)(5j+4) is 241(mod25),24\equiv-1\pmod{25}, and there are 1818 blocks, so A1(mod25).A\equiv1\pmod{25}.

After removing the 2121 factors of 55 from B,B, the remaining factors can be grouped as B521=(1234)(6789)(11121314)(161718)(123)1(mod25). \begin{aligned} \dfrac{B}{5^{21}}={}&(1\cdot2\cdot3\cdot4) \\ &\cdot(6\cdot7\cdot8\cdot9) \\ &\cdot(11\cdot12\cdot13\cdot14) \\ &\cdot(16\cdot17\cdot18)(1\cdot2\cdot3) \\ &\equiv-1\pmod{25}. \end{aligned}

Therefore 90!5211(mod25).\dfrac{90!}{5^{21}}\equiv-1\pmod{25}. Since 2212(mod25)2^{21}\equiv2\pmod{25} and the inverse of 22 modulo 2525 is 13,13, we get N1312(mod25).N\equiv-13\equiv12\pmod{25}.

The number congruent to 0(mod4)0\pmod4 and 12(mod25)12\pmod{25} is 12(mod100),12\pmod{100}, so the last two nonzero digits form 12.12.

Thus, A is the correct answer.

24.

f(x)=log10(sin(πx)sin(2πx)sin(3πx)sin(4πx)sin(5πx)sin(6πx)sin(7πx)sin(8πx)) \begin{gathered} f(x)=\log_{10}\big(\sin(\pi x) \\ {}\cdot\sin(2\pi x)\cdot\sin(3\pi x) \\ {}\cdot\sin(4\pi x)\cdot\sin(5\pi x) \\ {}\cdot\sin(6\pi x)\cdot\sin(7\pi x) \\ {}\cdot\sin(8\pi x)\big) \end{gathered}\text{。}f(x)f(x) 的定义域与区间 [0,1][0,1] 的交集是 nn 个互不相交的开区间的并。求 nn

Let f(x)=log10(sin(πx)sin(2πx)sin(3πx)sin(4πx)sin(5πx)sin(6πx)sin(7πx)sin(8πx)). \begin{gathered} f(x)=\log_{10}\big(\sin(\pi x) \\ {}\cdot\sin(2\pi x)\cdot\sin(3\pi x) \\ {}\cdot\sin(4\pi x)\cdot\sin(5\pi x) \\ {}\cdot\sin(6\pi x)\cdot\sin(7\pi x) \\ {}\cdot\sin(8\pi x)\big). \end{gathered} The intersection of the domain of f(x)f(x) with the interval [0,1][0,1] is a union of nn disjoint open intervals. What is n?n?

22

1212

1818

2222

3636

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

定义域满足 g(x)=k=18sin(kπx)>0g(x)=\prod_{k=1}^8\sin(k\pi x)\gt0gg 关于 x=12x=\tfrac12 对称。

The domain is where g(x)=k=18sin(kπx)>0;g(x)=\prod_{k=1}^8\sin(k\pi x)\gt0; gg is symmetric about x=12x=\tfrac12

大提示:

统计 (0,12)\big(0,\tfrac12\big) 内形如 kn\tfrac{k}{n} 的零点,并注意在 14\tfrac1413\tfrac13 处符号不会改变。

Count the zeros kn\tfrac{k}{n} in (0,12)\big(0,\tfrac12\big) and note the sign fails to flip at 14\tfrac14 and 13\tfrac13

解答:

g(x)=k=18sin(kπx)g(x)=\prod_{k=1}^8\sin(k\pi x);则 ff 的定义域为 g(x)>0g(x)\gt0 的地方。由于 sin(kπ(1x))\sin(k\pi(1-x)) =(1)k+1sin(kπx)=(-1)^{k+1}\sin(k\pi x),且 k=18(k+1)\sum_{k=1}^8(k+1) 为偶数,所以 g(1x)=g(x)g(1-x)=g(x),只需研究 (0,12)\big(0,\tfrac12\big) 后再加倍。

(0,12)\big(0,\tfrac12\big) 中,gg 的零点是满足 kn\tfrac{k}{n}2n82\le n\le81k<n21\le k\lt\tfrac n2gcd(k,n)=1\gcd(k,n)=1 的分数。对 n=2,,8n=2,\ldots,8 数量分别为 0,1,1,2,1,3,20,1,1,2,1,3,2,合计 1010 个。

1010 个零点把 (0,12)\big(0,\tfrac12\big) 分成 1111 个小区间,在每个小区间上 gg 的符号恒定。靠近 00 时每个因子为正,所以 g>0g\gt0。每经过一个零点符号通常改变,但在 14=28\tfrac14=\tfrac2813=26\tfrac13=\tfrac26 处有偶数个因子同时为零,符号不改变。

跟踪符号可知,这 1111 个小区间中正好有 66 个满足 g>0g\gt0。由对称性,在 (12,1)\big(\tfrac12,1\big) 中还有 66 个,所以 n=12n=12

因此,正确答案是 B

Let g(x)=k=18sin(kπx);g(x)=\prod_{k=1}^8\sin(k\pi x); the domain of ff is where g(x)>0.g(x)\gt0. Since sin(kπ(1x))\sin(k\pi(1-x)) =(1)k+1sin(kπx)=(-1)^{k+1}\sin(k\pi x) and k=18(k+1)\sum_{k=1}^8(k+1) is even, g(1x)=g(x),g(1-x)=g(x), so it suffices to study (0,12)\big(0,\tfrac12\big) and double.

In (0,12)\big(0,\tfrac12\big) the zeros of gg are the fractions kn\tfrac{k}{n} with 2n8,2\le n\le8, 1k<n2,1\le k\lt\tfrac n2, and gcd(k,n)=1.\gcd(k,n)=1. For n=2,,8n=2,\ldots,8 there are 0,1,1,2,1,3,20,1,1,2,1,3,2 of them, totaling 10.10.

These 1010 zeros split (0,12)\big(0,\tfrac12\big) into 1111 subintervals on which gg has constant sign. Near 00 every factor is positive, so g>0g\gt0 there, and the sign flips at each zero except 14=28\tfrac14=\tfrac28 and 13=26,\tfrac13=\tfrac26, where an even number of factors vanish.

Tracking the signs, exactly 66 of the 1111 subintervals have g>0.g\gt0. By symmetry there are 66 more in (12,1),\big(\tfrac12,1\big), so n=12.n=12.

Thus, B is the correct answer.

25.

如果一个四边形可以通过旋转和平移得到另一个四边形,则认为这两个四边形相同。边长为整数且周长等于 3232 的不同凸圆内接四边形有多少个?

Two quadrilaterals are considered the same if one can be obtained from the other by a rotation and a translation. How many different convex cyclic quadrilaterals are there with integer sides and perimeter equal to 32?32?

560560

564564

568568

14981498

22552255

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

给定一组按圆周顺序排列的边长后,凸圆内接四边形唯一;每条边至多为 1515

A convex cyclic quadrilateral with given side lengths in a given cyclic order is unique; each side is at most 1515

大提示:

先数和为 3232 的有序四元组,再用 Burnside 引理按循环旋转取商。

Count ordered quadruples summing to 32,32, then quotient by cyclic rotation using Burnside’s lemma

解答:

一个凸圆内接四边形由其按圆周顺序排列的边长唯一确定,且存在的条件是最大边长小于其他三边之和。周长为 3232 时,每条边至多为 1515

先数正整数有序四元组 (a,b,c,d)(a,b,c,d),满足 a+b+c+d=32a+b+c+d=32 且每项至多为 1515。若没有上界限制,有 (313)=4495\binom{31}{3}=4495 个;去掉某一项至少为 1616 的情况,需减去 4(163)=22404\binom{16}{3}=2240,剩下 22552255 个。

四边形的旋转对应于 (a,b,c,d)(a,b,c,d) 的循环置换。由 Burnside 引理,不同四边形的数量为 14(2255+f1+f2+f3)\frac{1}{4}\big(2255+f_1+f_2+f_3\big)\text{,} 其中 fif_i 表示旋转 ii 个位置后不变的四元组数。

旋转一步或三步只固定 (8,8,8,8)(8,8,8,8),所以 f1=f3=1f_1=f_3=1。旋转两步固定形如 (a,b,a,b)(a,b,a,b)a+b=16a+b=161a,b151\le a,b\le15 的四元组,所以 f2=15f_2=15

因此数量为 14(2255+1+15+1)=22724=568 \begin{aligned} \frac{1}{4}(2255+1+15+1) &= \frac{2272}{4} \\ &= 568\text{。} \end{aligned}

所以正确答案是 C

A convex cyclic quadrilateral is determined up to rotation and translation by its cyclic sequence of side lengths, and it exists exactly when the largest side is less than the sum of the others. With perimeter 32,32, this means each side is at most 15.15.

First count ordered quadruples (a,b,c,d)(a,b,c,d) of positive integers with a+b+c+d=32a+b+c+d=32 and each entry at most 15.15. Without the upper bound there are (313)=4495;\binom{31}{3}=4495; removing those with some entry at least 1616 subtracts 4(163)=2240,4\binom{16}{3}=2240, leaving 2255.2255.

Rotations of the quadrilateral correspond to cyclic permutations of (a,b,c,d).(a,b,c,d). By Burnside’s lemma the number of distinct quadrilaterals is 14(2255+f1+f2+f3),\frac{1}{4}\big(2255+f_1+f_2+f_3\big), where fif_i counts quadruples fixed by rotating ii positions.

A one- or three-step rotation fixes only (8,8,8,8),(8,8,8,8), so f1=f3=1.f_1=f_3=1. A two-step rotation fixes (a,b,a,b)(a,b,a,b) with a+b=16a+b=16 and 1a,b15,1\le a,b\le15, giving f2=15.f_2=15.

Hence the count is 14(2255+1+15+1)=22724=568. \begin{aligned} \frac{1}{4}(2255+1+15+1) &= \frac{2272}{4} \\ &= 568. \end{aligned}

Thus, C is the correct answer.