1
$\begingroup$

Let $a_1,a_2,\ldots,a_n$ be positive such that $a_1+a_2+\cdots+a_n < 1$. Prove that $$\dfrac{a_1a_2\cdots a_n(1-a_1-a_2-\cdots-a_n)}{(a_1+a_2+\cdots+a_n)(1-a_1)\cdots(1-a_n)} \leq \dfrac{1}{n^{n+1}}.$$

Attempt

I think I would have to prove this by induction, but I am unsure how to prove the induction. Proving the base case would just be $\dfrac{a_1(1-a_1)}{a_1(1-a_1)} = 1 \leq \dfrac{1}{1}$. For the inductive hypothesis I would assume $\dfrac{a_1a_2\cdots a_k(1-a_1-a_2-\cdots-a_k)}{(a_1+a_2+\cdots+a_k)(1-a_1)\cdots(1-a_k)} \leq \dfrac{1}{k^{k+1}}$ holds for some $k$. Then I would have to show it holds true for the $k+1$ case. How would I do that?

$\endgroup$
0
$\begingroup$

Let $a_0:=1-\sum_{i=1}^n\,a_i$. Then, the inequality is equivalent to $$\prod_{i=0}^n\,\frac{a_i}{\sum_{j\in\{0,1,2,\ldots,n\}\setminus\{i\}}\,a_j} \leq \frac{1}{n^{n+1}}\,.$$ This is an easy AM-GM exercise.

Further hint, apply AM-GM to the denominator $\sum_{j\in\{0,1,2,\ldots,n\}\setminus\{i\}}\,a_j$ for $i=0,1,2,\ldots,n$.

$\endgroup$

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.