2016 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.

起初 Alex、Betty 和 Charlie 一共有 444444 颗花生。Charlie 的花生最多,Alex 的花生最少。三人各自拥有的花生数成等比数列。Alex 吃掉了 55 颗,Betty 吃掉了 99 颗,Charlie 吃掉了 2525 颗。现在三人各自剩下的花生数成等差数列。求 Alex 起初有多少颗花生。

Initially Alex, Betty, and Charlie had a total of 444444 peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had form a geometric progression. Alex eats 55 of his peanuts, Betty eats 99 of her peanuts, and Charlie eats 2525 of his peanuts. Now the three numbers of peanuts that each person has form an arithmetic progression. Find the number of peanuts Alex had initially.

答案:108
知识点:等比数列等差数列方程组
难度评级:2050
小提示:

三人都吃完后还剩 405405 颗花生,且成等差数列,所以中间那个人的数量是 135135

After everyone eats, 405405 peanuts remain in arithmetic progression, so the middle amount is 135135

大提示:

Betty 起初有 144144 颗。把三人起初的花生数写成 144r\frac{144}{r}144144144r144r,再利用总数 444444

Betty began with 144.144. Write the starting amounts as 144r,\frac{144}{r}, 144,144, 144r144r and use the total 444.444.

解答:

吃掉花生后,还剩 4445925=405444 - 5 - 9 - 25 = 405 颗,并且三个数量成等差数列,所以中间项,也就是 Betty 的数量,是 4053=135\frac{405}{3} = 135。因此 Betty 起初有 135+9=144135 + 9 = 144 颗花生。

起始数量成等比数列,所以可写成 144r\frac{144}{r}144144144r144r,其中 r>1r \gt 1(因为 Charlie 最多而 Alex 最少)。于是 144r+144+144r=444\frac{144}{r} + 144 + 144r = 444\text{,}化简得 12r225r+12=012r^2 - 25r + 12 = 0,根为 r=43r = \frac{4}{3}r=34r = \frac{3}{4}。因为 r>1r \gt 1,取 r=43r = \frac{4}{3}

所以 Alex 起初有 14434=108144 \cdot \frac{3}{4} = 108 颗花生。(检验:吃完后数量为 103103135135167167,公差为 3232。)

After the eating, 4445925=405444 - 5 - 9 - 25 = 405 peanuts remain, and the three amounts form an arithmetic progression, so the middle amount, Betty’s, is 4053=135.\frac{405}{3} = 135. Hence Betty started with 135+9=144135 + 9 = 144 peanuts.

The starting amounts form a geometric progression, so they are 144r,\frac{144}{r}, 144,144, and 144r144r with r>1r \gt 1 (Charlie had the most and Alex the least). Then 144r+144+144r=444,\frac{144}{r} + 144 + 144r = 444, which simplifies to 12r225r+12=0,12r^2 - 25r + 12 = 0, with roots r=43r = \frac{4}{3} and r=34;r = \frac{3}{4}; since r>1,r \gt 1, we take r=43.r = \frac{4}{3}.

So Alex initially had 14434=108144 \cdot \frac{3}{4} = 108 peanuts. (Check: after eating, the amounts 103,103, 135,135, 167167 increase by 3232 each.)

2.

星期六下雨的概率是 40%40\%,星期天下雨的概率是 30%30\%。不过,如果星期六下雨,星期天下雨的可能性是星期六不下雨时的两倍。这个周末至少有一天会下雨的概率是 ab\frac{a}{b},其中 aabb 是互质的正整数。求 a+ba + b

There is a 40%40\% chance of rain on Saturday and a 30%30\% chance of rain on Sunday. However, it is twice as likely to rain on Sunday if it rains on Saturday than if it does not rain on Saturday. The probability that it rains at least one day this weekend is ab,\frac{a}{b}, where aa and bb are relatively prime positive integers. Find a+b.a + b.

答案:107
难度评级:2070
小提示:

设星期六不下雨时星期天下雨的概率为 pp;那么星期六下雨时这个概率为 2p2p。使用星期天下雨的总概率 30%30\%

Let pp be the chance of Sunday rain when Saturday is dry; then it is 2p2p when Saturday is rainy. Use the overall 30%.30\%.

大提示:

求出 pp 后,整个周末都不下雨的概率是 0.6(1p)0.6(1 - p)

Once pp is known, the chance of a completely dry weekend is 0.6(1p)0.6(1 - p)

解答:

设星期六不下雨时星期天下雨的概率为 pp;星期六下雨时,这个概率为 2p2p。由星期天下雨的总概率得 0.4(2p)+0.6p=0.30.4(2p) + 0.6p = 0.3\text{,}所以 1.4p=0.31.4p = 0.3,从而 p=314p = \frac{3}{14}

周末完全不下雨,恰好是星期六不下雨且随后星期天也不下雨,其概率为 35(1314)=351114=3370\frac{3}{5}\left(1 - \frac{3}{14}\right) = \frac{3}{5} \cdot \frac{11}{14} = \frac{33}{70}。因此至少一天下雨的概率是 13370=37701 - \frac{33}{70} = \frac{37}{70},已经是最简分数,所以 a+b=37+70=107a + b = 37 + 70 = 107

Let pp be the probability that it rains on Sunday given a dry Saturday; given a rainy Saturday it is 2p.2p. The overall Sunday chance gives 0.4(2p)+0.6p=0.3,0.4(2p) + 0.6p = 0.3, so 1.4p=0.31.4p = 0.3 and p=314.p = \frac{3}{14}.

The weekend is completely dry exactly when Saturday is dry and then Sunday is dry: 35(1314)=351114=3370.\frac{3}{5}\left(1 - \frac{3}{14}\right) = \frac{3}{5} \cdot \frac{11}{14} = \frac{33}{70}. So the probability of rain on at least one day is 13370=3770,1 - \frac{33}{70} = \frac{37}{70}, which is in lowest terms, and a+b=37+70=107.a + b = 37 + 70 = 107.

3.

设实数 xxyyzz 满足方程组 log2(xyz3+log5x)=5\log_2(xyz - 3 + \log_5 x) = 5 log3(xyz3+log5y)=4\log_3(xyz - 3 + \log_5 y) = 4 log4(xyz3+log5z)=4\log_4(xyz - 3 + \log_5 z) = 4\text{。}log5x+log5y+log5z|\log_5 x| + |\log_5 y| + |\log_5 z| 的值。

Let x,x, y,y, and zz be real numbers satisfying the system log2(xyz3+log5x)=5\log_2(xyz - 3 + \log_5 x) = 5 log3(xyz3+log5y)=4\log_3(xyz - 3 + \log_5 y) = 4 log4(xyz3+log5z)=4.\log_4(xyz - 3 + \log_5 z) = 4. Find the value of log5x+log5y+log5z.|\log_5 x| + |\log_5 y| + |\log_5 z|.

答案:265
难度评级:2300
小提示:

先去掉每个外层对数:方程变为 xyz+log5x=35xyz + \log_5 x = 35xyz+log5y=84xyz + \log_5 y = 84xyz+log5z=259xyz + \log_5 z = 259

Undo each outer logarithm: the equations become xyz+log5x=35,xyz + \log_5 x = 35, xyz+log5y=84,xyz + \log_5 y = 84, xyz+log5z=259xyz + \log_5 z = 259

大提示:

x=5ax = 5^a,其余两个变量也作类似表示,再把三个方程相加:35a+b+c+(a+b+c)=3783 \cdot 5^{a+b+c} + (a + b + c) = 378 只有一个解

Set x=5a,x = 5^a, etc., and add all three equations: 35a+b+c+(a+b+c)=3783 \cdot 5^{a+b+c} + (a + b + c) = 378 has exactly one solution

解答:

对每个方程取指数得 xyz3+log5x=25xyz - 3 + \log_5 x = 2^5,另外两个方程同理,所以 xyz+log5x=35xyz + \log_5 x = 35\text{,}xyz+log5y=84xyz + \log_5 y = 84\text{,}xyz+log5z=259xyz + \log_5 z = 259\text{。}x=5ax = 5^ay=5by = 5^bz=5cz = 5^c,则 xyz=5a+b+cxyz = 5^{a+b+c}

