Difference between revisions of "2000 AIME II Problems/Problem 6"
(solution) |
m (whoops) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | One base of a [[trapezoid]] is <math>100</math> units longer than the other base. The segment that joins the [[midpoint]]s of the legs divides the trapezoid into two regions whose areas are in the ratio <math>2: 3</math>. Let <math>x</math> be the length of the segment joining the legs of the trapezoid that is [[parallel]] to the bases and that divides the trapezoid into two regions of equal area. Find the greatest integer that does not exceed <math>x^2/100</math>. | + | One base of a [[trapezoid]] is <math>100</math> units longer than the other base. The segment that joins the [[midpoint]]s of the legs divides the trapezoid into two regions whose areas are in the ratio <math>2: 3</math>. Let <math>x</math> be the length of the segment joining the legs of the trapezoid that is [[parallel]] to the bases and that divides the trapezoid into two regions of equal area. Find the [[ceiling function|greatest integer]] that does not exceed <math>x^2/100</math>. |
== Solution == | == Solution == | ||
Let the shorter base have length <math>b</math> (so the longer has length <math>b+100</math>), and let the height be <math>h</math>. The length of the midline of the trapezoid is the average of its bases, which is <math>\frac{b+b+100}{2} = b+50</math>. The two regions which the midline divides the trapezoid into are two smaller trapezoids, both with height <math>h</math>. Then, | Let the shorter base have length <math>b</math> (so the longer has length <math>b+100</math>), and let the height be <math>h</math>. The length of the midline of the trapezoid is the average of its bases, which is <math>\frac{b+b+100}{2} = b+50</math>. The two regions which the midline divides the trapezoid into are two smaller trapezoids, both with height <math>h</math>. Then, | ||
− | |||
<center><asy>pathpen = linewidth(0.7); pen d = linetype("4 4") + linewidth(0.7); | <center><asy>pathpen = linewidth(0.7); pen d = linetype("4 4") + linewidth(0.7); | ||
pair A=(0,0),B=(175,0),C=(105,100),D=(30,100); | pair A=(0,0),B=(175,0),C=(105,100),D=(30,100); |
Revision as of 21:23, 29 August 2008
Problem
One base of a trapezoid is units longer than the other base. The segment that joins the midpoints of the legs divides the trapezoid into two regions whose areas are in the ratio . Let be the length of the segment joining the legs of the trapezoid that is parallel to the bases and that divides the trapezoid into two regions of equal area. Find the greatest integer that does not exceed .
Solution
Let the shorter base have length (so the longer has length ), and let the height be . The length of the midline of the trapezoid is the average of its bases, which is . The two regions which the midline divides the trapezoid into are two smaller trapezoids, both with height . Then,
We now construct the line which divides the rectangle into two regions of equal area. Suppose this line is a distance of from the shorter base. By similar triangles, we have . Indeed, construct the perpendiculars from the vertices of the shorter base to the longer base. This splits the trapezoid into a rectangle and two triangles; it also splits the desired line segment into three partitions with lengths . By similar triangles, we easily find that , as desired.
The area of the region including the shorter base must be half of the area of the entire trapezoid, so
Substituting our expression for from above, we find that
The answer is .
See also
2000 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |