2011 AIME II 真题

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

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

或直接跳转到某一道题及其解答: 1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 · 12 · 13 · 14 · 15

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

了解 LIVE课程

计时

3:00:00

1.

加里买了一大杯饮料,但只喝了其中的 mn\frac{m}{n},其中 mmnn 是互质的正整数。如果加里只买原来一半的饮料,并喝掉原先饮用量的两倍,他浪费的饮料量就只有原来的 29\frac{2}{9}。求 m+nm + n

Gary purchased a large beverage, but drank only mn\frac{m}{n} of this beverage, where mm and nn are relatively prime positive integers. If Gary had purchased only half as much and drunk twice as much, he would have wasted only 29\frac{2}{9} as much beverage. Find m+n.m + n.

答案:37
知识点:一次方程比与比例
难度评级:1710
小提示:

设买的量为 xx,喝掉的量为 yy;浪费的量就是 xyx - y

Let xx be the amount purchased and yy the amount drunk; the wasted amount is xyx - y

大提示:

第二种情况浪费 x22y\frac{x}{2} - 2y,所以列出 x22y=29(xy)\frac{x}{2} - 2y = \frac{2}{9}(x - y),并求出 yx\frac{y}{x}

The second scenario wastes x22y,\frac{x}{2} - 2y, so set x22y=29(xy)\frac{x}{2} - 2y = \frac{2}{9}(x - y) and solve for yx\frac{y}{x}

解答:

设加里买了 xx 单位饮料,喝了 yy 单位,于是浪费 xyx - y。在第二种情况中,他会买 x2\frac{x}{2} 单位并喝掉 2y2y 单位,于是浪费 x22y\frac{x}{2} - 2y。条件为 x22y=29(xy)\frac{x}{2} - 2y = \frac{2}{9}(x - y)\text{。}

两边乘以 18189x36y=4x4y9x - 36y = 4x - 4y,所以 5x=32y5x = 32y,从而 yx=532\frac{y}{x} = \frac{5}{32}。因为 gcd(5,32)=1\gcd(5, 32) = 1,答案是 5+32=375 + 32 = 37

Say Gary purchased an amount xx and drank an amount y,y, wasting xy.x - y. In the second scenario he would have purchased x2\frac{x}{2} and drunk 2y,2y, wasting x22y.\frac{x}{2} - 2y. The condition is x22y=29(xy).\frac{x}{2} - 2y = \frac{2}{9}(x - y).

Multiplying by 1818 gives 9x36y=4x4y,9x - 36y = 4x - 4y, so 5x=32y5x = 32y and yx=532.\frac{y}{x} = \frac{5}{32}. Since gcd(5,32)=1,\gcd(5, 32) = 1, the answer is 5+32=37.5 + 32 = 37.

2.

在正方形 ABCDABCD 中,点 EE 在边 AD\overline{AD} 上,点 FF 在边 BC\overline{BC} 上,且 BE=EF=FD=30BE = EF = FD = 30。求正方形 ABCDABCD 的面积。

On square ABCD,ABCD, point EE lies on side AD\overline{AD} and point FF lies on side BC,\overline{BC}, so that BE=EF=FD=30.BE = EF = FD = 30. Find the area of square ABCD.ABCD.

答案:810
难度评级:1970
小提示:

B=(0,0)B = (0, 0)C=(s,0)C = (s, 0)A=(0,s)A = (0, s)D=(s,s)D = (s, s),并令 E=(a,s)E = (a, s)F=(b,0)F = (b, 0)

Put B=(0,0),B = (0, 0), C=(s,0),C = (s, 0), A=(0,s),A = (0, s), D=(s,s),D = (s, s), and write E=(a,s),E = (a, s), F=(b,0)F = (b, 0)

大提示:

BE=FDBE = FD 迫使 b=sab = s - a,然后 EF=BEEF = BE 迫使 a=s3a = \frac{s}{3};最后用 a2+s2=900a^2 + s^2 = 900

BE=FDBE = FD forces b=sa,b = s - a, and then EF=BEEF = BE forces a=s3;a = \frac{s}{3}; finish with a2+s2=900a^2 + s^2 = 900

解答:

设边长为 ss,并取 B=(0,0)B = (0, 0)C=(s,0)C = (s, 0)A=(0,s)A = (0, s)D=(s,s)D = (s, s)。令 E=(a,s)E = (a, s)F=(b,0)F = (b, 0)。于是 BE2=a2+s2BE^2 = a^2 + s^2FD2=(sb)2+s2FD^2 = (s - b)^2 + s^2,且 EF2=(ab)2+s2EF^2 = (a - b)^2 + s^2

BE=FDBE = FDa=sba = s - b,所以 ab=2asa - b = 2a - s。再由 EF=BEEF = BE(2as)2=a2(2a - s)^2 = a^2,其解为 a=s3a = \frac{s}{3}a=sa = s(后一个解会把分别命名的点 EEFF 与角点 DDBB 重合,使三条线段都成为同一条对角线)。所以 a=s3a = \frac{s}{3}

现在 900=BE2=s29+s2=10s29900 = BE^2 = \frac{s^2}{9} + s^2 = \frac{10s^2}{9},所以面积为 s2=910900=810s^2 = \frac{9}{10} \cdot 900 = 810

Let the side length be s,s, and place B=(0,0),B = (0, 0), C=(s,0),C = (s, 0), A=(0,s),A = (0, s), D=(s,s).D = (s, s). Write E=(a,s)E = (a, s) and F=(b,0).F = (b, 0). Then BE2=a2+s2,BE^2 = a^2 + s^2, FD2=(sb)2+s2,FD^2 = (s - b)^2 + s^2, and EF2=(ab)2+s2.EF^2 = (a - b)^2 + s^2.

From BE=FDBE = FD we get a=sb,a = s - b, so ab=2as.a - b = 2a - s. Then EF=BEEF = BE gives (2as)2=a2,(2a - s)^2 = a^2, whose solutions are a=s3a = \frac{s}{3} and a=sa = s (the latter identifies the separately named points EE and FF with corners DD and B,B, making all three segments the same diagonal). So a=s3.a = \frac{s}{3}.

Now 900=BE2=s29+s2=10s29,900 = BE^2 = \frac{s^2}{9} + s^2 = \frac{10s^2}{9}, so the area is s2=910900=810.s^2 = \frac{9}{10} \cdot 900 = 810.

3.

一个凸 1818 边形的各角度数组成一个递增的等差数列,并且每个角度都是整数。求最小角的度数。

The degree measures of the angles of a convex 1818-sided polygon form an increasing arithmetic sequence with integer values. Find the degree measure of the smallest angle.

答案:143
难度评级:1920
小提示:

一个 1818 边形的内角和为 18016=2880180 \cdot 16 = 2880 度。

The interior angles of an 1818-gon sum to 18016=2880180 \cdot 16 = 2880 degrees

大提示:

若最小角为 aa,公差为 dd,则 2a+17d=3202a + 17d = 320,所以 dd 是偶数;凸性限制最大角小于 180180

With smallest angle aa and common difference d,d, 2a+17d=320,2a + 17d = 320, so dd is even; convexity caps the largest angle below 180180

解答:

一个 1818 边形的内角和为 18016=2880180 \cdot 16 = 2880 度。若最小角为 aa,公差为 dd,则 18a+153d=288018a + 153d = 2880,即 2a+17d=3202a + 17d = 320。因为 aadd 都是整数,17d17d 必须为偶数,所以 dd 是偶数;又因为数列递增,d2d \ge 2

