1985 AIME 第 8 题

先试着解答 1985 AIME 第 8 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 1985 AIME 解答,或核对答案

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

8.

下列七个数的和恰为 1919a1=2.56,a2=2.61,a3=2.65,a4=2.71,a5=2.79,a6=2.82,a7=2.86 \begin{aligned} a_1&=2.56,\\ a_2&=2.61,\\ a_3&=2.65,\\ a_4&=2.71,\\ a_5&=2.79,\\ a_6&=2.82,\\ a_7&=2.86 \end{aligned}\text{。}现要将每个 aia_i 替换为整数近似值 AiA_i,其中 1i71\leq i\leq7,使各 AiA_i 之和也为 1919,并使“误差” Aiai|A_i-a_i| 的最大值 MM 尽可能小。对于这个最小的 MM,求 100M100M

The sum of the following seven numbers is exactly 19:19: a1=2.56,a2=2.61,a3=2.65,a4=2.71,a5=2.79,a6=2.82,a7=2.86. \begin{aligned} a_1&=2.56,\\ a_2&=2.61,\\ a_3&=2.65,\\ a_4&=2.71,\\ a_5&=2.79,\\ a_6&=2.82,\\ a_7&=2.86. \end{aligned} It is desired to replace each aia_i by an integer approximation Ai,A_i, 1i7,1\leq i\leq7, so that the sum of the AiA_i’s is also 1919 and so that M,M, the maximum of the “errors” Aiai,|A_i-a_i|, is as small as possible. For this minimum M,M, what is 100M?100M?

答案:61
知识点:估算最优化极端原理
难度评级:2160
小提示:

从七个 33 出发,整数和必须减少 22

Starting from seven 33’s, the integer sum must be reduced by 22

大提示:

为使最大误差最小,将最小的两个 aia_i 向下取整为 22

To minimize the worst error, round the two smallest aia_i’s down to 22

解答:

A1=A2=2A_1=A_2=2,且 A3==A7=3A_3=\cdots=A_7=3。它们的和为 1919,最大误差为 A2a2=0.61|A_2-a_2|=0.61

M<0.61M\lt0.61,则 A2,,A7A_2,\ldots,A_7 必须都等于 33,而 A1A_1 只能为 2233。因而它们的和至少为 2020,矛盾。所以最小值为 M=0.61M=0.61,且 100M=61100M=61

Choose A1=A2=2A_1=A_2=2 and A3==A7=3.A_3=\cdots=A_7=3. The sum is 19,19, and the largest error is A2a2=0.61.|A_2-a_2|=0.61.

If M<0.61,M\lt0.61, then A2,,A7A_2,\ldots,A_7 must all equal 3,3, and A1A_1 can only be 22 or 3.3. Their sum would therefore be at least 20,20, a contradiction. Thus the minimum is M=0.61,M=0.61, and 100M=61.100M=61.

← 第 7 题#7
完整试卷

其他年份的第 8 题