1991 AIME Problems/Problem 15

Problem

For positive integer $n_{}^{}$ , define $S_n^{}$ to be the minimum value of the sum $\sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2},$ where $a_1,a_2,\ldots,a_n^{}$ are positive real numbers whose sum is 17. There is a unique positive integer $n^{}_{}$ for which $S_n^{}$ is also an integer. Find this $n^{}_{}$ .

Solution

We start by recalling the following simple inequality: Let $a_{}^{}$ and $b_{}^{}$ denote two real numbers, then $\sqrt{a_{}^{2}+b_{}^{2}}\geq (a+b)/\sqrt{2}$ , with equality if and only if $a_{}^{}=b_{}^{}$ (which can be easily found from the trivial fact that $(a_{}^{}-b)^{2}\geq0$ ). Applying this inequality to the given sum, one has

$\sum_{k=1}^{n}\sqrt{(2k-1)^{2}+a_{k}^{2}}\geq \frac{1}{\sqrt{2}}\sum_{k=1}^{n}[(2k-1)+a_{k}]=\frac{n^{2}+t}{\sqrt{2}}\, ,$

where we have used the well-known fact that $\sum_{k=1}^{n}(2k-1)=n^{2}$ , and we have defined $t=\sum_{k=1}^{n}a_{k}$ . Therefore, $S_{n}\geq(n^{2}+t)/\sqrt{2}$ . Now, in the present case, $t_{}^{}=17$ , and so it is clear that for $n_{}^{}=1$ , $S_{1}^{}$ does not exist as the sum equals $\sqrt{1+17^{2}}>17$ . This means that $n_{}^{}>1$ . Notice that for $n_{}^{}=3$ , $S_{3}^{}\geq(3^{2}+17)/\sqrt{2}>18$ . Is it possible for $n_{}^{}=2$ to have $S_{2}^{}=18$ ?

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

Page

Toolbox

Search

1991 AIME Problems/Problem 15

Problem

Solution

See also