凸性要求最大角 a+17d=320+17d2a + 17d = \frac{320 + 17d}{2} 小于 180180,所以 17d<4017d \lt 40,从而 d2d \le 2。因此 d=2d = 2,且 a=320342=143a = \frac{320 - 34}{2} = 143

The interior angles of an 1818-gon sum to 18016=2880180 \cdot 16 = 2880 degrees. If the smallest angle is aa and the common difference is d,d, then 18a+153d=2880,18a + 153d = 2880, i.e. 2a+17d=320.2a + 17d = 320. Since aa and dd are integers, 17d17d must be even, so dd is even, and d2d \ge 2 because the sequence is increasing.

Convexity requires the largest angle a+17d=320+17d2a + 17d = \frac{320 + 17d}{2} to be less than 180,180, so 17d<4017d \lt 40 and d2.d \le 2. Thus d=2d = 2 and a=320342=143.a = \frac{320 - 34}{2} = 143.

4.

在三角形 ABCABC 中,AB=2011ACAB = \frac{20}{11} AC。角 AA 的角平分线与 BC\overline{BC} 交于点 DD。点 MMAD\overline{AD} 的中点。令 PPAC\overline{AC} 与直线 BMBM 的交点。CPCPPAPA 的比可以表示为 mn\frac{m}{n},其中 mmnn 是互质的正整数。求 m+nm + n

In triangle ABC,ABC, AB=2011AC.AB = \frac{20}{11} AC. The angle bisector of angle AA intersects BC\overline{BC} at point D,D, and point MM is the midpoint of AD.\overline{AD}. Let PP be the point of intersection of AC\overline{AC} and line BM.BM. The ratio of CPCP to PAPA can be expressed in the form mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

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

角平分线定理给出 BDDC=ABAC=2011\frac{BD}{DC} = \frac{AB}{AC} = \frac{20}{11}

The angle bisector theorem gives BDDC=ABAC=2011\frac{BD}{DC} = \frac{AB}{AC} = \frac{20}{11}

大提示:

质量点法:在 BB 放质量 1111,在 CC 放质量 2020,则 DD 带有质量 3131;在 AA 放质量 3131 会使中点 MM 平衡。

Mass points: masses 1111 at BB and 2020 at CC make DD carry 31;31; placing 3131 at AA balances the midpoint MM

解答:

根据角平分线定理,BDDC=ABAC=2011\frac{BD}{DC} = \frac{AB}{AC} = \frac{20}{11}。使用质量点法:在 BB 放质量 1111,在 CC 放质量 2020,于是以 BD:DC=20:11BD : DC = 20 : 11 分割 BC\overline{BC} 的点 DD 是它们的平衡点,带有质量 3131。在 AA 放质量 3131,就会使 AADD 的平衡点正好是 AD\overline{AD} 的中点 MM

因此整个系统的质心在直线 BMBM 上,同时也在从 BBAACC 的平衡点的线段上。这个平衡点正是直线 BMBMAC\overline{AC} 的交点 PP,并满足 31PA=20CP31 \cdot PA = 20 \cdot CP

所以 CPPA=3120\frac{CP}{PA} = \frac{31}{20},已经是最简形式,m+n=31+20=51m + n = 31 + 20 = 51

By the angle bisector theorem, BDDC=ABAC=2011.\frac{BD}{DC} = \frac{AB}{AC} = \frac{20}{11}. Use mass points: place mass 1111 at BB and mass 2020 at C,C, so that D,D, which divides BC\overline{BC} with BD:DC=20:11,BD : DC = 20 : 11, is their balance point and carries mass 31.31. Placing mass 3131 at AA makes the balance point of AA and DD exactly the midpoint MM of AD.\overline{AD}.

The center of mass of the whole system therefore lies on line BM,BM, and it also lies on the segment from BB to the balance point of AA and C.C. That balance point is precisely where line BMBM crosses AC,\overline{AC}, namely P,P, and it satisfies 31PA=20CP.31 \cdot PA = 20 \cdot CP.

Hence CPPA=3120,\frac{CP}{PA} = \frac{31}{20}, which is in lowest terms, and m+n=31+20=51.m + n = 31 + 20 = 51.

5.

一个等比数列前 20112011 项的和为 200200。同一个数列前 40224022 项的和为 380380。求该数列前 60336033 项的和。

The sum of the first 20112011 terms of a geometric series is 200.200. The sum of the first 40224022 terms of the same series is 380.380. Find the sum of the first 60336033 terms of the series.

答案:542
知识点:等比数列求和
难度评级:1970
小提示:

20122012 项到第 40224022 项中的每一项,都是前 20112011 项中对应项的 r2011r^{2011} 倍。

Terms 20122012 through 40224022 are r2011r^{2011} times the first 20112011 terms

大提示:

每一块连续 20112011 项的和都是前一块的 r2011r^{2011} 倍;从两个给定和中求出这个比值。

Each successive block of 20112011 terms is the previous block times r2011;r^{2011}; find that ratio from the two given sums

解答:

将数列分成每块 20112011 个连续项。第二块的每一项都是第一块对应项的 r2011r^{2011} 倍,所以各块和构成公比为 r2011r^{2011} 的等比数列。第一块和为 200200,第二块和为 380200=180380 - 200 = 180,所以 r2011=180200=910r^{2011} = \frac{180}{200} = \frac{9}{10}

第三块的和为 180910=162180 \cdot \frac{9}{10} = 162,所以前 60336033 项的和为 380+162=542380 + 162 = 542

Group the series into blocks of 20112011 consecutive terms. Each term of the second block is r2011r^{2011} times the corresponding term of the first block, so the block sums form a geometric sequence with ratio r2011.r^{2011}. The first block sums to 200200 and the second block sums to 380200=180,380 - 200 = 180, so r2011=180200=910.r^{2011} = \frac{180}{200} = \frac{9}{10}.

The third block then sums to 180910=162,180 \cdot \frac{9}{10} = 162, so the sum of the first 60336033 terms is 380+162=542.380 + 162 = 542.

6.

如果一个有序整数四元组 (a,b,c,d)(a, b, c, d) 满足 1a<b<c<d101 \le a \lt b \lt c \lt d \le 10a+d>b+ca + d \gt b + c,则称它为有趣的。有多少个有趣的有序四元组?

Define an ordered quadruple of integers (a,b,c,d)(a, b, c, d) to be interesting if 1a<b<c<d101 \le a \lt b \lt c \lt d \le 10 and a+d>b+c.a + d \gt b + c. How many interesting ordered quadruples are there?

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

条件 a+d>b+ca + d \gt b + c 等价于 dc>bad - c \gt b - a

The condition a+d>b+ca + d \gt b + c is the same as dc>bad - c \gt b - a

大提示:

映射 (a,b,c,d)(a, b, c, d) (11d,11c,11b,11a)\small \mapsto (11 - d,\, 11 - c,\, 11 - b,\, 11 - a) 会交换 dcd - cbab - a;数出满足 dc=bad - c = b - a 的四元组,再利用对称性。

The map (a,b,c,d)(a, b, c, d) (11d,11c,11b,11a)\small \mapsto (11 - d,\, 11 - c,\, 11 - b,\, 11 - a) swaps dcd - c with ba;b - a; count the quadruples with dc=bad - c = b - a and use symmetry

解答:

条件 a+d>b+ca + d \gt b + c 等价于 dc>bad - c \gt b - a。总共有 (104)=210\binom{10}{4} = 210 个四元组,而对合映射 (a,b,c,d)(a, b, c, d) (11d,11c,11b,11a)\small \mapsto (11 - d,\, 11 - c,\, 11 - b,\, 11 - a) 会交换外侧间隔 bab - adcd - c。因此满足 dc>bad - c \gt b - a 的四元组与满足 dc<bad - c \lt b - a 的四元组数量相等,答案为 210T2\frac{210 - T}{2},其中 TT 是满足 dc=bad - c = b - a 的四元组数量。

ba=dc=kb - a = d - c = kcb=jc - b = j,则四元组由 (a,j,k)(a, j, k) 决定,其中 a,j,k1a, j, k \ge 1a+2k+j10a + 2k + j \le 10。当 k=1k = 1223344 时,a+ja + j 的上界依次为 88664422;相应数量分别为 282815156611,所以 T=50T = 50

因此有趣四元组的数量为 210502=80\frac{210 - 50}{2} = 80

The condition a+d>b+ca + d \gt b + c is equivalent to dc>ba.d - c \gt b - a. There are (104)=210\binom{10}{4} = 210 quadruples in all, and the involution (a,b,c,d)(a, b, c, d) (11d,11c,11b,11a)\small \mapsto (11 - d,\, 11 - c,\, 11 - b,\, 11 - a) exchanges the outer gaps bab - a and dc.d - c. So the quadruples with dc>bad - c \gt b - a and those with dc<bad - c \lt b - a are equinumerous, and the answer is 210T2,\frac{210 - T}{2}, where TT counts quadruples with dc=ba.d - c = b - a.

If ba=dc=kb - a = d - c = k and cb=j,c - b = j, the quadruple is determined by (a,j,k)(a, j, k) with a,j,k1a, j, k \ge 1 and a+2k+j10.a + 2k + j \le 10. For k=1,k = 1, 2,2, 3,3, and 4,4, respectively, the bounds on a+ja + j are 8,8, 6,6, 4,4, and 2;2; the corresponding counts are 28,28, 15,15, 6,6, and 1,1, so T=50.T = 50.

Therefore the number of interesting quadruples is 210502=80.\frac{210 - 50}{2} = 80.

7.

埃德有五颗相同的绿色弹珠,还有大量相同的红色弹珠。他把这些绿色弹珠和一些红色弹珠排成一排,发现右侧相邻弹珠颜色相同的弹珠数,恰好等于右侧相邻弹珠颜色不同的弹珠数。例如,GGRRRGGRG 就是一种这样的排列。令 mm 为能使这种排列存在的红色弹珠最大数量,令 NN 为埃德排列这 m+5m + 5 颗弹珠并满足要求的方法数。求 NN 除以 10001000 的余数。

Ed has five identical green marbles, and a large supply of identical red marbles. He arranges the green marbles and some of the red ones in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves equals the number of marbles whose right hand neighbor is the other color. An example of such an arrangement is GGRRRGGRG. Let mm be the maximum number of red marbles for which such an arrangement is possible, and let NN be the number of ways in which Ed can arrange the m+5m + 5 marbles to satisfy the requirement. Find the remainder when NN is divided by 1000.1000.

答案:3
难度评级:2710
小提示:

如果这一排由 kk 个极大单色段组成,则异色相邻对的数量为 k1k - 1

If the row consists of kk maximal single-color runs, the number of different-color neighbor pairs is k1k - 1

大提示:

五颗绿色弹珠最多允许 1111 个色段,所以最多有 1010 次颜色变化。相同与不同的相邻对数量相等会迫使有 1616 颗红色弹珠;数出把 1616 分成 66 个正部分的组成数。

Five greens allow at most 1111 runs, so at most 1010 color changes. Matching same and different pairs then forces 1616 reds; count compositions of 1616 into 66 positive parts.

解答:

将这一排分成极大单色段。如果有 kk 个色段,则恰好有 k1k - 1 个异色相邻对。因为色段颜色交替,且五颗绿色弹珠最多形成 55 个绿色段,所以最多有 66 个红色段,因此最多有 1111 个色段和最多 1010 个异色相邻对。若有 nn 颗红色弹珠,总共有 n+4n + 4 个相邻对,而题目要求其中一半是异色对,所以 n+420n + 4 \le 20,即 n16n \le 16。因此 m=16m = 16

当有 1616 颗红色弹珠、总共 2121 颗弹珠时,异色相邻对必须恰好为 1010 个,所以恰好有 1111 个色段:颜色必须按红色、绿色、红色、\cdots、红色交替,其中有 66 个红色段,且中间有 55 颗单独的绿色弹珠。排列对应于把 1616 分成 66 个正部分的组成,数量为 (155)=3003\binom{15}{5} = 3003

因此 N=3003N = 3003,除以 10001000 的余数为 33

Break the row into maximal single-color runs. If there are kk runs, there are exactly k1k - 1 different-color neighbor pairs. Since runs alternate colors and the five green marbles form at most 55 runs, there are at most 66 red runs, hence at most 1111 runs and at most 1010 different-color pairs. With nn red marbles there are n+4n + 4 neighbor pairs in all, and the requirement says half of them are different-color pairs, so n+420,n + 4 \le 20, i.e. n16.n \le 16. Thus m=16.m = 16.

With 1616 reds and 2121 marbles, the count of different-color pairs must be exactly 10,10, so there are exactly 1111 runs: the colors must alternate as red–green–red–\cdots–red with 66 red runs and 55 single green marbles between them. The arrangements correspond to compositions of 1616 into 66 positive parts, of which there are (155)=3003.\binom{15}{5} = 3003.

Hence N=3003,N = 3003, and the remainder upon division by 10001000 is 3.3.

8.

z1z_1z2z_2z3z_3\ldotsz12z_{12} 为多项式 z12236z^{12} - 2^{36}1212 个零点。对每个 jj,令 wjw_j 等于 zjz_jizj\mathrm{i}z_j。那么 j=112wj\sum_{j=1}^{12} w_j 的实部的最大可能值可以写成 m+nm + \sqrt{n},其中 mmnn 是正整数。求 m+nm + n

Let z1,z_1, z2,z_2, z3,z_3, ,\ldots, z12z_{12} be the 1212 zeroes of the polynomial z12236.z^{12} - 2^{36}. For each j,j, let wjw_j be one of zjz_j or izj.\mathrm{i}z_j. Then the maximum possible value of the real part of j=112wj\sum_{j=1}^{12} w_j can be written as m+n,m + \sqrt{n}, where mm and nn are positive integers. Find m+n.m + n.

答案:784
难度评级:2560
小提示:

这些零点是 8(cosπj6+isinπj6)8\big(\cos\frac{\pi j}{6} + \mathrm{i}\sin\frac{\pi j}{6}\big),且 iz\mathrm{i}z 的实部是 zz 的虚部的相反数。

The zeroes are 8(cosπj6+isinπj6),8\big(\cos\frac{\pi j}{6} + \mathrm{i}\sin\frac{\pi j}{6}\big), and the real part of iz\mathrm{i}z is minus the imaginary part of zz

大提示:

对每个 jj 独立地选取 8cosπj68\cos\frac{\pi j}{6}8sinπj6-8\sin\frac{\pi j}{6} 中较大的那个。

For each jj independently take the larger of 8cosπj68\cos\frac{\pi j}{6} and 8sinπj6-8\sin\frac{\pi j}{6}

解答:

这些零点为 zj=8(cosπj6+isinπj6)z_j = 8\left(\cos\frac{\pi j}{6} + \mathrm{i}\sin\frac{\pi j}{6}\right),其中 j=1j = 1\ldots1212,并且 Re(izj)=Im(zj)\operatorname{Re}(\mathrm{i}z_j) = -\operatorname{Im}(z_j)。因为各个选择彼此独立,和的实部最大值为 j8max(cosπj6,sinπj6)\sum_j 8\max\left(\cos\frac{\pi j}{6},\, -\sin\frac{\pi j}{6}\right)

比较两个值,sinπj6-\sin\frac{\pi j}{6} 恰好在 j=5j = 5\ldots1010 时更大。保留的余弦值对应 j=1j = 122334411111212,其和为 32+12+012+32+1=1+3 \begin{aligned} &\frac{\sqrt{3}}{2} + \frac{1}{2} + 0 - \frac{1}{2} \\ &\quad {}+ \frac{\sqrt{3}}{2} + 1 = 1 + \sqrt{3} \end{aligned}\text{,}保留的 sinπj6-\sin\frac{\pi j}{6} 值对应 j=5j = 5\ldots1010,其和为 12+0+12+32+1+32=1+3 \begin{aligned} &-\frac{1}{2} + 0 + \frac{1}{2} + \frac{\sqrt{3}}{2} \\ &\quad {}+ 1 + \frac{\sqrt{3}}{2} = 1 + \sqrt{3} \end{aligned}\text{。}

最大值为 8(2+23)=16+163=16+768 \begin{aligned} &8\left(2 + 2\sqrt{3}\right) \\ &= 16 + 16\sqrt{3} \\ &= 16 + \sqrt{768} \end{aligned}\text{,}所以 m+n=16+768=784m + n = 16 + 768 = 784

The zeroes are zj=8(cosπj6+isinπj6)z_j = 8\left(\cos\frac{\pi j}{6} + \mathrm{i}\sin\frac{\pi j}{6}\right) for j=1,j = 1, ,\ldots, 12,12, and Re(izj)=Im(zj).\operatorname{Re}(\mathrm{i}z_j) = -\operatorname{Im}(z_j). Since the choices are independent, the maximum real part of the sum is j8max(cosπj6,sinπj6).\sum_j 8\max\left(\cos\frac{\pi j}{6},\, -\sin\frac{\pi j}{6}\right).

Comparing the two values, sinπj6-\sin\frac{\pi j}{6} is larger exactly for j=5,j = 5, ,\ldots, 10.10. The cosines kept, for j=1,j = 1, 2,2, 3,3, 4,4, 11,11, and 12,12, sum to 32+12+012+32+1=1+3, \begin{aligned} &\frac{\sqrt{3}}{2} + \frac{1}{2} + 0 - \frac{1}{2} \\ &\quad {}+ \frac{\sqrt{3}}{2} + 1 = 1 + \sqrt{3}, \end{aligned} and the values sinπj6-\sin\frac{\pi j}{6} kept, for j=5,j = 5, ,\ldots, 10,10, sum to 12+0+12+32+1+32=1+3. \begin{aligned} &-\frac{1}{2} + 0 + \frac{1}{2} + \frac{\sqrt{3}}{2} \\ &\quad {}+ 1 + \frac{\sqrt{3}}{2} = 1 + \sqrt{3}. \end{aligned}

The maximum is 8(2+23)=16+163=16+768, \begin{aligned} &8\left(2 + 2\sqrt{3}\right) \\ &= 16 + 16\sqrt{3} \\ &= 16 + \sqrt{768}, \end{aligned} so m+n=16+768=784.m + n = 16 + 768 = 784.

9.

x1x_1x2x_2\ldotsx6x_6 为非负实数,满足 x1+x2+x3+x4+x5+x6=x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 11,且 x1x3x5+x2x4x61540x_1x_3x_5 + x_2x_4x_6 \ge \frac{1}{540}。设 ppqq 为互质正整数,使得 pq\frac{p}{q} 是下列表达式的最大可能值: x1x2x3+x2x3x4+x3x4x5+x4x5x6+x5x6x1+x6x1x2 \begin{aligned} &x_1x_2x_3 + x_2x_3x_4 \\ &\quad {}+ x_3x_4x_5 + x_4x_5x_6 \\ &\quad {}+ x_5x_6x_1 + x_6x_1x_2 \end{aligned}\text{。}p+qp + q

Let x1,x_1, x2,x_2, ,\ldots, x6x_6 be nonnegative real numbers such that x1+x2+x3+x4+x5+x6=x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 1,1, and x1x3x5+x2x4x61540.x_1x_3x_5 + x_2x_4x_6 \ge \frac{1}{540}. Let pp and qq be positive relatively prime integers such that pq\frac{p}{q} is the maximum possible value of x1x2x3+x2x3x4+x3x4x5+x4x5x6+x5x6x1+x6x1x2. \begin{aligned} &x_1x_2x_3 + x_2x_3x_4 \\ &\quad {}+ x_3x_4x_5 + x_4x_5x_6 \\ &\quad {}+ x_5x_6x_1 + x_6x_1x_2. \end{aligned} Find p+q.p + q.

答案:559
难度评级:3060
小提示:

这个循环和加上约束中的量 x1x3x5+x2x4x6x_1x_3x_5 + x_2x_4x_6 可以因式分解为 (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6)

The cyclic sum plus the constrained quantity x1x3x5+x2x4x6x_1x_3x_5 + x_2x_4x_6 factors as (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6)

大提示:

AM-GM 将这个乘积限制在 127\frac{1}{27} 以内,而且约束取等时这个上界可以达到。

AM-GM bounds that product by 127,\frac{1}{27}, and equality together with a tight constraint is achievable

解答:

r=x1x3x5+x2x4x6r = x_1x_3x_5 + x_2x_4x_6,并令 ss 为题目中的循环和。展开 (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6) 会得到八个三项乘积,正好是 ss 的六项加上 rr 的两项。因此 r+s=r + s = (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6),由 AM-GM 可知它至多为 (13)3=127\left(\frac{1}{3}\right)^3 = \frac{1}{27}

因此 s127r1271540=201540=19540 \begin{aligned} s &\le \frac{1}{27} - r \\ &\le \frac{1}{27} - \frac{1}{540} \\ &= \frac{20 - 1}{540} = \frac{19}{540} \end{aligned}\text{。}等号需要 x1+x4=x2+x5=x3+x6=x_1 + x_4 = x_2 + x_5 = x_3 + x_6 = 13\frac{1}{3},且 r=1540r = \frac{1}{540}:取 x1=x3=310x_1 = x_3 = \frac{3}{10}x5=160x_5 = \frac{1}{60}x2=1960x_2 = \frac{19}{60}x4=x6=130x_4 = x_6 = \frac{1}{30}。于是 r=96000+1954000=10054000=1540r = \frac{9}{6000} + \frac{19}{54000} = \frac{100}{54000} = \frac{1}{540},符合要求。

所以最大值为 19540\frac{19}{540}p+q=19+540=559p + q = 19 + 540 = 559

Let r=x1x3x5+x2x4x6r = x_1x_3x_5 + x_2x_4x_6 and let ss be the cyclic sum in question. Expanding (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6) produces eight triple products, which are exactly the six terms of ss together with the two terms of r.r. So r+s=r + s = (x1+x4)(x2+x5)(x3+x6),(x_1 + x_4)(x_2 + x_5)(x_3 + x_6), and by AM-GM this is at most (13)3=127.\left(\frac{1}{3}\right)^3 = \frac{1}{27}.

Therefore s127r1271540=201540=19540. \begin{aligned} s &\le \frac{1}{27} - r \\ &\le \frac{1}{27} - \frac{1}{540} \\ &= \frac{20 - 1}{540} = \frac{19}{540}. \end{aligned} Equality needs x1+x4=x2+x5=x3+x6=x_1 + x_4 = x_2 + x_5 = x_3 + x_6 = 13\frac{1}{3} with r=1540:r = \frac{1}{540}: take x1=x3=310,x_1 = x_3 = \frac{3}{10}, x5=160,x_5 = \frac{1}{60}, x2=1960,x_2 = \frac{19}{60}, x4=x6=130.x_4 = x_6 = \frac{1}{30}. Then r=96000+1954000=10054000=1540,r = \frac{9}{6000} + \frac{19}{54000} = \frac{100}{54000} = \frac{1}{540}, as required.

So the maximum is 19540,\frac{19}{540}, and p+q=19+540=559.p + q = 19 + 540 = 559.

10.

一个圆以 OO 为圆心,半径为 2525。长度为 3030 的弦 AB\overline{AB} 和长度为 1414 的弦 CD\overline{CD} 相交于点 PP。两条弦的中点之间的距离为 1212OP2OP^2 可以表示为 mn\frac{m}{n},其中 mmnn 是互质的正整数。求 m+nm + n 除以 10001000 的余数。

A circle with center OO has radius 25.25. Chord AB\overline{AB} of length 3030 and chord CD\overline{CD} of length 1414 intersect at point P.P. The distance between the midpoints of the two chords is 12.12. The quantity OP2OP^2 can be represented as mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find the remainder when m+nm + n is divided by 1000.1000.

答案:57
难度评级:2990
小提示:

MMNN 为两条弦的中点;则 OMABOM \perp ABONCDON \perp CD,且 OM=20OM = 20ON=24ON = 24

Let MM and NN be the chords’ midpoints; then OMAB,OM \perp AB, ONCD,ON \perp CD, and OM=20,OM = 20, ON=24ON = 24

大提示:

MMNN 处的直角使它们位于以 OPOP 为直径的圆上;在那里 MN=OPsinMONMN = OP \sin \angle MON,而 MON\angle MON 可由余弦定理求出。

The right angles at MM and NN put them on the circle with diameter OP;OP; there MN=OPsinMON,MN = OP \sin \angle MON, with MON\angle MON from the law of cosines

解答:

MMNN 分别为 AB\overline{AB}CD\overline{CD} 的中点。从圆心到弦中点的线段垂直于该弦,所以 OM=252152=20OM = \sqrt{25^2 - 15^2} = 20ON=25272=24ON = \sqrt{25^2 - 7^2} = 24,且 MN=12MN = 12

因为 PP 在两条弦上,OMP=ONP=90\angle OMP = \angle ONP = 90^\circ,所以 MMNN 在以 OPOP 为直径的圆上。在三角形 OMNOMN 中,余弦定理给出 cosMON=202+24212222024=832960=1315 \begin{aligned} \cos \angle MON &= \frac{20^2 + 24^2 - 12^2}{2 \cdot 20 \cdot 24} \\ &= \frac{832}{960} = \frac{13}{15} \end{aligned}\text{,}因此 sinMON=21415\sin \angle MON = \frac{2\sqrt{14}}{15}。在经过 OOMMPPNN 的圆中,扩展正弦定理说明弦 MNMN 等于直径 OPOP 乘以 sinMON\sin \angle MON,所以 OP=1221415=9014 \begin{aligned} OP &= \frac{12}{\frac{2\sqrt{14}}{15}} = \frac{90}{\sqrt{14}} \end{aligned}\text{,} OP2=810014=40507 \begin{aligned} OP^2 &= \frac{8100}{14} = \frac{4050}{7} \end{aligned}\text{。}

于是 m+n=4050+7=4057m + n = 4050 + 7 = 4057,除以 10001000 的余数为 5757

Let MM and NN be the midpoints of AB\overline{AB} and CD.\overline{CD}. The segment from the center to a chord’s midpoint is perpendicular to the chord, so OM=252152=20OM = \sqrt{25^2 - 15^2} = 20 and ON=25272=24,ON = \sqrt{25^2 - 7^2} = 24, with MN=12.MN = 12.

Since PP lies on both chords, OMP=ONP=90,\angle OMP = \angle ONP = 90^\circ, so MM and NN lie on the circle with diameter OP.OP. In triangle OMN,OMN, the law of cosines gives cosMON=202+24212222024=832960=1315, \begin{aligned} \cos \angle MON &= \frac{20^2 + 24^2 - 12^2}{2 \cdot 20 \cdot 24} \\ &= \frac{832}{960} = \frac{13}{15}, \end{aligned} so sinMON=21415.\sin \angle MON = \frac{2\sqrt{14}}{15}. In the circle through O,O, M,M, P,P, N,N, the extended law of sines says the chord MNMN equals the diameter OPOP times sinMON,\sin \angle MON, so OP=1221415=9014, \begin{aligned} OP &= \frac{12}{\frac{2\sqrt{14}}{15}} = \frac{90}{\sqrt{14}}, \end{aligned} OP2=810014=40507. \begin{aligned} OP^2 &= \frac{8100}{14} = \frac{4050}{7}. \end{aligned}

Then m+n=4050+7=4057,m + n = 4050 + 7 = 4057, which leaves remainder 5757 upon division by 1000.1000.

11.

MnM_n 为如下 n×nn \times n 矩阵:对于 1in1 \le i \le nmi,i=10m_{i,i} = 10;对于 1in11 \le i \le n - 1mi+1,i=mi,i+1=3m_{i+1,i} = m_{i,i+1} = 3MnM_n 中所有其他元素都是零。设 DnD_n 为矩阵 MnM_n 的行列式。那么 n=118Dn+1\sum_{n=1}^{\infty} \frac{1}{8D_n + 1} 可以表示为 pq\frac{p}{q},其中 ppqq 是互质的正整数。求 p+qp + q

注:1×11 \times 1 矩阵 [a][a] 的行列式为 aa,而 2×22 \times 2 矩阵 [abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix} 的行列式为 adbcad - bc;当 n2n \ge 2 时,若一个 n×nn \times n 矩阵的第一行或第一列为 a1a_1 a2a_2 a3a_3 \ldots ana_n,则其行列式等于 a1C1a2C2a_1C_1 - a_2C_2 +a3C3+ a_3C_3 - \cdots +(1)n+1anCn+ (-1)^{n+1}a_nC_n,其中 CiC_i 是删去包含 aia_i 的行和列后形成的 (n1)×(n1)(n - 1) \times (n - 1) 矩阵的行列式。