三个方程相加得 35s+s=3783 \cdot 5^s + s = 378,其中 s=a+b+cs = a + b + c。左边是关于 ss 的严格递增函数,且 s=3s = 3 可行,因为 375+3=378375 + 3 = 378,所以 s=3s = 3,并且 5s=1255^s = 125

于是 a=35125=90a = 35 - 125 = -90b=84125=41b = 84 - 125 = -41c=259125=134c = 259 - 125 = 134,所以 a+b+c|a| + |b| + |c| =90+41+134= 90 + 41 + 134 =265= 265

Exponentiating each equation gives xyz3+log5x=25xyz - 3 + \log_5 x = 2^5 and similarly for the others, so xyz+log5x=35,xyz + \log_5 x = 35, xyz+log5y=84,xyz + \log_5 y = 84, xyz+log5z=259.xyz + \log_5 z = 259. Write x=5a,x = 5^a, y=5b,y = 5^b, z=5c,z = 5^c, so that xyz=5a+b+c.xyz = 5^{a+b+c}.

Adding the three equations gives 35s+s=378,3 \cdot 5^s + s = 378, where s=a+b+c.s = a + b + c. The left side is strictly increasing in s,s, and s=3s = 3 works since 375+3=378,375 + 3 = 378, so s=3s = 3 and 5s=125.5^s = 125.

Then a=35125=90,a = 35 - 125 = -90, b=84125=41,b = 84 - 125 = -41, and c=259125=134,c = 259 - 125 = 134, so a+b+c|a| + |b| + |c| =90+41+134= 90 + 41 + 134 =265.= 265.

4.

一个 a×b×ca \times b \times c 的长方体由 abca \cdot b \cdot c 个单位立方体组成。每个单位立方体被涂成红色、绿色或黄色。平行于长方体 (b×c)(b \times c) 面的 1×b×c1 \times b \times c 层共有 aa 层,每层恰有 99 个红色立方体、1212 个绿色立方体和若干黄色立方体。平行于 (a×c)(a \times c) 面的 a×1×ca \times 1 \times c 层共有 bb 层,每层恰有 2020 个绿色立方体、2525 个黄色立方体和若干红色立方体。求这个长方体可能的最小体积。

An a×b×ca \times b \times c rectangular box is built from abca \cdot b \cdot c unit cubes. Each unit cube is colored red, green, or yellow. Each of the aa layers of size 1×b×c1 \times b \times c parallel to the (b×c)(b \times c)-faces of the box contains exactly 99 red cubes, exactly 1212 green cubes, and some yellow cubes. Each of the bb layers of size a×1×ca \times 1 \times c parallel to the (a×c)(a \times c)-faces of the box contains exactly 2020 green cubes, exactly 2525 yellow cubes, and some red cubes. Find the smallest possible volume of the box.

答案:180
难度评级:2450
小提示:

用两个层方向分别统计整个长方体中每种颜色的数量;例如绿色给出 12a=20b12a = 20b

Count each color over the whole box using both layer directions; for instance green gives 12a=20b12a = 20b

大提示:

计数会推出 bc=36bc = 36ac=60ac = 60,所以体积是 2160c\frac{2160}{c},其中 cc 同时整除 36366060

The counts force bc=36bc = 36 and ac=60,ac = 60, so the volume is 2160c\frac{2160}{c} with cc dividing both 3636 and 6060

解答:

每个 1×b×c1 \times b \times c 层恰有 99 个红色和 1212 个绿色立方体,因此恰有 bc21bc - 21 个黄色立方体;每个 a×1×ca \times 1 \times c 层恰有 2020 个绿色和 2525 个黄色立方体,因此恰有 ac45ac - 45 个红色立方体。用两种方式统计整个长方体中的绿色立方体,得 12a=20b12a = 20b,所以 3a=5b3a = 5b。统计黄色立方体得 a(bc21)=25b=15aa(bc - 21) = 25b = 15a,所以 bc=36bc = 36。统计红色立方体得 b(ac45)=9ab(ac - 45) = 9a,且 9ab=15\frac{9a}{b} = 15,所以 ac=60ac = 60

因此 a=60ca = \frac{60}{c}b=36cb = \frac{36}{c} 是正整数,所以 cc 整除 gcd(60,36)=12\gcd(60, 36) = 12。体积为 abc=6036c=2160cabc = \frac{60 \cdot 36}{c} = \frac{2160}{c},当 c=12c = 12 时最小。此时体积为 180180,且 (a,b,c)=(5,3,12)(a, b, c) = (5, 3, 12)

这可以实现:把每个 1×3×121 \times 3 \times 12 层涂成三行相同的 RRRGGGGYYYYY。于是每个 1×3×121 \times 3 \times 12 层有 99 个红色、1212 个绿色和 1515 个黄色立方体;每个 5×1×125 \times 1 \times 12 层有 1515 个红色、2020 个绿色和 2525 个黄色立方体。所以最小可能体积是 180180

Each 1×b×c1 \times b \times c layer has exactly 99 red and 1212 green cubes, hence exactly bc21bc - 21 yellow; each a×1×ca \times 1 \times c layer has exactly 2020 green and 2525 yellow, hence exactly ac45ac - 45 red. Counting green cubes in the whole box both ways gives 12a=20b,12a = 20b, so 3a=5b.3a = 5b. Counting yellow both ways gives a(bc21)=25b=15a,a(bc - 21) = 25b = 15a, so bc=36.bc = 36. Counting red both ways gives b(ac45)=9a,b(ac - 45) = 9a, and 9ab=15,\frac{9a}{b} = 15, so ac=60.ac = 60.

Thus a=60ca = \frac{60}{c} and b=36cb = \frac{36}{c} are positive integers, so cc divides gcd(60,36)=12,\gcd(60, 36) = 12, and the volume is abc=6036c=2160c,abc = \frac{60 \cdot 36}{c} = \frac{2160}{c}, smallest when c=12:c = 12: volume 180180 with (a,b,c)=(5,3,12).(a, b, c) = (5, 3, 12).

This is achievable: color every 1×3×121 \times 3 \times 12 layer with three identical rows RRRGGGGYYYYY. Then each 1×3×121 \times 3 \times 12 layer has 99 red, 1212 green, and 1515 yellow cubes, and each 5×1×125 \times 1 \times 12 layer has 1515 red, 2020 green, and 2525 yellow cubes. So the smallest possible volume is 180.180.

5.

三角形 ABC0ABC_0C0C_0 处为直角。它的三条边长是两两互质的正整数,周长为 pp。令 C1C_1 为到 AB\overline{AB} 的高的垂足;对 n2n \ge 2,令 CnC_nCn2Cn1B\triangle C_{n-2}C_{n-1}B 中到 Cn2B\overline{C_{n-2}B} 的高的垂足。已知 n=1Cn1Cn=6p\sum_{n=1}^{\infty} C_{n-1}C_n = 6p。求 pp

Triangle ABC0ABC_0 has a right angle at C0.C_0. Its side lengths are pairwise relatively prime positive integers, and its perimeter is p.p. Let C1C_1 be the foot of the altitude to AB,\overline{AB}, and for n2,n \ge 2, let CnC_n be the foot of the altitude to Cn2B\overline{C_{n-2}B} in Cn2Cn1B.\triangle C_{n-2}C_{n-1}B. The sum n=1Cn1Cn=6p.\sum_{n=1}^{\infty} C_{n-1}C_n = 6p. Find p.p.

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

每条新高都会产生一个与前一个三角形相似的三角形,所以长度 Cn1CnC_{n-1}C_n 构成等比数列

Each new altitude creates a triangle similar to the one before, so the lengths Cn1CnC_{n-1}C_n form a geometric series

大提示:

设直角边 a=BC0a = BC_0b=AC0b = AC_0,斜边为 cc,这个级数和为 abca\frac{ab}{c - a}。分解 b2=(ca)(c+a)b^2 = (c - a)(c + a) 来化简。

With legs a=BC0,a = BC_0, b=AC0,b = AC_0, hypotenuse c,c, the series sums to abca.\frac{ab}{c - a}. Factor b2=(ca)(c+a)b^2 = (c - a)(c + a) to simplify.

解答:

