Difference between revisions of "2006 AIME I Problems/Problem 10"
m |
Fuzimiao2013 (talk | contribs) (Added the line) |
||
(18 intermediate revisions by 7 users not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Eight | + | Eight [[circle]]s of [[diameter]] 1 are packed in the first [[quadrant]] of the [[coordinate plane]] as shown. Let region <math> \mathcal{R} </math> be the union of the eight circular regions. Line <math> l, </math> with slope 3, divides <math> \mathcal{R} </math> into two regions of equal area. Line <math> l </math>'s equation can be expressed in the form <math> ax=by+c, </math> where <math> a, b, </math> and <math> c </math> are positive integers whose [[greatest common divisor]] is 1. Find <math> a^2+b^2+c^2. </math> |
+ | <asy> | ||
+ | size(150);defaultpen(linewidth(0.7)); | ||
+ | draw((6.5,0)--origin--(0,6.5), Arrows(5)); | ||
+ | int[] array={3,3,2}; | ||
+ | int i,j; | ||
+ | for(i=0; i<3; i=i+1) { | ||
+ | for(j=0; j<array[i]; j=j+1) { | ||
+ | draw(Circle((1+2*i,1+2*j),1)); | ||
+ | }} | ||
+ | label("x", (7,0)); | ||
+ | label("y", (0,7));</asy> | ||
+ | == Solutions == | ||
− | [[ | + | <asy> |
+ | size(150);defaultpen(linewidth(0.7)); | ||
+ | draw((6.5,0)--origin--(0,6.5), Arrows(5)); | ||
+ | int[] array={3,3,2}; | ||
+ | int i,j; | ||
+ | for(i=0; i<3; i=i+1) { | ||
+ | for(j=0; j<array[i]; j=j+1) { | ||
+ | draw(Circle((1+2*i,1+2*j),1)); | ||
+ | }} | ||
+ | label("x", (7,0)); | ||
+ | label("y", (0,7)); | ||
+ | draw((5/3,0)--(23/6,6.5),blue);</asy> | ||
+ | === Solution 1 === | ||
+ | The line passing through the [[tangent (geometry)|tangency point]] of the bottom left circle and the one to its right and through the tangency of the top circle in the middle column and the one beneath it is the line we are looking for: a line passing through the tangency of two circles cuts congruent areas, so our line cuts through the four aforementioned circles splitting into congruent areas, and there are an additional two circles on each side. The line passes through <math>\left(1,\frac 12\right)</math> and <math>\left(\frac 32,2\right)</math>, which can be easily solved to be <math>6x = 2y + 5</math>. Thus, <math>a^2 + b^2 + c^2 = \boxed{065}</math>. | ||
− | == Solution == | + | === Solution 2 === |
+ | Assume that if unit [[square]]s are drawn circumscribing the circles, then the line will divide the area of the [[concave]] hexagonal region of the squares equally (as of yet, there is no substantiation that such would work, and definitely will not work in general). Denote the intersection of the line and the [[x-axis]] as <math>(x, 0)</math>. | ||
− | {{ | + | The line divides the region into 2 sections. The left piece is a [[trapezoid]], with its area <math>\frac{1}{2}((x) + (x+1))(3) = 3x + \frac{3}{2}</math>. The right piece is the addition of a [[trapezoid]] and a [[rectangle]], and the areas are <math>\frac{1}{2}((1-x) + (2-x))(3)</math> and <math>2 \cdot 1 = 2</math>, totaling <math>\frac{13}{2} - 3x</math>. Since we want the two regions to be equal, we find that <math>3x + \frac 32 = \frac {13}2 - 3x</math>, so <math>x = \frac{5}{6}</math>. |
+ | We have that <math>\left(\frac 56, 0\right)</math> is a point on the line of slope 3, so <math>y - 0 = 3\left(x - \frac 56\right) \Longrightarrow 6x = 2y + 5</math>. Our answer is <math>2^2 + 5^2 + 6^2 = 65</math>. | ||
+ | |||
+ | We now assess the validity of our starting assumption. We can do that by seeing that our answer passes through the tangency of the two circles, cutting congruent areas, a result explored in solution 1. | ||
+ | |||
+ | |||
+ | === Solution 3=== | ||
+ | This problem looks daunting at a first glance, but we can make geometric inequality inferences by drawing lines that simplify the problem by removing sections of the total area. To begin, we can eliminate the possibility of the line intersecting the circle on the top left (call it circle A), or the circle on the bottom right (call it circle B). This is can be seen visually by drawing a line with slope 3 that is tangent to either of these circles. The area is clearly larger on one side; this can be proven by counting full circles. We can go on with the same mindset and eliminate the circle below circle A and the circle above circle B. By removing pairs of circles and proving the line will never intersect with them, we can safely work with whatever is remaining. By now you should have 4 circles making an L shape (waluigi style). Now the two biggest contenders for this method are the two circles on the bottom row. Using the same strategy, we can see that a line that goes through the tangent point of these two circles also goes through the tangent point of the other two circles. This clearly will cut the 4 circles into two regions of equal area. Using super advanced linear algebra we get: <math>6x = 2y + 5</math>. The answer is then <math>6^2 + 2^2 + 5^2 = \boxed{065}</math>. This solution is an alternate explanation to solution 1. | ||
+ | |||
+ | |||
+ | -jackshi2006 | ||
== See also == | == See also == | ||
Line 15: | Line 51: | ||
[[Category:Intermediate Geometry Problems]] | [[Category:Intermediate Geometry Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 17:59, 4 January 2022
Problem
Eight circles of diameter 1 are packed in the first quadrant of the coordinate plane as shown. Let region be the union of the eight circular regions. Line
with slope 3, divides
into two regions of equal area. Line
's equation can be expressed in the form
where
and
are positive integers whose greatest common divisor is 1. Find
Solutions
Solution 1
The line passing through the tangency point of the bottom left circle and the one to its right and through the tangency of the top circle in the middle column and the one beneath it is the line we are looking for: a line passing through the tangency of two circles cuts congruent areas, so our line cuts through the four aforementioned circles splitting into congruent areas, and there are an additional two circles on each side. The line passes through and
, which can be easily solved to be
. Thus,
.
Solution 2
Assume that if unit squares are drawn circumscribing the circles, then the line will divide the area of the concave hexagonal region of the squares equally (as of yet, there is no substantiation that such would work, and definitely will not work in general). Denote the intersection of the line and the x-axis as .
The line divides the region into 2 sections. The left piece is a trapezoid, with its area . The right piece is the addition of a trapezoid and a rectangle, and the areas are
and
, totaling
. Since we want the two regions to be equal, we find that
, so
.
We have that is a point on the line of slope 3, so
. Our answer is
.
We now assess the validity of our starting assumption. We can do that by seeing that our answer passes through the tangency of the two circles, cutting congruent areas, a result explored in solution 1.
Solution 3
This problem looks daunting at a first glance, but we can make geometric inequality inferences by drawing lines that simplify the problem by removing sections of the total area. To begin, we can eliminate the possibility of the line intersecting the circle on the top left (call it circle A), or the circle on the bottom right (call it circle B). This is can be seen visually by drawing a line with slope 3 that is tangent to either of these circles. The area is clearly larger on one side; this can be proven by counting full circles. We can go on with the same mindset and eliminate the circle below circle A and the circle above circle B. By removing pairs of circles and proving the line will never intersect with them, we can safely work with whatever is remaining. By now you should have 4 circles making an L shape (waluigi style). Now the two biggest contenders for this method are the two circles on the bottom row. Using the same strategy, we can see that a line that goes through the tangent point of these two circles also goes through the tangent point of the other two circles. This clearly will cut the 4 circles into two regions of equal area. Using super advanced linear algebra we get: . The answer is then
. This solution is an alternate explanation to solution 1.
-jackshi2006
See also
2006 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.