Let MnM_n be the n×nn \times n matrix with entries as follows: for 1in,1 \le i \le n, mi,i=10;m_{i,i} = 10; for 1in1,1 \le i \le n - 1, mi+1,i=mi,i+1=3;m_{i+1,i} = m_{i,i+1} = 3; all other entries in MnM_n are zero. Let DnD_n be the determinant of matrix Mn.M_n. Then n=118Dn+1\sum_{n=1}^{\infty} \frac{1}{8D_n + 1} can be represented as pq,\frac{p}{q}, where pp and qq are relatively prime positive integers. Find p+q.p + q.

Note: The determinant of the 1×11 \times 1 matrix [a][a] is a,a, and the determinant of the 2×22 \times 2 matrix [abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix} is adbc;ad - bc; for n2,n \ge 2, the determinant of an n×nn \times n matrix with first row or first column a1a_1 a2a_2 a3a_3 \ldots ana_n is equal to a1C1a2C2a_1C_1 - a_2C_2 +a3C3+ a_3C_3 - \cdots +(1)n+1anCn,+ (-1)^{n+1}a_nC_n, where CiC_i is the determinant of the (n1)×(n1)(n - 1) \times (n - 1) matrix formed by eliminating the row and column containing ai.a_i.

答案:73
难度评级:2920
小提示:

沿第一行作余子式展开,得到 Dn=10Dn19Dn2D_n = 10D_{n-1} - 9D_{n-2}

Cofactor expansion along the first row gives Dn=10Dn19Dn2D_n = 10D_{n-1} - 9D_{n-2}

大提示:

D1=10D_1 = 10D2=91D_2 = 91 解这个递推,得到 8Dn+1=9n+18D_n + 1 = 9^{n+1},所以该级数是等比级数。

Solving the recurrence with D1=10,D_1 = 10, D2=91D_2 = 91 gives 8Dn+1=9n+1,8D_n + 1 = 9^{n+1}, so the series is geometric

解答:

沿第一行展开 DnD_n,得到 10Dn110 D_{n-1} 减去 33 乘以一个余子式;该余子式的第一列为 (3,0,,0)(3, 0, \ldots, 0);再沿其第一列展开会留下 3Dn23 D_{n-2}。因此 Dn=10Dn19Dn2D_n = 10 D_{n-1} - 9 D_{n-2}\text{,}D1=10D_1 = 10D2=1009=91D_2 = 100 - 9 = 91

特征方程 k2=10k9k^2 = 10k - 9 的根为 9911,代入初值可得 Dn=9n+118D_n = \frac{9^{n+1} - 1}{8}。因此 8Dn+1=9n+18D_n + 1 = 9^{n+1},并且 n=118Dn+1=n=119n+1=181119=172 \begin{aligned} \sum_{n=1}^{\infty} \frac{1}{8D_n + 1} &= \sum_{n=1}^{\infty} \frac{1}{9^{n+1}} \\ &= \frac{\frac{1}{81}}{1 - \frac{1}{9}} = \frac{1}{72} \end{aligned}\text{。}

所以 pq=172\frac{p}{q} = \frac{1}{72},且 p+q=73p + q = 73

Expanding DnD_n along the first row gives 10Dn110 D_{n-1} minus 33 times a cofactor whose first column is (3,0,,0);(3, 0, \ldots, 0); expanding that cofactor down its first column leaves 3Dn2.3 D_{n-2}. Hence Dn=10Dn19Dn2,D_n = 10 D_{n-1} - 9 D_{n-2}, with D1=10D_1 = 10 and D2=1009=91.D_2 = 100 - 9 = 91.

The characteristic equation k2=10k9k^2 = 10k - 9 has roots 99 and 1,1, and fitting the initial values gives Dn=9n+118.D_n = \frac{9^{n+1} - 1}{8}. Therefore 8Dn+1=9n+1,8D_n + 1 = 9^{n+1}, and n=118Dn+1=n=119n+1=181119=172. \begin{aligned} \sum_{n=1}^{\infty} \frac{1}{8D_n + 1} &= \sum_{n=1}^{\infty} \frac{1}{9^{n+1}} \\ &= \frac{\frac{1}{81}}{1 - \frac{1}{9}} = \frac{1}{72}. \end{aligned}

Thus pq=172\frac{p}{q} = \frac{1}{72} and p+q=73.p + q = 73.

12.

九名代表围坐在一张可坐九人的圆桌旁,他们来自三个不同国家,每国三人,座位随机选择。设每名代表都至少挨着一名来自其他国家的代表的概率为 mn\frac{m}{n},其中 mmnn 是互质的正整数。求 m+nm + n

Nine delegates, three each from three different countries, randomly select chairs at a round table that seats nine people. Let the probability that each delegate sits next to at least one delegate from another country be mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

答案:97
难度评级:3060
小提示:

一名代表的两侧邻座都是同胞,当且仅当他所在国家的三名代表占据三个连续座位;计算补事件。

A delegate sits next to only compatriots exactly when his country’s three delegates occupy three consecutive chairs; count the complement

大提示:

只需考虑国家排列模式:9!3!3!3!=1680\frac{9!}{3!\,3!\,3!} = 1680 个模式等可能;对三个连续块事件使用容斥。

Only the country pattern matters: 9!3!3!3!=1680\frac{9!}{3!\,3!\,3!} = 1680 equally likely patterns; apply inclusion-exclusion to the three consecutive-block events

解答:

只需要考虑九个座位上的国家模式,所有 9!3!3!3!=1680\frac{9!}{3!\,3!\,3!} = 1680 个模式等可能。条件失败当且仅当某名代表的两个邻座都是同胞,也就是某个国家的三名代表占据三个连续座位。令 AiA_i 为国家 ii 的代表连续就坐的模式集合。

圆桌上有 99 组三个连续座位,所以 Ai=9(63)=180|A_i| = 9\binom{6}{3} = 180,这里是在剩余 66 个座位中选择哪 33 个给另一个国家。对于两个国家,放好第一个连续块后(99 种方式),剩余六个座位形成一段弧,其中包含 44 组三个连续座位,所以 AiAj=94=36|A_i \cap A_j| = 9 \cdot 4 = 36。对于三个国家,圆必须分成三个连续三座块(33 种方式),再按 3!3! 种顺序分配给三个国家:A1A2A3=18|A_1 \cap A_2 \cap A_3| = 18。由容斥,A1A2A3=3180336+18=450 \begin{aligned} |A_1 \cup A_2 \cup A_3| &= 3 \cdot 180 - 3 \cdot 36 \\ &\quad {}+ 18 = 450 \end{aligned}\text{。}

所求概率为 14501680=11556=41561 - \frac{450}{1680} = 1 - \frac{15}{56} = \frac{41}{56},所以 m+n=41+56=97m + n = 41 + 56 = 97

Only the pattern of countries in the nine chairs matters, and all 9!3!3!3!=1680\frac{9!}{3!\,3!\,3!} = 1680 patterns are equally likely. The condition fails for some delegate exactly when both of his neighbors are compatriots, which happens exactly when some country’s three delegates occupy three consecutive chairs. Let AiA_i be the set of patterns in which country ii’s delegates are consecutive.

There are 99 triples of consecutive chairs, so Ai=9(63)=180,|A_i| = 9\binom{6}{3} = 180, choosing which 33 of the remaining 66 chairs go to one of the other countries. For two countries, after placing the first block (99 ways) the remaining six chairs form an arc containing 44 triples of consecutive chairs, so AiAj=94=36.|A_i \cap A_j| = 9 \cdot 4 = 36. For all three, the circle must split into three consecutive triples (33 ways) assigned to the countries in 3!3! orders: A1A2A3=18.|A_1 \cap A_2 \cap A_3| = 18. By inclusion-exclusion, A1A2A3=3180336+18=450. \begin{aligned} |A_1 \cup A_2 \cup A_3| &= 3 \cdot 180 - 3 \cdot 36 \\ &\quad {}+ 18 = 450. \end{aligned}

