Difference between revisions of "2000 AIME I Problems/Problem 4"
Danielguo94 (talk | contribs) (→Solution) |
Danielguo94 (talk | contribs) (→Solution) |
||
Line 13: | Line 13: | ||
The picture shows that: | The picture shows that: | ||
− | < | + | <cmath>\begin{eqnarray*} |
a_1+a_2 &=& a_3\ | a_1+a_2 &=& a_3\ | ||
a_1 + a_3 &=& a_4\ | a_1 + a_3 &=& a_4\ | ||
Line 21: | Line 21: | ||
a_2 + a_7 &=& a_8\ | a_2 + a_7 &=& a_8\ | ||
a_1 + a_4 + a_6 &=& a_9\ | a_1 + a_4 + a_6 &=& a_9\ | ||
− | a_6 + a_9 &=& a_7 + a_8\ | + | a_6 + a_9 &=& a_7 + a_8\end{eqnarray*}</cmath> |
With a bit of trial and error and some arithmetic, we can use the last equation to find that <math>5a_1 = 2a_2</math>; [[without loss of generality]], let <math>a_1 = 2</math>. Then solving gives <math>a_9 = 36</math>, <math>a_6=25</math>, <math>a_8 = 33</math>, which gives us <math>l=61,w=69</math> (relatively prime), and the perimeter is <math>2(61)+2(69)=\boxed{260}</math>. | With a bit of trial and error and some arithmetic, we can use the last equation to find that <math>5a_1 = 2a_2</math>; [[without loss of generality]], let <math>a_1 = 2</math>. Then solving gives <math>a_9 = 36</math>, <math>a_6=25</math>, <math>a_8 = 33</math>, which gives us <math>l=61,w=69</math> (relatively prime), and the perimeter is <math>2(61)+2(69)=\boxed{260}</math>. |
Revision as of 23:23, 24 March 2011
Problem
The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle.
Solution
Call the squares' side lengths from smallest to largest , and let represent the dimensions of the rectangle.
The picture shows that:
With a bit of trial and error and some arithmetic, we can use the last equation to find that ; without loss of generality, let . Then solving gives , , , which gives us (relatively prime), and the perimeter is .
See also
2000 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |