Difference between revisions of "2007 AIME II Problems/Problem 8"

Revision as of 20:43, 29 March 2007

Problem

A rectangular piece of paper measures 4 units by 5 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 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000.

Solution

Solution 1

Denote the number of horizontal lines as $x$ , and the number of vertical lines as $y$ . The number of basic rectangles is $(x - 1)(y - 1)$ . $5x + 4y = 2007 \Longrightarrow y = \frac{2007 - 5x}{4}$ . Substituting, we find that $(x - 1)\left(-\frac 54x + \frac{2003}4\right)$ .

FOIL this to get a quadratic, $-\frac 54x^2 + 502x - \frac{2003}4$ . Use $\frac{-b}{2a}$ to find the maximum possible value of the quadratic: $x = \frac{-502}{-2 \cdot \frac 54} = \frac{1004}5 \approx 201$ . However, this gives a non-integral answer for $y$ . The closest two values that work are $(199,253)$ and $(203,248)$ .

We see that $252 \cdot 198 = 49896 > 202 \cdot 247 = 49894$ . The solution is $896$ .

Solution 2

We realize that drawing x vertical lines and y horizontal lines, the number of basic rectangles we have is $(x-1)(y-1)$ . The easiest possible case to see is 223 vertical and 223 horizontal lines as (4+5)223 = 2007. Now, for every 4 vertical lines you take away, you can add 5 horizontal lines, so you basically have the equation $(222-4x)(222+5x)$ which you want to maximize. Expanded, this gives $-20x^{2}+222x+222^{2}$ . From $-\frac{b}{2a}$ you get that the vertex is at $x=\frac{111}{20}$ . This is not an integer though, so you see that when x=5, you have $-20*25+222*5+222^{2}$ and that when x=6, you have $-20*36+222*6+222^{2}$ . 222 is greater than -20*11, so the maximum integral value for x occurs when $x=6$ . Now you just evaluate $-20*36+222*6+222^{2}\mod 1000$ which is ${896}$ .

@@ Line 7: / Line 7: @@
 Given that the total length of all lines drawn is exactly 2007 units, let <math>N</math> be the maximum possible number of basic rectangles determined. Find the [[remainder]] when <math>N</math> is divided by 1000.
+__TOC__
 == Solution ==
+=== Solution 1 ===
 Denote the number of horizontal lines as <math>x</math>, and the number of vertical lines as <math>y</math>. The number of basic rectangles is <math>(x - 1)(y - 1)</math>. <math>5x + 4y = 2007 \Longrightarrow y = \frac{2007 - 5x}{4}</math>. Substituting, we find that <math>(x - 1)\left(-\frac 54x + \frac{2003}4\right)</math>.
@@ Line 13: / Line 15: @@
 We see that <math>252 \cdot 198 = 49896 > 202 \cdot 247 = 49894</math>. The solution is <math>896</math>.
+=== Solution 2 ===
+We realize that drawing x vertical lines and y horizontal lines, the number of basic rectangles we have is <math>(x-1)(y-1)</math>. The easiest possible case to see is 223 vertical and 223 horizontal lines  as (4+5)223 = 2007. Now, for every 4 vertical lines you take away, you can add 5 horizontal lines, so you basically have the equation <math>(222-4x)(222+5x)</math> which you want to maximize. Expanded, this gives <math>-20x^{2}+222x+222^{2}</math>. From <math>-\frac{b}{2a}</math> you get that the vertex is at <math>x=\frac{111}{20}</math>. This is not an integer though, so you see that when x=5, you have <math>-20*25+222*5+222^{2}</math> and that when x=6, you have <math>-20*36+222*6+222^{2}</math>. 222 is greater than -20*11, so the maximum integral value for x occurs when <math>x=6</math>. Now you just evaluate <math>-20*36+222*6+222^{2}\mod 1000</math> which is <math>{896}</math>.
 == See also ==
-{{AIME box|year=2007|n=II|num-b=1|num-a=3}}
+{{AIME box|year=2007|n=II|num-b=7|num-a=9}}
 [[Category:Intermediate Algebra Problems]]

2007 AIME II (Problems • Answer Key • Resources)
Preceded by Problem 7	Followed by Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search