2007 AIME II 第 8 题

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

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

8.

一张长方形纸片的尺寸为 44 单位乘 55 单位。若干条线段被画出,并且都平行于纸片的边。 由其中一些线段的交点确定的长方形称为基本长方形,如果 (i) 该长方形的四条边都是所画线段的一部分, 且 (ii) 没有所画线段的任何一段位于该长方形内部。

已知所有画出的线段总长度恰好为 20072007 个单位。令 NN 为能确定的基本长方形个数的最大可能值。 求 NN 除以 10001000 的余数。

A rectangular piece of paper measures 44 units by 55 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called basic if (i) all four sides of the rectangle are segments of drawn line segments, and (ii) no segments of drawn lines lie inside the rectangle.

Given that the total length of all lines drawn is exactly 20072007 units, let NN be the maximum possible number of basic rectangles determined. Find the remainder when NN is divided by 1000.1000.

答案:896
知识点:最优化二次方程模运算
难度评级:2840
解答:

设画出的线段中有 hh 条长度为 44,有 vv 条长度为 55,则 4h+5v=20074h + 5v = 2007。一个基本长方形由每个方向上的两条相邻线段围成,所以这些线段确定 (h1)(v1)(h - 1)(v - 1) 个基本长方形。令 x=h1x = h - 1y=v1y = v - 1,我们要在 4x+5y=19984x + 5y = 1998 的条件下最大化 xyxy

作为 xx 的函数,乘积 xy=x19984x5xy = x \cdot \frac{1998 - 4x}{5} 是开口向下的抛物线,顶点在 x=9994=249.75x = \frac{999}{4} = 249.75。为了使 yy 为整数,需要 4x1998(mod5)4x \equiv 1998 \pmod 5,即 x2(mod5)x \equiv 2 \pmod 5。最近的候选是 x=247x = 247(此时 y=202y = 202,乘积 4989449894)和 x=252x = 252(此时 y=198y = 198,乘积 4989649896)。

因此 N=49896N = 49896, 除以 10001000 的余数为 896896

Suppose hh of the drawn lines have length 44 and vv have length 5,5, so 4h+5v=2007.4h + 5v = 2007. A basic rectangle is bounded by two adjacent lines in each direction, so the lines determine (h1)(v1)(h - 1)(v - 1) basic rectangles. Setting x=h1x = h - 1 and y=v1,y = v - 1, we must maximize xyxy subject to 4x+5y=1998.4x + 5y = 1998.

As a function of x,x, the product xy=x19984x5xy = x \cdot \frac{1998 - 4x}{5} is a downward parabola with vertex at x=9994=249.75.x = \frac{999}{4} = 249.75. For yy to be an integer we need 4x1998(mod5),4x \equiv 1998 \pmod 5, i.e. x2(mod5).x \equiv 2 \pmod 5. The nearest candidates are x=247x = 247 (giving y=202y = 202 and product 4989449894) and x=252x = 252 (giving y=198y = 198 and product 4989649896).

So N=49896,N = 49896, and the remainder upon division by 10001000 is 896.896.

← 第 7 题#7
完整试卷

其他年份的第 8 题