Difference between revisions of "1991 AIME Problems/Problem 15"
Gabiloncho (talk | contribs) (→Solution) |
Jinzhenqian (talk | contribs) (→Solution 4 (Vector)) |
||
(14 intermediate revisions by 8 users not shown) | |||
Line 4: | Line 4: | ||
where <math>a_1,a_2,\ldots,a_n^{}</math> are positive real numbers whose sum is 17. There is a unique positive integer <math>n^{}_{}</math> for which <math>S_n^{}</math> is also an integer. Find this <math>n^{}_{}</math>. | where <math>a_1,a_2,\ldots,a_n^{}</math> are positive real numbers whose sum is 17. There is a unique positive integer <math>n^{}_{}</math> for which <math>S_n^{}</math> is also an integer. Find this <math>n^{}_{}</math>. | ||
− | + | __TOC__ | |
− | |||
− | <math> | + | == Solution 1 (Geometric Interpretation)== |
− | \sum_{k=1}^ | + | Consider <math>n</math> right triangles joined at their vertices, with bases <math>a_1,a_2,\ldots,a_n</math> and heights <math>1,3,\ldots, 2n - 1</math>. The sum of their hypotenuses is the value of <math>S_n</math>. The minimum value of <math>S_n</math>, then, is the length of the straight line connecting the bottom vertex of the first right triangle and the top vertex of the last right triangle, so |
− | </math> | + | <cmath> |
+ | S_n \ge \sqrt {\left(\sum_{k = 1}^n (2k - 1)\right)^2 + \left(\sum_{k = 1}^n a_k\right)^2}. | ||
+ | </cmath> | ||
+ | Since the sum of the first <math>n</math> odd integers is <math>n^2</math> and the sum of <math>a_1,a_2,\ldots,a_n</math> is 17, we get | ||
+ | <cmath> | ||
+ | S_n \ge \sqrt {17^2 + n^4}. | ||
+ | </cmath> | ||
+ | If this is an integer, we can write <math>17^2 + n^4 = m^2</math>, for an integer <math>m</math>. Thus, <math>(m - n^2)(m + n^2) = 289\cdot 1 = 17\cdot 17 = 1\cdot 289.</math> The only possible value, then, for <math>m</math> is <math>145</math>, in which case <math>n^2 = 144</math>, and <math>n = \boxed {012}</math>. | ||
− | + | == Solution 2 == | |
+ | The inequality | ||
+ | <cmath> | ||
+ | S_n \ge \sqrt {\left(\sum_{k = 1}^n (2k - 1)\right)^2 + \left(\sum_{k = 1}^n a_k\right)^2}. | ||
+ | </cmath> | ||
+ | is a direct result of the [[Minkowski Inequality]]. Continue as above. | ||
− | + | == Solution 3 == | |
+ | Let <math>a_{i} = (2i - 1) \tan{\theta_{i}}</math> for <math>1 \le i \le n</math> and <math>0 \le \theta_{i} < \frac {\pi}{2}</math>. We then have that | ||
+ | <cmath> | ||
+ | S_{n} = \sum_{k = 1}^{n}\sqrt {(2k - 1)^{2} + a_{k}^{2}} = \sum_{k = 1}^{n}(2k - 1) \sec{\theta_{k}} | ||
+ | </cmath> | ||
+ | Note that that <math>S_{n} + 17 = \sum_{k = 1}^{n}(2k - 1)(\sec{\theta_{k}} + \tan{\theta_{k}})</math>. | ||
+ | Note that for any angle <math>\theta</math>, it is true that <math>\sec{\theta} + \tan{\theta}</math> and <math>\sec{\theta} - \tan{\theta}</math> are reciprocals. We thus have that <math>S_{n} - 17 = \sum_{k = 1}^{n}(2k - 1)(\sec{\theta_{k}} - \tan{\theta_{k}}) = \sum_{k = 1}^{n}\frac {2k - 1}{\sec{\theta_{k}} + \tan{\theta_{k}}}</math>. By the AM-HM inequality on these <math>n^{2}</math> values, we have that: | ||
+ | <cmath> | ||
+ | \frac {S_{n} + 17}{n^{2}}\ge \frac {n^{2}}{S_{n} - 17}\rightarrow S_{n}^{2}\ge 289 + n^{4} | ||
+ | </cmath> | ||
+ | This is thus the minimum value, with equality when all the tangents are equal. The only value for which <math>\sqrt {289 + n^{4}}</math> is an integer is <math>n = 12</math> (see above solutions for details). | ||
+ | |||
+ | == Solution 4 (Vector) == | ||
+ | Observe the sum and apply it to the Cartesian plane, we can see that it is basically calculating distance between the origin and two points. Therefore we can assume every <math>\sqrt{(2k-1)^2+a_k^2}</math> to be a vector from the origin to point <math>(2k-1, a_k)</math>. | ||
+ | Now we can do sum inside the vector so we get <math>((1+3+5+\ldots+2k-1, a_1+a_2+a_3+\ldots+a_k)</math>, with <math>a_1+\ldots+a_k</math> to be <math>17</math> and <math>1+3+\ldots+2k-1</math> to be <math>k^2</math>. Then we calculate the length of the vector to be <math>\sqrt{k^4+289}</math>. Since the sum needs to be an integer, we assume <math>k^4+289</math> equals to <math>s^2</math>. Applying difference between squares, we get that <math>k^2-s=289</math> and <math>k^2+s=-1</math>. Therfore <math>2k^2</math> is <math>288</math> and <math>k=n=12</math> to be the final answer. | ||
+ | |||
+ | ----JINZHENQIAN | ||
== See also == | == See also == | ||
{{AIME box|year=1991|num-b=14|after=Last question}} | {{AIME box|year=1991|num-b=14|after=Last question}} | ||
+ | |||
+ | [[Category:Intermediate Algebra Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 16:58, 10 November 2023
Problem
For positive integer , define to be the minimum value of the sum where are positive real numbers whose sum is 17. There is a unique positive integer for which is also an integer. Find this .
Contents
Solution 1 (Geometric Interpretation)
Consider right triangles joined at their vertices, with bases and heights . The sum of their hypotenuses is the value of . The minimum value of , then, is the length of the straight line connecting the bottom vertex of the first right triangle and the top vertex of the last right triangle, so Since the sum of the first odd integers is and the sum of is 17, we get If this is an integer, we can write , for an integer . Thus, The only possible value, then, for is , in which case , and .
Solution 2
The inequality is a direct result of the Minkowski Inequality. Continue as above.
Solution 3
Let for and . We then have that Note that that . Note that for any angle , it is true that and are reciprocals. We thus have that . By the AM-HM inequality on these values, we have that: This is thus the minimum value, with equality when all the tangents are equal. The only value for which is an integer is (see above solutions for details).
Solution 4 (Vector)
Observe the sum and apply it to the Cartesian plane, we can see that it is basically calculating distance between the origin and two points. Therefore we can assume every to be a vector from the origin to point . Now we can do sum inside the vector so we get , with to be and to be . Then we calculate the length of the vector to be . Since the sum needs to be an integer, we assume equals to . Applying difference between squares, we get that and . Therfore is and to be the final answer.
JINZHENQIAN
See also
1991 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last question | |
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.