a=BC0a = BC_0b=AC0b = AC_0c=ABc = AB。第一条高给出 C0C1=abcC_0C_1 = \frac{ab}{c},并且 C0C1BAC0B\triangle C_0C_1B \sim \triangle AC_0B,相似比为 ac\frac{a}{c}。之后每条高都在缩小为原来 ac\frac{a}{c} 的三角形中重复同样构造,所以线段 Cn1CnC_{n-1}C_n 构成等比数列,并且 n=1Cn1Cn=abc1ac=abca=6p=6(a+b+c) \begin{aligned} &\sum_{n=1}^{\infty} C_{n-1}C_n \\ &= \frac{\frac{ab}{c}}{1 - \frac{a}{c}} \\ &= \frac{ab}{c - a} \\ &= 6p = 6(a + b + c) \end{aligned}\text{。}

因为 b2=c2a2=(ca)(c+a)b^2 = c^2 - a^2 = (c - a)(c + a),所以 (ca)(a+b+c)=(ca)(c+a)+(ca)b=b(b+ca) \begin{aligned} &(c - a) \\ &\quad {}\cdot (a + b + c) \\ &= (c - a)(c + a) \\ &\quad {}+ (c - a)b \\ &= b(b + c - a) \end{aligned}\text{,}从而 ab=6b(b+ca)ab = 6b(b + c - a),也就是 7a=6b+6c7a = 6b + 6c。把 6c=7a6b6c = 7a - 6b 平方,并使用 36c2=36a2+36b236c^2 = 36a^2 + 36b^2,得 36a2=49a284ab36a^2 = 49a^2 - 84ab,因此 13a=84b13a = 84b

由于边长两两互质,a=84a = 84b=13b = 13,所以 c=7846136=85c = \frac{7 \cdot 84 - 6 \cdot 13}{6} = 85,并且确实有 132+842=85213^2 + 84^2 = 85^2。于是 p=84+13+85=182p = 84 + 13 + 85 = 182 (且 abca=84131=1092=6p\frac{ab}{c - a} = \frac{84 \cdot 13}{1} = 1092 = 6p,检验成立)。

Let a=BC0,a = BC_0, b=AC0,b = AC_0, and c=AB.c = AB. The altitude gives C0C1=abc,C_0C_1 = \frac{ab}{c}, and C0C1BAC0B\triangle C_0C_1B \sim \triangle AC_0B with ratio ac.\frac{a}{c}. Each later altitude repeats this construction in a triangle scaled by ac,\frac{a}{c}, so the segments Cn1CnC_{n-1}C_n form a geometric series and n=1Cn1Cn=abc1ac=abca=6p=6(a+b+c). \begin{aligned} &\sum_{n=1}^{\infty} C_{n-1}C_n \\ &= \frac{\frac{ab}{c}}{1 - \frac{a}{c}} \\ &= \frac{ab}{c - a} \\ &= 6p = 6(a + b + c). \end{aligned}

Since b2=c2a2=(ca)(c+a),b^2 = c^2 - a^2 = (c - a)(c + a), we get (ca)(a+b+c)=(ca)(c+a)+(ca)b=b(b+ca), \begin{aligned} &(c - a) \\ &\quad {}\cdot (a + b + c) \\ &= (c - a)(c + a) \\ &\quad {}+ (c - a)b \\ &= b(b + c - a), \end{aligned} so ab=6b(b+ca),ab = 6b(b + c - a), that is 7a=6b+6c.7a = 6b + 6c. Squaring 6c=7a6b6c = 7a - 6b and using 36c2=36a2+36b236c^2 = 36a^2 + 36b^2 gives 36a2=49a284ab,36a^2 = 49a^2 - 84ab, hence 13a=84b.13a = 84b.

Because the side lengths are pairwise relatively prime, a=84a = 84 and b=13,b = 13, so c=7846136=85,c = \frac{7 \cdot 84 - 6 \cdot 13}{6} = 85, and indeed 132+842=852.13^2 + 84^2 = 85^2. Then p=84+13+85=182p = 84 + 13 + 85 = 182 (and abca=84131=1092=6p\frac{ab}{c - a} = \frac{84 \cdot 13}{1} = 1092 = 6p checks).

6.

对多项式 P(x)=113x+16x2P(x) = 1 - \frac{1}{3}x + \frac{1}{6}x^2,定义 Q(x)=P(x)P(x3)P(x5)P(x7)P(x9)=i=050aixi \begin{aligned} Q(x) &= P(x)P(x^3)P(x^5) \\ &\quad {}\cdot P(x^7)P(x^9) \\ &= \sum_{i=0}^{50} a_i x^i \end{aligned}\text{。}那么 i=050ai=mn\sum_{i=0}^{50} |a_i| = \frac{m}{n},其中 mmnn 是互质的正整数。求 m+nm + n

For polynomial P(x)=113x+16x2,P(x) = 1 - \frac{1}{3}x + \frac{1}{6}x^2, define Q(x)=P(x)P(x3)P(x5)P(x7)P(x9)=i=050aixi. \begin{aligned} Q(x) &= P(x)P(x^3)P(x^5) \\ &\quad {}\cdot P(x^7)P(x^9) \\ &= \sum_{i=0}^{50} a_i x^i. \end{aligned} Then i=050ai=mn,\sum_{i=0}^{50} |a_i| = \frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

答案:275
知识点:多项式换元法
难度评级:2400
小提示:

P(x)P(-x) 的系数全为正,而 Q(x)Q(-x) 是这类多项式的乘积

The coefficients of P(x)P(-x) are all positive, and Q(x)Q(-x) is a product of such polynomials

大提示:

所以 ai\sum |a_i| 正好是 Q(1)=P(1)5Q(-1) = P(-1)^5

So ai\sum |a_i| is just Q(1)=P(1)5Q(-1) = P(-1)^5

解答:

代入的各个幂 x,x3,x5,x7,x9x, x^3, x^5, x^7, x^9 都是奇次幂,所以 Q(x)Q(-x) =P(x)P(x3)P(x5)= P(-x)P(-x^3)P(-x^5) P(x7)P(x9)\cdot P(-x^7)P(-x^9)。因为 P(x)=1+13x+16x2P(-x) = 1 + \frac{1}{3}x + \frac{1}{6}x^2 只有非负系数,所以每个因子 P(xk)P(-x^k) 以及乘积 Q(x)Q(-x) 也都只有非负系数。Q(x)Q(-x)xix^i 的系数是 (1)iai(-1)^i a_i,所以 ai=(1)iai|a_i| = (-1)^i a_i

因此 i=050ai=Q(1)=P(1)5=(1+13+16)5=(32)5=24332 \begin{aligned} \sum_{i=0}^{50} |a_i| &= Q(-1) = P(-1)^5 \\ &= \left(1 + \frac{1}{3} + \frac{1}{6}\right)^5 \\ &= \left(\frac{3}{2}\right)^5 = \frac{243}{32} \end{aligned}\text{,}所以 m+n=243+32=275m + n = 243 + 32 = 275

Every substituted power x,x3,x5,x7,x9x, x^3, x^5, x^7, x^9 is odd, so Q(x)Q(-x) =P(x)P(x3)P(x5)= P(-x)P(-x^3)P(-x^5) P(x7)P(x9).\cdot P(-x^7)P(-x^9). Since P(x)=1+13x+16x2P(-x) = 1 + \frac{1}{3}x + \frac{1}{6}x^2 has only nonnegative coefficients, so does each factor P(xk),P(-x^k), and hence so does the product Q(x).Q(-x). The coefficient of xix^i in Q(x)Q(-x) is (1)iai,(-1)^i a_i, so ai=(1)iai.|a_i| = (-1)^i a_i.

Therefore i=050ai=Q(1)=P(1)5=(1+13+16)5=(32)5=24332, \begin{aligned} \sum_{i=0}^{50} |a_i| &= Q(-1) = P(-1)^5 \\ &= \left(1 + \frac{1}{3} + \frac{1}{6}\right)^5 \\ &= \left(\frac{3}{2}\right)^5 = \frac{243}{32}, \end{aligned} and m+n=243+32=275.m + n = 243 + 32 = 275.

7.

