If $a_1,a_2,a_3,\cdots,a_n$ are positive real numbers whose product is a fixed number $c$, then the minimum value of $a_1+a_2+a_3+\cdots+a_{n-1}+2a_n$ is
(A) $n(2c)^{1/n}$
(B) $(n+1)c^{1/n}$
(C) $2nc^{1/n}$
(D) $(n+1)(2c)^{1/n}$

My Approch:
$AM \geq GM $
For minimum value,

But the question asks for $a_1+a_2+a_3+\cdots+a_{n-1}+2a_n$.
The closest approximation would be to consider $a_n=GM$. But that wouldn't give you the accurate answer. How do you solve this question then?


Put in $b_n=2a_n$. Then you are tp minimize $a_1+a_2+...+a_{n-1}+b_n$ given the product of those terms $a_1·a_2·...·a_{n-1}·b_n$ being equal to $2c$, and no coefficients in the terms other than $1$. You apparently know how to solve this, and the answer follows.

| cite | improve this answer | |
  • $\begingroup$ Why would the product of those terms equal 2c? $\endgroup$ – oshhh Nov 25 '16 at 3:11
  • $\begingroup$ What is the product with the last factor mase equal to $b_n =2a_n$, if it's $c$ with the last factor being $a_n$? $\endgroup$ – Oscar Lanzi Nov 25 '16 at 3:14
  • $\begingroup$ Oh right! I was thinking that c stands for the product of double of all the terms :P $\endgroup$ – oshhh Nov 25 '16 at 3:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.