The probability is 14501680=11556=4156,1 - \frac{450}{1680} = 1 - \frac{15}{56} = \frac{41}{56}, so m+n=41+56=97.m + n = 41 + 56 = 97.

13.

PP 在正方形 ABCDABCD 的对角线 ACAC 上,且 AP>CPAP \gt CP。令 O1O_1O2O_2 分别为三角形 ABPABPCDPCDP 的外心。已知 AB=12AB = 12O1PO2=120\angle O_1PO_2 = 120^\circ,则 AP=a+bAP = \sqrt{a} + \sqrt{b},其中 aabb 是正整数。求 a+ba + b

Point PP lies on the diagonal ACAC of square ABCDABCD with AP>CP.AP \gt CP. Let O1O_1 and O2O_2 be the circumcenters of triangles ABPABP and CDP,CDP, respectively. Given that AB=12AB = 12 and O1PO2=120,\angle O_1PO_2 = 120^\circ, then AP=a+b,AP = \sqrt{a} + \sqrt{b}, where aa and bb are positive integers. Find a+b.a + b.

答案:96
难度评级:3160
小提示:

使用坐标:两个外心都在竖直直线 x=6x = 6 上;若 P=(p,p)P = (p, p),它们分别为 (6,p6)(6,\, p - 6)(6,p+6)(6,\, p + 6)

Use coordinates: both circumcenters lie on the vertical line x=6,x = 6, and with P=(p,p)P = (p, p) they work out to (6,p6)(6,\, p - 6) and (6,p+6)(6,\, p + 6)

大提示:

对从 PP 指向两个外心的向量应用余弦公式,并求解 (p6)2=12(p - 6)^2 = 12

Apply the cosine formula to the vectors from PP to the two centers and solve (p6)2=12(p - 6)^2 = 12

解答:

A=(0,0)A = (0, 0)B=(12,0)B = (12, 0)C=(12,12)C = (12, 12)D=(0,12)D = (0, 12),并令 P=(p,p)P = (p, p),其中 p>6p \gt 6。因为 O1O_1AABB 距离相等,它在 x=6x = 6 上;设 O1=(6,k)O_1 = (6, k),令 O1A2=O1P2O_1A^2 = O_1P^2,得到 k=p6k = p - 6,所以 O1=(6,p6)O_1 = (6,\, p - 6)。同理,到 CCDD 等距的 O2O_2O2=(6,p+6)O_2 = (6,\, p + 6)

PP 指向两个圆心的向量为 (6p,6)(6 - p,\, -6)(6p,6)(6 - p,\, 6),所以 cos120=(6p)236(6p)2+36=12 \begin{aligned} \cos 120^\circ &= \frac{(6 - p)^2 - 36}{(6 - p)^2 + 36} \\ &= -\frac{1}{2} \end{aligned}\text{,}由此 3(p6)2=363(p - 6)^2 = 36,所以 (p6)2=12(p - 6)^2 = 12,且 p=6+23p = 6 + 2\sqrt{3}

因而 AP=p2=62+26=AP = p\sqrt{2} = 6\sqrt{2} + 2\sqrt{6} = 72+24\sqrt{72} + \sqrt{24},所以 a+b=72+24=96a + b = 72 + 24 = 96

Place A=(0,0),A = (0, 0), B=(12,0),B = (12, 0), C=(12,12),C = (12, 12), D=(0,12),D = (0, 12), and P=(p,p)P = (p, p) with p>6.p \gt 6. Since O1O_1 is equidistant from AA and B,B, it lies on x=6;x = 6; setting O1=(6,k)O_1 = (6, k) and equating O1A2=O1P2O_1A^2 = O_1P^2 gives k=p6,k = p - 6, so O1=(6,p6).O_1 = (6,\, p - 6). Similarly O2,O_2, equidistant from CC and D,D, is O2=(6,p+6).O_2 = (6,\, p + 6).

The vectors from PP to the centers are (6p,6)(6 - p,\, -6) and (6p,6),(6 - p,\, 6), so cos120=(6p)236(6p)2+36=12, \begin{aligned} \cos 120^\circ &= \frac{(6 - p)^2 - 36}{(6 - p)^2 + 36} \\ &= -\frac{1}{2}, \end{aligned} which gives 3(p6)2=36,3(p - 6)^2 = 36, so (p6)2=12(p - 6)^2 = 12 and p=6+23.p = 6 + 2\sqrt{3}.

Then AP=p2=62+26=AP = p\sqrt{2} = 6\sqrt{2} + 2\sqrt{6} = 72+24,\sqrt{72} + \sqrt{24}, so a+b=72+24=96.a + b = 72 + 24 = 96.

14.

集合 1122\ldots3030 的排列中,有 NN 个排列 (a1,a2,,a30)(a_1, a_2, \ldots, a_{30}) 满足如下条件:对于 m{2,3,5}m \in \{2, 3, 5\} 以及所有满足 1n<n+m301 \le n \lt n + m \le 30 的整数 nnmm 都整除 an+mana_{n+m} - a_n。求 NN 除以 10001000 的余数。

There are NN permutations (a1,a2,,a30)(a_1, a_2, \ldots, a_{30}) of 1,1, 2,2, ,\ldots, 3030 such that for m{2,3,5},m \in \{2, 3, 5\}, mm divides an+mana_{n+m} - a_n for all integers nn with 1n<n+m30.1 \le n \lt n + m \le 30. Find the remainder when NN is divided by 1000.1000.

答案:440
难度评级:3270
小提示:

条件说明,对 m=2m = 23355 中的每一个值,anmodma_n \bmod m 只取决于 nmodmn \bmod m

The conditions say that anmodma_n \bmod m depends only on nmodm,n \bmod m, for each of m=2,m = 2, 3,3, and 55

大提示:

由中国剩余定理,位置和值都对应于模 223355 的余数三元组;一个有效排列正好是对每个模数各选择一个余数排列。

By CRT, positions and values both correspond to triples of residues mod 2,2, 3,3, 5;5; a valid permutation is exactly a choice of one residue permutation for each modulus

解答:

对每个 m{2,3,5}m \in \{2, 3, 5\},条件 an+man(modm)a_{n+m} \equiv a_n \pmod{m} 表示 ana_nmm 的余数只取决于 nmodmn \bmod m,从而定义了一个从位置余数到数值余数的映射 σm\sigma_m。每个位置余数类有 30m\frac{30}{m} 个位置,每个数值余数类也有 30m\frac{30}{m} 个数值;若 σm\sigma_m 把两个位置类映到同一个数值类,那么这个数值类就必须填入 60m\frac{60}{m} 个位置,这是不可能的。所以每个 σm\sigma_m 都是模 mm 余数的一个排列。

反过来,由中国剩余定理,每个位置 n{1,,30}n \in \{1, \ldots, 30\} 都对应唯一的三元组 (nmod2,nmod3,nmod5)(n \bmod 2,\, n \bmod 3,\, n \bmod 5),数值也同理。因此任意选择 (σ2,σ3,σ5)(\sigma_2, \sigma_3, \sigma_5) 都会确定一个 1,,301, \ldots, 30 的唯一有效排列,它把位置三元组送到指定的数值三元组。

所以 N=2!3!5!=1440N = 2! \cdot 3! \cdot 5! = 1440,除以 10001000 的余数为 440440

For each m{2,3,5},m \in \{2, 3, 5\}, the condition an+man(modm)a_{n+m} \equiv a_n \pmod{m} means the residue of ana_n modulo mm depends only on nmodm,n \bmod m, defining a map σm\sigma_m from residues to residues. Each residue class of positions has 30m\frac{30}{m} members, and so does each residue class of values; if σm\sigma_m sent two position classes to the same value class, that class’s 30m\frac{30}{m} values would have to fill 60m\frac{60}{m} positions, which is impossible. So each σm\sigma_m is a permutation of the residues modulo m.m.

Conversely, by the Chinese remainder theorem each position n{1,,30}n \in \{1, \ldots, 30\} corresponds to a unique triple (nmod2,nmod3,nmod5),(n \bmod 2,\, n \bmod 3,\, n \bmod 5), and likewise for values. Any choice of permutations (σ2,σ3,σ5)(\sigma_2, \sigma_3, \sigma_5) therefore determines a unique valid permutation of 1,,30,1, \ldots, 30, sending the position triple to the prescribed value triple.

Hence N=2!3!5!=1440,N = 2! \cdot 3! \cdot 5! = 1440, and the remainder upon division by 10001000 is 440.440.

15.

P(x)=x23x9P(x) = x^2 - 3x - 9。从区间 5x155 \le x \le 15 中随机选择一个实数 xx。等式 P(x)=P(x)\left\lfloor \sqrt{P(x)} \right\rfloor = \sqrt{P(\lfloor x \rfloor)} 成立的概率为 a+b+cde\frac{\sqrt{a} + \sqrt{b} + \sqrt{c} - d}{e},其中 aabbccddee 是正整数。求 a+b+c+d+ea + b + c + d + e

Let P(x)=x23x9.P(x) = x^2 - 3x - 9. A real number xx is chosen at random from the interval 5x15.5 \le x \le 15. The probability that P(x)=P(x)\left\lfloor \sqrt{P(x)} \right\rfloor = \sqrt{P(\lfloor x \rfloor)} is equal to a+b+cde,\frac{\sqrt{a} + \sqrt{b} + \sqrt{c} - d}{e}, where a,a, b,b, c,c, d,d, and ee are positive integers. Find a+b+c+d+e.a + b + c + d + e.

答案:850
难度评级:3370
小提示:

x[n,n+1)x \in [n, n+1),右边是 P(n)\sqrt{P(n)},它必须是整数:找出使 P(n)P(n) 为完全平方数的 nn

For x[n,n+1)x \in [n, n+1) the right side is P(n),\sqrt{P(n)}, which must be an integer: find the nn with P(n)P(n) a perfect square

大提示:

只有 n=5n = 5661313 可行;在每个这样的区间上,解 P(x)<(P(n)+1)2P(x) \lt \left(\sqrt{P(n)} + 1\right)^2 得到有效子区间。

Only n=5,n = 5, 6,6, and 1313 work; on each such interval solve P(x)<(P(n)+1)2P(x) \lt \left(\sqrt{P(n)} + 1\right)^2 for the valid subinterval

解答:

x[n,n+1)x \in [n, n + 1),右边为 P(n)\sqrt{P(n)},必须是整数,所以 P(n)=n23n9P(n) = n^2 - 3n - 9 必须是完全平方数。当 n=5n = 566\ldots1414 时,这些值依次为 1199191931314545616179799999121121145145:其中只有 n=5n = 5661313 给出平方数,对应 P(n)=1\sqrt{P(n)} = 1331111

PP[5,15][5, 15] 上递增,所以对 x[n,n+1)x \in [n, n + 1),自动有 P(x)P(n)\sqrt{P(x)} \ge \sqrt{P(n)},而 P(x)=P(n)=m\left\lfloor \sqrt{P(x)} \right\rfloor = \sqrt{P(n)} = m 当且仅当 P(x)<(m+1)2P(x) \lt (m + 1)^2,即 x<3+45+4(m+1)22x \lt \frac{3 + \sqrt{45 + 4(m+1)^2}}{2}。当 m=1m = 1331111 时,分界点分别为 3+612\frac{3 + \sqrt{61}}{2}3+1092\frac{3 + \sqrt{109}}{2}3+6212\frac{3 + \sqrt{621}}{2},它们都落在对应的单位区间内,所以成功子区间长度分别为 6172\frac{\sqrt{61} - 7}{2}10992\frac{\sqrt{109} - 9}{2}621232\frac{\sqrt{621} - 23}{2}

区间 [5,15][5, 15] 的长度为 1010,所以概率为 11061+109+621392=61+109+6213920 \begin{aligned} &\frac{1}{10} \\ &\quad {}\cdot \frac{\sqrt{61} + \sqrt{109} + \sqrt{621} - 39}{2} \\ &= \frac{\sqrt{61} + \sqrt{109} + \sqrt{621} - 39}{20} \end{aligned}\text{,}因而 a+b+c+d+e=a + b + c + d + e = 61+109+621+39+20=61 + 109 + 621 + 39 + 20 = 850850

For x[n,n+1)x \in [n, n + 1) the right-hand side is P(n),\sqrt{P(n)}, which must be an integer, so P(n)=n23n9P(n) = n^2 - 3n - 9 must be a perfect square. For n=5,n = 5, 6,6, ,\ldots, 1414 the values are 1,1, 9,9, 19,19, 31,31, 45,45, 61,61, 79,79, 99,99, 121,121, 145:145: only n=5,n = 5, 6,6, and 1313 give squares, with P(n)=1,\sqrt{P(n)} = 1, 3,3, and 11,11, respectively.

PP is increasing on [5,15],[5, 15], so for x[n,n+1)x \in [n, n + 1) we automatically have P(x)P(n),\sqrt{P(x)} \ge \sqrt{P(n)}, and P(x)=P(n)=m\left\lfloor \sqrt{P(x)} \right\rfloor = \sqrt{P(n)} = m holds exactly when P(x)<(m+1)2,P(x) \lt (m + 1)^2, i.e. x<3+45+4(m+1)22.x \lt \frac{3 + \sqrt{45 + 4(m+1)^2}}{2}. For m=1,m = 1, 3,3, and 1111 the cutoffs are 3+612,\frac{3 + \sqrt{61}}{2}, 3+1092,\frac{3 + \sqrt{109}}{2}, 3+6212,\frac{3 + \sqrt{621}}{2}, each lying inside the corresponding unit interval, so the successful subintervals have lengths 6172,\frac{\sqrt{61} - 7}{2}, 10992,\frac{\sqrt{109} - 9}{2}, 621232.\frac{\sqrt{621} - 23}{2}.

The interval [5,15][5, 15] has length 10,10, so the probability is 11061+109+621392=61+109+6213920, \begin{aligned} &\frac{1}{10} \\ &\quad {}\cdot \frac{\sqrt{61} + \sqrt{109} + \sqrt{621} - 39}{2} \\ &= \frac{\sqrt{61} + \sqrt{109} + \sqrt{621} - 39}{20}, \end{aligned} giving a+b+c+d+e=a + b + c + d + e = 61+109+621+39+20=61 + 109 + 621 + 39 + 20 = 850.850.