正方形 ABCDABCDEFGHEFGH 有共同的中心,且 ABEF\overline{AB} \parallel \overline{EF}ABCDABCD 的面积为 20162016EFGHEFGH 的面积是一个较小的正整数。构造正方形 IJKLIJKL,使它的每个顶点都在 ABCDABCD 的一条边上,并且 EFGHEFGH 的每个顶点都在 IJKLIJKL 的一条边上。求 IJKLIJKL 面积的所有可能整数值中,最大值与最小值的差。

Squares ABCDABCD and EFGHEFGH have a common center and ABEF.\overline{AB} \parallel \overline{EF}. The area of ABCDABCD is 2016,2016, and the area of EFGHEFGH is a smaller positive integer. Square IJKLIJKL is constructed so that each of its vertices lies on a side of ABCDABCD and each vertex of EFGHEFGH lies on a side of IJKL.IJKL. Find the difference between the largest and smallest possible integer values for the area of IJKL.IJKL.

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

一个边长为 tt 的正方形,若顶点在边长为 ss 的正方形边上且倾斜角为 θ\theta,则 s=t(cosθ+sinθ)s = t(\cos\theta + \sin\theta)

A square with vertices on the sides of a square of side s,s, tilted by θ,\theta, has side tt with s=t(cosθ+sinθ)s = t(\cos\theta + \sin\theta)

大提示:

同样的关系也连接 EFGHEFGHIJKLIJKL,所以面积成等比数列:若 TTIJKLIJKL 的面积,则 EFGHEFGH 的面积为 T22016\frac{T^2}{2016}

The same relation ties EFGHEFGH to IJKL,IJKL, so the areas form a geometric progression: the area of EFGHEFGH is T22016\frac{T^2}{2016} where TT is the area of IJKL.IJKL.

解答:

若一个边长为 tt 的正方形,其顶点在一个同心、边长为 ss 的正方形边上,并与外正方形成角 θ\theta,则外正方形的每条边被分成长度 tcosθt\cos\thetatsinθt\sin\theta 的两段,所以 s=t(cosθ+sinθ)s = t(\cos\theta + \sin\theta)。这适用于 ABCDABCD(边长 ss)中的 IJKLIJKL(边长 tt),对应某个角 θ\theta。由于 EFAB\overline{EF} \parallel \overline{AB},正方形 EFGHEFGH(边长 uu)与 IJKLIJKL 也成同一个角 θ\theta,所以还有 t=u(cosθ+sinθ)t = u(\cos\theta + \sin\theta)

因此 st=tu\frac{s}{t} = \frac{t}{u},所以三个面积成等比数列:若 TTIJKLIJKL 的面积,则 EFGHEFGH 的面积为 T22016\frac{T^2}{2016}。当 θ\theta(0,90)\left(0^\circ, 90^\circ\right) 中变化时,因子 (cosθ+sinθ)2(\cos\theta + \sin\theta)^2 取遍 (1,2](1, 2] 中的每个值,所以 T=2016(cosθ+sinθ)2T = \frac{2016}{(\cos\theta + \sin\theta)^2} 取遍 [1008,2016)[1008, 2016) 中的每个值(θ=0\theta = 0^\circ 被排除,因为 EFGHEFGH 小于 ABCDABCD)。为了使 T22016\frac{T^2}{2016} 是整数,2016=253272016 = 2^5 \cdot 3^2 \cdot 7 必须整除 T2T^2,这迫使 2337=1682^3 \cdot 3 \cdot 7 = 168 整除 TT

[1008,2016)[1008, 2016)168168 的倍数从 1008100818481848,并且每个都能由合适的 θ\theta 取得,此时 EFGHEFGH 的面积是小于 20162016 的正整数。差为 18481008=8401848 - 1008 = 840

If a square of side tt has its vertices on the sides of a concentric square of side ss and is tilted by angle θ,\theta, each side of the outer square is split into pieces tcosθt\cos\theta and tsinθ,t\sin\theta, so s=t(cosθ+sinθ).s = t(\cos\theta + \sin\theta). This applies to IJKLIJKL (side tt) in ABCDABCD (side ss) with some angle θ.\theta. Since EFAB,\overline{EF} \parallel \overline{AB}, square EFGHEFGH (side uu) makes the same angle θ\theta with IJKL,IJKL, so also t=u(cosθ+sinθ).t = u(\cos\theta + \sin\theta).

Hence st=tu,\frac{s}{t} = \frac{t}{u}, so the three areas form a geometric progression: the area of EFGHEFGH equals T22016,\frac{T^2}{2016}, where TT is the area of IJKL.IJKL. As θ\theta ranges over (0,90),\left(0^\circ, 90^\circ\right), the factor (cosθ+sinθ)2(\cos\theta + \sin\theta)^2 takes every value in (1,2],(1, 2], so T=2016(cosθ+sinθ)2T = \frac{2016}{(\cos\theta + \sin\theta)^2} takes every value in [1008,2016)[1008, 2016) (θ=0\theta = 0^\circ is excluded because EFGHEFGH is smaller than ABCDABCD). For T22016\frac{T^2}{2016} to be an integer, 2016=253272016 = 2^5 \cdot 3^2 \cdot 7 must divide T2,T^2, which forces 2337=1682^3 \cdot 3 \cdot 7 = 168 to divide T.T.

The multiples of 168168 in [1008,2016)[1008, 2016) run from 10081008 to 1848,1848, and each is attained by an appropriate θ,\theta, with the area of EFGHEFGH then a positive integer less than 2016.2016. The difference is 18481008=840.1848 - 1008 = 840.

8.

求满足下列条件的三元素集合 {a,b,c}\{a, b, c\} 的个数:aabbcc 是三个互不相同的正整数,且它们的乘积等于 111121213131414151516161 的乘积。

Find the number of sets {a,b,c}\{a, b, c\} of three distinct positive integers with the property that the product of a,a, b,b, and cc is equal to the product of 11,11, 21,21, 31,31, 41,41, 51,51, and 61.61.

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

这个乘积为 32711173141613^2 \cdot 7 \cdot 11 \cdot 17 \cdot 31 \cdot 41 \cdot 61。先通过分配每个质因数来计数有序三元组。

The product is 3271117314161.3^2 \cdot 7 \cdot 11 \cdot 17 \cdot 31 \cdot 41 \cdot 61. First count ordered triples by distributing each prime.

大提示:

若某个值出现两次,则它的平方必须整除这个乘积,所以它只能是 1133。去掉这些三元组后再除以 66

A value that appears twice must have its square divide the product, so it is 11 or 3.3. Remove those triples and divide by 6.6.

解答:

先计数满足下式的有序三元组 (a,b,c)(a, b, c)abc=112131415161=3271117314161=N \begin{aligned} abc &= 11 \cdot 21 \cdot 31 \cdot 41 \cdot 51 \cdot 61 \\ &= 3^2 \cdot 7 \cdot 11 \cdot 17 \cdot 31 \cdot 41 \\ &\quad {}\cdot 61 = N \end{aligned}\text{。}六个质数 7,11,17,31,41,617, 11, 17, 31, 41, 61 各出现一次,每个都可分给三个数中的任意一个,有 363^6 种。两个因子 33 可以分配给三个数,有 (42)=6\binom{4}{2} = 6 种。于是共有 636=43746 \cdot 3^6 = 4374 个有序三元组。

若三个值中有两个相等,它们的共同值 vv 满足 v2v^2 整除 NN,所以 v=1v = 1v=3v = 3。这给出取值集合 {1,1,N}\{1, 1, N\}{3,3,N9}\{3, 3, \frac{N}{9}\} 的三元组,每种有 33 个顺序,一共 66 个有序三元组(三个全相等不可能)。剩下的 43746=43684374 - 6 = 4368 个有序三元组的元素互不相同,而每个集合 {a,b,c}\{a, b, c\} 被计数 3!=63! = 6 次。

所以集合个数为 43686=728\frac{4368}{6} = 728

Count ordered triples (a,b,c)(a, b, c) with abc=112131415161=3271117314161=N. \begin{aligned} abc &= 11 \cdot 21 \cdot 31 \cdot 41 \cdot 51 \cdot 61 \\ &= 3^2 \cdot 7 \cdot 11 \cdot 17 \cdot 31 \cdot 41 \\ &\quad {}\cdot 61 = N. \end{aligned} Each of the six primes 7,11,17,31,41,617, 11, 17, 31, 41, 61 appears once and can go to any of the three values: 363^6 ways. The two factors of 33 can be split among the three values in (42)=6\binom{4}{2} = 6 ways. That gives 636=43746 \cdot 3^6 = 4374 ordered triples.

