AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's NEW Intermediate Counting & Probability by David Patrick.
Personal tools

1991 AIME Problems/Problem 15

From AoPSWiki

Problem

For positive integer , define to be the minimum value of the sum \sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2}, 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

Solution 1

Interpret the problem geometrically. 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 S_n \ge \sqrt {\left(\sum_{k = 1}^n (2k - 1)\right)^2 + \left(\sum_{k = 1}^n a_k\right)^2}. Since the sum of the first odd integers is and the sum of is 17, we get If this is integer, we can write , for an integer . Thus, (m - n^2)(m + n^2) = 289\cdot 1 = 17\cdot 17 = 1\cdot 289. The only possible value, then, for is , in which case , and .

Solution 2

The inequality S_n \ge \sqrt {\left(\sum_{k = 1}^n (2k - 1)\right)^2 + \left(\sum_{k = 1}^n a_k\right)^2}. is a direct result of the Minkowski Inequality. Continue as above.

Solution 3

Let a_{i} = (2i - 1) \tan{\theta_{i}} for and 0 \le \theta_{i} < \frac {\pi}{2}. We then have that S_{n} = \sum_{k = 1}^{n}\sqrt {(2k - 1)^{2} + a_{k}^{2}} = \sum_{k = 1}^{n}(2k - 1) \sec{\theta_{k}} Note that that S_{n} + 17 = \sum_{k = 1}^{n}(2k - 1)(\sec{\theta_{k}} + \tan{\theta_{k}}). Note that for any angle , it is true that and are reciprocals. We thus have that 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}}}. By the AM-HM inequality on these values, we have that: \frac {S_{n} + 17}{n^{2}}\ge \frac {n^{2}}{S_{n} - 17}\rightarrow S_{n}^{2}\ge 289 + n^{4} 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).

See also

1991 AIME (ProblemsResources)
Preceded by
Problem 14
Followed by
Last question
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us