If two of the three values were equal, their common value vv would be such that v2v^2 divides N,N, so v=1v = 1 or v=3.v = 3. This produces the triples with values {1,1,N}\{1, 1, N\} and {3,3,N9},\{3, 3, \frac{N}{9}\}, each in 33 orders, for 66 ordered triples in all (all three equal is impossible). The remaining 43746=43684374 - 6 = 4368 ordered triples have distinct entries, and each set {a,b,c}\{a, b, c\} is counted 3!=63! = 6 times.

So the number of sets is 43686=728.\frac{4368}{6} = 728.

9.

正整数数列 11a2a_2a3a_3\ldots11b2b_2b3b_3\ldots 分别是递增等差数列与递增等比数列。令 cn=an+bnc_n = a_n + b_n。存在一个整数 kk,使得 ck1=100c_{k-1} = 100ck+1=1000c_{k+1} = 1000。求 ckc_k

The sequences of positive integers 1,1, a2,a_2, a3,a_3, \ldots and 1,1, b2,b_2, b3,b_3, \ldots are an increasing arithmetic sequence and an increasing geometric sequence, respectively. Let cn=an+bn.c_n = a_n + b_n. There is an integer kk such that ck1=100c_{k-1} = 100 and ck+1=1000.c_{k+1} = 1000. Find ck.c_k.

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

写成 an=1+(n1)da_n = 1 + (n-1)dbn=rn1b_n = r^{n-1},其中整数 d1d \ge 1r2r \ge 2,再把两个已知值化为方程

Write an=1+(n1)da_n = 1 + (n-1)d and bn=rn1b_n = r^{n-1} with integers d1,d \ge 1, r2,r \ge 2, and turn the two given values into equations

大提示:

证明 dd 以及随后 rr 都必须是 33 的倍数;在 rk<999r^k \lt 999 下,只剩六个 (r,k)(r, k) 需要测试

Show dd and then rr must be multiples of 3;3; with rk<999r^k \lt 999 only six pairs (r,k)(r, k) remain to test

解答:

an=1+(n1)da_n = 1 + (n-1)dbn=rn1b_n = r^{n-1},其中整数 d1d \ge 1r2r \ge 2。因为 c1=2<100c_1 = 2 \lt 100,所以 k3k \ge 3,两个条件变为 (k2)d+rk2=99(k-2)d + r^{k-2} = 99\text{,}kd+rk=999kd + r^k = 999\text{。}

相减得 2d+rk3(r1)r(r+1)=9002d + r^{k-3}(r-1)r(r+1) = 900。三个连续整数的乘积能被 33 整除,所以 33 整除 2d2d,于是 33 整除 dd。再由 (k2)d+rk2=99(k-2)d + r^{k-2} = 99 可知 33 整除 rk2r^{k-2},所以 33 整除 rr。界限 rk298r^{k-2} \le 98rk998r^k \le 998 只留下 (r,k)=(3,3)(r, k) = (3, 3)(3,4)(3, 4)(3,5)(3, 5)(3,6)(3, 6)(6,3)(6, 3)(9,3)(9, 3)

逐一代入 (k2)d=99rk2(k-2)d = 99 - r^{k-2}kd=999rkkd = 999 - r^k,只有 (r,k)=(9,3)(r, k) = (9, 3) 给出一致的值 d=90d = 90。于是 c3=1+290+92=262c_3 = 1 + 2 \cdot 90 + 9^2 = 262

Write an=1+(n1)da_n = 1 + (n-1)d and bn=rn1b_n = r^{n-1} with integers d1d \ge 1 and r2.r \ge 2. Since c1=2<100,c_1 = 2 \lt 100, we have k3,k \ge 3, and the two conditions read (k2)d+rk2=99,(k-2)d + r^{k-2} = 99, kd+rk=999.kd + r^k = 999.

Subtracting, 2d+rk3(r1)r(r+1)=900.2d + r^{k-3}(r-1)r(r+1) = 900. The product of three consecutive integers is divisible by 3,3, so 33 divides 2d,2d, hence 33 divides d.d. Then (k2)d+rk2=99(k-2)d + r^{k-2} = 99 forces 33 to divide rk2,r^{k-2}, so 33 divides r.r. The bounds rk298r^{k-2} \le 98 and rk998r^k \le 998 leave only (r,k)=(3,3),(r, k) = (3, 3), (3,4),(3, 4), (3,5),(3, 5), (3,6),(3, 6), (6,3),(6, 3), (9,3).(9, 3).

Testing each against (k2)d=99rk2(k-2)d = 99 - r^{k-2} and kd=999rk,kd = 999 - r^k, only (r,k)=(9,3)(r, k) = (9, 3) gives a consistent value, d=90.d = 90. Then c3=1+290+92=262.c_3 = 1 + 2 \cdot 90 + 9^2 = 262.

10.

三角形 ABCABC 内接于圆 ω\omega。点 PPQQ 在边 AB\overline{AB} 上,且 AP<AQAP \lt AQ。射线 CPCPCQCQ 分别再次交 ω\omegaSSTT(不同于 CC)。若 AP=4AP = 4PQ=3PQ = 3QB=6QB = 6BT=5BT = 5AS=7AS = 7,则 ST=mnST = \frac{m}{n},其中 mmnn 是互质的正整数。求 m+nm + n

Triangle ABCABC is inscribed in circle ω.\omega. Points PP and QQ are on side AB\overline{AB} with AP<AQ.AP \lt AQ. Rays CPCP and CQCQ meet ω\omega again at SS and TT (other than CC), respectively. If AP=4,AP = 4, PQ=3,PQ = 3, QB=6,QB = 6, BT=5,BT = 5, and AS=7,AS = 7, then ST=mn,ST = \frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

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

ABAB 延长过 BBRR,使 BR=8BR = 8。则 QPQR=42=QCQTQP \cdot QR = 42 = QC \cdot QT,所以 CCPPTTRR 共圆。

Extend ABAB past BB to RR with BR=8.BR = 8. Then QPQR=42=QCQT,QP \cdot QR = 42 = QC \cdot QT, so C,C, P,P, T,T, RR lie on a circle.

大提示:

在两个圆中追角,可得 ASTRBT\triangle AST \sim \triangle RBT,所以 ST=ASBTRBST = AS \cdot \frac{BT}{RB}

Chase angles through both circles to get ASTRBT,\triangle AST \sim \triangle RBT, so ST=ASBTRBST = AS \cdot \frac{BT}{RB}

解答:

QQ 对圆 ω\omega 的幂,QCQT=QAQBQC \cdot QT = QA \cdot QB =76=42= 7 \cdot 6 = 42。将 AB\overline{AB}BB 外延长到点 RR,使 BR=8BR = 8,于是 QR=QB+BR=14QR = QB + BR = 14,且 QPQR=314QP \cdot QR = 3 \cdot 14 =42=QCQT= 42 = QC \cdot QT。由点幂定理的逆定理,CCPPTTRR 共圆。

在圆 CPTRCPTR 中,BRT=PRT=PCT\angle BRT = \angle PRT = \angle PCT;在 ω\omega 中,PCT=SCT=SAT\angle PCT = \angle SCT = \angle SAT(它们都对弧 STST)。此外 ASTBASTB 共圆,所以这个四边形在 BB 处的外角等于对面的内角:RBT=AST\angle RBT = \angle AST。因此 ASTRBT\triangle AST \sim \triangle RBT

因此 STBT=ASRB\frac{ST}{BT} = \frac{AS}{RB},所以 ST=578=358ST = 5 \cdot \frac{7}{8} = \frac{35}{8},从而 m+n=35+8=43m + n = 35 + 8 = 43

By Power of a Point at QQ in ω,\omega, QCQT=QAQBQC \cdot QT = QA \cdot QB =76=42.= 7 \cdot 6 = 42. Extend AB\overline{AB} beyond BB to the point RR with BR=8,BR = 8, so that QR=QB+BR=14QR = QB + BR = 14 and QPQR=314QP \cdot QR = 3 \cdot 14 =42=QCQT.= 42 = QC \cdot QT. By the converse of Power of a Point, C,C, P,P, T,T, and RR are concyclic.

In circle CPTR,CPTR, BRT=PRT=PCT,\angle BRT = \angle PRT = \angle PCT, and in ω,\omega, PCT=SCT=SAT\angle PCT = \angle SCT = \angle SAT (both subtend arc STST). Also ASTBASTB is cyclic, so the exterior angle of the quadrilateral at BB equals the opposite interior angle: RBT=AST.\angle RBT = \angle AST. Hence ASTRBT.\triangle AST \sim \triangle RBT.

Therefore STBT=ASRB,\frac{ST}{BT} = \frac{AS}{RB}, so ST=578=358,ST = 5 \cdot \frac{7}{8} = \frac{35}{8}, and m+n=35+8=43.m + n = 35 + 8 = 43.

11.

对正整数 NNkk,若存在正整数 aa,使得 aka^k 恰有 NN 个正因数,则称 NNkk-nice。求小于 10001000 且既不是 77-nice 也不是 88-nice 的正整数个数。

For positive integers NN and k,k, define NN to be kk-nice if there exists a positive integer aa such that aka^k has exactly NN positive divisors. Find the number of positive integers less than 10001000 that are neither 77-nice nor 88-nice.

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

a=p1m1ptmta = p_1^{m_1} \cdots p_t^{m_t},则 aka^k(km1+1)(kmt+1)(km_1 + 1) \cdots (km_t + 1) 个因数,每个因子都比 kk 的倍数多 11

If a=p1m1ptmt,a = p_1^{m_1} \cdots p_t^{m_t}, then aka^k has (km1+1)(kmt+1)(km_1 + 1) \cdots (km_t + 1) divisors, which is 11 more than a multiple of kk

大提示:

每个 N1(modk)N \equiv 1 \pmod{k} 也都可行(取 a=pma = p^m)。用容斥计数 10001000 以下同余于 1177 和模 88 的数。

Every N1(modk)N \equiv 1 \pmod{k} works too (take a=pma = p^m). Count residues 11 mod 77 and mod 88 below 10001000 by inclusion-exclusion.

解答:

a=p1m1ptmta = p_1^{m_1} \cdots p_t^{m_t},则 aka^k(km1+1)(km2+1)(km_1 + 1)(km_2 + 1) (kmt+1)\cdots (km_t + 1) 个正因数,且每个因子都 1(modk)\equiv 1 \pmod{k},所以乘积也如此。反过来,若 N=km+1N = km + 1,取 a=pma = p^m,则 ak=pkma^k = p^{km} 恰有 NN 个因数。因此 NNkk-nice 当且仅当 N1(modk)N \equiv 1 \pmod{k}

1,2,,9991, 2, \ldots, 999 中,有 143143 个整数 1(mod7)\equiv 1 \pmod{7}(即 1,8,,9951, 8, \ldots, 995),有 125125 个整数 1(mod8)\equiv 1 \pmod{8}(即 1,9,,9931, 9, \ldots, 993)。因为 lcm(7,8)=56\operatorname{lcm}(7, 8) = 56,所以有 1818 个整数 1(mod56)\equiv 1 \pmod{56}(即 1,57,,9531, 57, \ldots, 953)。由容斥,有 143+12518=250143 + 125 - 18 = 250 个数是 77-nice 或 88-nice。

因此,小于 10001000 且两者都不是的正整数有 999250=749999 - 250 = 749 个。

If a=p1m1ptmt,a = p_1^{m_1} \cdots p_t^{m_t}, then aka^k has (km1+1)(km2+1)(km_1 + 1)(km_2 + 1) (kmt+1)\cdots (km_t + 1) positive divisors, and each factor is 1(modk),\equiv 1 \pmod{k}, so the product is too. Conversely, if N=km+1,N = km + 1, then a=pma = p^m gives ak=pkma^k = p^{km} with exactly NN divisors. So NN is kk-nice exactly when N1(modk).N \equiv 1 \pmod{k}.

Among 1,2,,9991, 2, \ldots, 999 there are 143143 integers 1(mod7)\equiv 1 \pmod{7} (namely 1,8,,9951, 8, \ldots, 995) and 125125 integers 1(mod8)\equiv 1 \pmod{8} (namely 1,9,,9931, 9, \ldots, 993). Since lcm(7,8)=56,\operatorname{lcm}(7, 8) = 56, there are 1818 integers 1(mod56)\equiv 1 \pmod{56} (namely 1,57,,9531, 57, \ldots, 953). By inclusion-exclusion, 143+12518=250143 + 125 - 18 = 250 of them are 77-nice or 88-nice.

Hence 999250=749999 - 250 = 749 positive integers less than 10001000 are neither.

12.

下图是墙上一个由六个小区域组成的待涂圆环。你有四种油漆颜色可用,并将每个小区域涂成一种纯色。如果相邻的两个区域不能涂成同一种颜色,求涂色方案的数量。

The figure below shows a ring made of six small sections which you are to paint on a wall. You have four paint colors available and will paint each of the six sections a solid color. Find the number of ways you can choose to paint the sections if no two adjacent sections can be painted with the same color.

答案:732
知识点:图论递推计数
难度评级:2400
小提示:

一排 nn 个区域若相邻颜色不同,可以用 43n14 \cdot 3^{n-1} 种方式涂色;按两端颜色是否相同拆分

A row of nn sections with adjacent colors different can be painted in 43n14 \cdot 3^{n-1} ways; split these by whether the two end colors match

大提示:

PnP_n 计数环形涂色,则 Pn+Pn1=43n1P_n + P_{n-1} = 4 \cdot 3^{n-1},从 P3=24P_3 = 24 开始

If PnP_n counts ring colorings, then Pn+Pn1=43n1,P_n + P_{n-1} = 4 \cdot 3^{n-1}, starting from P3=24P_3 = 24

解答:

PnP_nnn 个区域构成的环的合法涂色数。把环在两个相邻区域之间剪开,可知环的涂色正好对应于一排 nn 个区域的涂色,其中相邻颜色不同,并且两个端点颜色也不同。一排 nn 个区域若相邻颜色不同,可用 43n14 \cdot 3^{n-1} 种方式涂色;而两个端点颜色相同的行涂色,通过把两个端点区域合并为一个区域,对应于 n1n - 1 个区域的环涂色。因此 Pn+Pn1=43n1P_n + P_{n-1} = 4 \cdot 3^{n-1}\text{。}

三个两两相邻的区域给出 P3=432=24P_3 = 4 \cdot 3 \cdot 2 = 24,所以 P4=10824=84P_4 = 108 - 24 = 84,接着 P5=32484=240P_5 = 324 - 84 = 240,最后 P6=972240=732P_6 = 972 - 240 = 732

Let PnP_n be the number of valid paintings of a ring of nn sections. Cutting a ring open between two adjacent sections shows that ring paintings correspond exactly to rows of nn sections with adjacent colors different and the two end colors different. A row of nn sections with adjacent colors different can be painted in 43n14 \cdot 3^{n-1} ways, and the rows whose end colors match correspond, by merging the two end sections into one, to ring paintings of n1n - 1 sections. Hence Pn+Pn1=43n1.P_n + P_{n-1} = 4 \cdot 3^{n-1}.

Three mutually adjacent sections give P3=432=24,P_3 = 4 \cdot 3 \cdot 2 = 24, so P4=10824=84,P_4 = 108 - 24 = 84, then P5=32484=240,P_5 = 324 - 84 = 240, and finally P6=972240=732.P_6 = 972 - 240 = 732.

13.

Beatrix 要在一个 6×66 \times 6 棋盘上放置六个车,棋盘的行和列都标为 1166;放置时任意两个车都不在同一行或同一列。一个格子的定义为它的行号与列号之和。一种摆放的得分定义为所有被占格子中的最小值。所有合法摆放的平均得分为 pq\frac{p}{q},其中 ppqq 是互质的正整数。求 p+qp + q

Beatrix is going to place six rooks on a 6×66 \times 6 chessboard where both the rows and columns are labeled 11 to 6;6; the rooks are placed so that no two rooks are in the same row or the same column. The value of a square is the sum of its row number and column number. The score of an arrangement of rooks is the least value of any occupied square. The average score over all valid configurations is pq,\frac{p}{q}, where pp and qq are relatively prime positive integers. Find p+q.p + q.

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

通过计数 bnb_n,即得分至少为 nn 的摆放数,来求得分总和:总和是 2720+b3+b4++b72 \cdot 720 + b_3 + b_4 + \cdots + b_7

Sum the scores by counting bn,b_n, the arrangements with score at least n:n: the total is 2720+b3+b4++b72 \cdot 720 + b_3 + b_4 + \cdots + b_7

大提示:

得分 n\ge n 会禁止行号与列号之和 <n\lt n 的格子;逐行放置车,例如 b4=444!b_4 = 4 \cdot 4 \cdot 4!

Score n\ge n bans the squares with row + column <n;\lt n; place rooks row by row, e.g. b4=444!b_4 = 4 \cdot 4 \cdot 4!

解答:

共有 6!=7206! = 720 种摆放,并且每个得分都在 2277 之间。令 bnb_n 为得分至少为 nn 的摆放数。因为每个得分 ss 满足 s=2+#{n3:sn}s = 2 + \#\{n \ge 3 : s \ge n\},所以所有 720720 个得分的总和为 2720+b3+b4+b5+b6+b72 \cdot 720 + b_3 + b_4 + b_5 + b_6 + b_7\text{。}

得分 n\ge n 意味着没有车占据行号与列号之和 <n\lt n 的格子。逐行放置。对 b3b_3,只有 (1,1)(1,1) 被禁用,共有 55!=6005 \cdot 5! = 600 种。对 b4b_4,第 11 行有 44 个可用列,然后第 22 行有 44 个可用列(列 11 和已使用列被排除),共有 444!=3844 \cdot 4 \cdot 4! = 384 种。类似地,b5=3333!=162b_5 = 3 \cdot 3 \cdot 3 \cdot 3! = 162b6=22222!=32b_6 = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2! = 32,且 b7=1b_7 = 1(所有车都在反对角线上)。

总和为 1440+600+3841440 + 600 + 384 +162+32+1=2619+ 162 + 32 + 1 = 2619,所以平均值为 2619720=29180\frac{2619}{720} = \frac{291}{80},从而 p+q=291+80=371p + q = 291 + 80 = 371

There are 6!=7206! = 720 arrangements, and every score lies between 22 and 7.7. Let bnb_n be the number of arrangements with score at least n.n. Since each score ss satisfies s=2+#{n3:sn},s = 2 + \#\{n \ge 3 : s \ge n\}, the total of all 720720 scores is 2720+b3+b4+b5+b6+b7.2 \cdot 720 + b_3 + b_4 + b_5 + b_6 + b_7.

Score n\ge n means no rook occupies a square with row + column <n.\lt n. Place the rooks row by row. For b3,b_3, only (1,1)(1,1) is banned: 55!=600.5 \cdot 5! = 600. For b4,b_4, row 11 has 44 allowed columns, then row 22 has 44 (column 11 and the used column are excluded): 444!=384.4 \cdot 4 \cdot 4! = 384. Similarly b5=3333!=162,b_5 = 3 \cdot 3 \cdot 3 \cdot 3! = 162, b6=22222!=32,b_6 = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2! = 32, and b7=1b_7 = 1 (all rooks on the anti-diagonal).

The total is 1440+600+3841440 + 600 + 384 +162+32+1=2619,+ 162 + 32 + 1 = 2619, so the average is 2619720=29180,\frac{2619}{720} = \frac{291}{80}, and p+q=291+80=371.p + q = 291 + 80 = 371.

14.

等边三角形 ABC\triangle ABC 的边长为 600600。点 PPQQABC\triangle ABC 所在平面外,并位于该平面的相对两侧。此外,PA=PB=PCPA = PB = PC,且 QA=QB=QCQA = QB = QC,并且 PAB\triangle PAB 所在平面与 QAB\triangle QAB 所在平面形成 120120^\circ 的二面角(两个平面之间的角)。存在一点 OO,它到 AABBCCPPQQ 的距离都为 dd。求 dd

Equilateral ABC\triangle ABC has side length 600.600. Points PP and QQ lie outside the plane of ABC\triangle ABC and are on opposite sides of the plane. Furthermore, PA=PB=PC,PA = PB = PC, and QA=QB=QC,QA = QB = QC, and the planes of PAB\triangle PAB and QAB\triangle QAB form a 120120^\circ dihedral angle (the angle between the two planes). There is a point OO whose distance from each of A,A, B,B, C,C, P,P, and QQ is d.d. Find d.d.

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

PPQQOO 都在过 ABC\triangle ABC 中心且垂直于其平面的直线上,并且 OOPQ\overline{PQ} 的中点

P,P, Q,Q, and OO all lie on the line through the center of ABC\triangle ABC perpendicular to its plane, and OO is the midpoint of PQ\overline{PQ}

大提示:

因为 OC=OP=OQOC = OP = OQ,所以有 PCQ=90\angle PCQ = 90^\circ,从而 CH2=PHQHCH^2 = PH \cdot QH。再结合 AB\overline{AB} 中点处的正切加法公式。

Since OC=OP=OQ,OC = OP = OQ, PCQ=90,\angle PCQ = 90^\circ, so CH2=PHQH.CH^2 = PH \cdot QH. Combine with the tangent addition formula at the midpoint of AB.\overline{AB}.

解答:

因为 PA=PB=PCPA = PB = PCQA=QB=QCQA = QB = QC,点 PPQQ 都在过 ABC\triangle ABC 的中心 HH 且垂直于其平面的直线上,并位于两侧。任意到 AABBCC 等距的点也在这条直线上,所以 OO 在这条直线上;又 OP=OQ=dOP = OQ = d,所以 OOPQ\overline{PQ} 的中点,且 PQ=2dPQ = 2d。令 DDAB\overline{AB} 的中点,并设 a=600a = 600;则 DH=a36DH = \frac{a\sqrt{3}}{6}CH=a33CH = \frac{a\sqrt{3}}{3}。因为 PDAB\overline{PD} \perp \overline{AB}QDAB\overline{QD} \perp \overline{AB},二面角为 PDQ=120\angle PDQ = 120^\circ;设 x=PDHx = \angle PDHy=QDHy = \angle QDH,于是 x+y=120x + y = 120^\circ

直角三角形 PDHPDHQDHQDH 给出 PH=DHtanxPH = DH \tan xQH=DHtanyQH = DH \tan y,所以 2d=PQ=PH+QH=a36(tanx+tany) \begin{aligned} 2d = PQ &= PH \\ &\quad {}+ QH \\ &= \frac{a\sqrt{3}}{6} \\ &\quad {}\cdot (\tan x + \tan y) \end{aligned}\text{。}因为 OC=OP=OQ=dOC = OP = OQ = d,点 CC 在以 PQ\overline{PQ} 为直径的圆上,所以 PCQ=90\angle PCQ = 90^\circ,且 HH 是从 CC 到斜边 PQ\overline{PQ} 的高的垂足。因此 CH2=PHQHCH^2 = PH \cdot QH,得到 tanxtany=CH2DH2=4\tan x \tan y = \frac{CH^2}{DH^2} = 4

由正切加法公式,3=tan120-\sqrt{3} = \tan 120^\circ =tanx+tany1tanxtany= \frac{\tan x + \tan y}{1 - \tan x \tan y} =tanx+tany3= \frac{\tan x + \tan y}{-3},所以 tanx+tany=33\tan x + \tan y = 3\sqrt{3}。于是 2d=a3633=3a22d = \frac{a\sqrt{3}}{6} \cdot 3\sqrt{3} = \frac{3a}{2},因此 d=3a4=450d = \frac{3a}{4} = 450

Since PA=PB=PCPA = PB = PC and QA=QB=QC,QA = QB = QC, both PP and QQ lie on the line through the center HH of ABC\triangle ABC perpendicular to its plane, on opposite sides. Any point equidistant from A,A, B,B, CC also lies on that line, so OO is on it, and OP=OQ=dOP = OQ = d makes OO the midpoint of PQ,\overline{PQ}, with PQ=2d.PQ = 2d. Let DD be the midpoint of AB\overline{AB} and a=600;a = 600; then DH=a36DH = \frac{a\sqrt{3}}{6} and CH=a33.CH = \frac{a\sqrt{3}}{3}. Since PDAB\overline{PD} \perp \overline{AB} and QDAB,\overline{QD} \perp \overline{AB}, the dihedral angle is PDQ=120;\angle PDQ = 120^\circ; write x=PDHx = \angle PDH and y=QDH,y = \angle QDH, so x+y=120.x + y = 120^\circ.

Right triangles PDHPDH and QDHQDH give PH=DHtanxPH = DH \tan x and QH=DHtany,QH = DH \tan y, so 2d=PQ=PH+QH=a36(tanx+tany). \begin{aligned} 2d = PQ &= PH \\ &\quad {}+ QH \\ &= \frac{a\sqrt{3}}{6} \\ &\quad {}\cdot (\tan x + \tan y). \end{aligned} Since OC=OP=OQ=d,OC = OP = OQ = d, point CC lies on the circle with diameter PQ,\overline{PQ}, so PCQ=90,\angle PCQ = 90^\circ, and HH is the foot of the altitude from CC to the hypotenuse PQ.\overline{PQ}. Thus CH2=PHQH,CH^2 = PH \cdot QH, which gives tanxtany=CH2DH2=4.\tan x \tan y = \frac{CH^2}{DH^2} = 4.

By the tangent addition formula, 3=tan120-\sqrt{3} = \tan 120^\circ =tanx+tany1tanxtany= \frac{\tan x + \tan y}{1 - \tan x \tan y} =tanx+tany3,= \frac{\tan x + \tan y}{-3}, so tanx+tany=33.\tan x + \tan y = 3\sqrt{3}. Then 2d=a3633=3a2,2d = \frac{a\sqrt{3}}{6} \cdot 3\sqrt{3} = \frac{3a}{2}, so d=3a4=450.d = \frac{3a}{4} = 450.

15.

1i2151 \le i \le 215,令 ai=12ia_i = \frac{1}{2^i},并令 a216=12215a_{216} = \frac{1}{2^{215}}。设 x1x_1x2x_2\ldotsx216x_{216} 是正实数,满足 i=1216xi=1\sum_{i=1}^{216} x_i = 1 以及 1i<j216xixj=107215+i=1216aixi22(1ai) \begin{aligned} &\sum_{1 \le i \lt j \le 216} x_i x_j \\ &= \frac{107}{215} \\ &\quad {}+ \sum_{i=1}^{216} \frac{a_i x_i^2}{2(1 - a_i)} \end{aligned}\text{。}x2=mnx_2 = \frac{m}{n} 是其最大可能值,其中 mmnn 是互质的正整数。求 m+nm + n

For 1i2151 \le i \le 215 let ai=12ia_i = \frac{1}{2^i} and a216=12215.a_{216} = \frac{1}{2^{215}}. Let x1,x_1, x2,x_2, ,\ldots, x216x_{216} be positive real numbers such that i=1216xi=1\sum_{i=1}^{216} x_i = 1 and 1i<j216xixj=107215+i=1216aixi22(1ai). \begin{aligned} &\sum_{1 \le i \lt j \le 216} x_i x_j \\ &= \frac{107}{215} \\ &\quad {}+ \sum_{i=1}^{216} \frac{a_i x_i^2}{2(1 - a_i)}. \end{aligned} The maximum possible value of x2=mn,x_2 = \frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

答案:863
难度评级:3500
小提示:

使用 2i<jxixj=1xi22\sum_{i \lt j} x_i x_j = 1 - \sum x_i^2,把条件化为 xi21ai=1215\sum \frac{x_i^2}{1 - a_i} = \frac{1}{215}

Use 2i<jxixj=1xi22\sum_{i \lt j} x_i x_j = 1 - \sum x_i^2 to turn the condition into xi21ai=1215\sum \frac{x_i^2}{1 - a_i} = \frac{1}{215}

大提示:

因为 (1ai)=215\sum (1 - a_i) = 215,柯西-施瓦茨不等式在这里成为等号情形,迫使 xix_i1ai1 - a_i 成比例

Since (1ai)=215,\sum (1 - a_i) = 215, Cauchy-Schwarz makes this an equality case, forcing xix_i proportional to 1ai1 - a_i

解答:

因为 xi=1\sum x_i = 1,所以 2i<jxixj=1xi22\sum_{i \lt j} x_i x_j = 1 - \sum x_i^2。将题设等式乘以两倍并整理,1i=1216xi2=214215+i=1216aixi21ai \begin{aligned} 1 - \sum_{i=1}^{216} x_i^2 &= \frac{214}{215} \\ &\quad {}+ \sum_{i=1}^{216} \frac{a_i x_i^2}{1 - a_i} \end{aligned}\text{,}所以 1215=i=1216(1+ai1ai)xi2=i=1216xi21ai \begin{aligned} \frac{1}{215} &= \sum_{i=1}^{216}\left(1 + \frac{a_i}{1 - a_i}\right)x_i^2 \\ &= \sum_{i=1}^{216} \frac{x_i^2}{1 - a_i} \end{aligned}\text{。}

现在 ai=(12++12215)\sum a_i = \left(\frac{1}{2} + \cdots + \frac{1}{2^{215}}\right) +12215=1+ \frac{1}{2^{215}} = 1,所以 (1ai)=2161=215\sum (1 - a_i) = 216 - 1 = 215。由柯西-施瓦茨不等式,1=(i=1216xi)2(i=1216xi21ai)(i=1216(1ai))=1215215=1 \begin{aligned} 1 &= \left(\sum_{i=1}^{216} x_i\right)^2 \\ &\le \left(\sum_{i=1}^{216} \frac{x_i^2}{1 - a_i}\right) \\ &\quad {}\cdot \left(\sum_{i=1}^{216} (1 - a_i)\right) \\ &= \frac{1}{215} \cdot 215 = 1 \end{aligned}\text{。}

等号成立,所以 xix_i1ai1 - a_i 成比例,迫使 xi=1ai215x_i = \frac{1 - a_i}{215}。因此 x2x_2 唯一可能、也就是最大可能的值为 114215=3860\frac{1 - \frac{1}{4}}{215} = \frac{3}{860},所以 m+n=3+860=863m + n = 3 + 860 = 863

Since xi=1,\sum x_i = 1, we have 2i<jxixj=1xi2.2\sum_{i \lt j} x_i x_j = 1 - \sum x_i^2. Doubling the given equation and rearranging, 1i=1216xi2=214215+i=1216aixi21ai, \begin{aligned} 1 - \sum_{i=1}^{216} x_i^2 &= \frac{214}{215} \\ &\quad {}+ \sum_{i=1}^{216} \frac{a_i x_i^2}{1 - a_i}, \end{aligned} so 1215=i=1216(1+ai1ai)xi2=i=1216xi21ai. \begin{aligned} \frac{1}{215} &= \sum_{i=1}^{216}\left(1 + \frac{a_i}{1 - a_i}\right)x_i^2 \\ &= \sum_{i=1}^{216} \frac{x_i^2}{1 - a_i}. \end{aligned}

Now ai=(12++12215)\sum a_i = \left(\frac{1}{2} + \cdots + \frac{1}{2^{215}}\right) +12215=1,+ \frac{1}{2^{215}} = 1, so (1ai)=2161=215.\sum (1 - a_i) = 216 - 1 = 215. By the Cauchy-Schwarz inequality, 1=(i=1216xi)2(i=1216xi21ai)(i=1216(1ai))=1215215=1. \begin{aligned} 1 &= \left(\sum_{i=1}^{216} x_i\right)^2 \\ &\le \left(\sum_{i=1}^{216} \frac{x_i^2}{1 - a_i}\right) \\ &\quad {}\cdot \left(\sum_{i=1}^{216} (1 - a_i)\right) \\ &= \frac{1}{215} \cdot 215 = 1. \end{aligned}

Equality holds, so xix_i is proportional to 1ai,1 - a_i, forcing xi=1ai215.x_i = \frac{1 - a_i}{215}. The only, hence maximum, possible value of x2x_2 is 114215=3860,\frac{1 - \frac{1}{4}}{215} = \frac{3}{860}, and m+n=3+860=863.m + n = 3 + 860 = 863.