Cómo encontrar a $1+\dfrac{1}{a_{1}}+\dfrac{1}{a_{2}}+\cdots+\dfrac{1}{a_{n}}$

Question

Deje $a_{i}>0,i=1,2,\cdots,n$,

Si $$1+\dfrac{1}{a_{1}}+\dfrac{1}{a_{2}}+\cdots+\dfrac{1}{a_{n}}\ge k\;\left(\dfrac{1}{\sqrt{1+a^2_{1}}}+\dfrac{1}{\sqrt{1+a^2_{1}+a^2_{2}}}+\cdots+\dfrac{1}{\sqrt{1+a^2_{1}+\cdots+a^2_{n}}}\right)$$

a continuación, encuentre el valor máximo de $k$

Mi idea era usar

$$\left(\sum_{i=1}^{n}\dfrac{1}{\sqrt{1+a^2_{1}+a^2_{2}+\cdots+a^2_{i}}}\right)^2\le\left[\sum_{i=1}^{n}\dfrac{a_{i}}{1+a^2_{1}+a^2_{2}+\cdots+a^2_{i}}\right]\left(\sum_{i=1}^{n}\dfrac{1}{a_{i}}\right)$$ y el uso de los enfoques discutidos aquí: http://www.artofproblemsolving.com/Forum/viewtopic.php?p=119163&sid=cd139cff36102a55e4f91a7c8dcd4f21#p119163

Ay! No he logrado averiguar cómo hacerlo.

Answer 1

Sustituyendo $a_i=\sqrt{2}^{i-1}$ da

\begin{align} 1+\frac{1-\frac{1}{\sqrt{2}^n}}{1-\frac{1}{\sqrt{2}}}=1+\sum_{i=1}^{n}{(\frac{1}{\sqrt{2}})^{i-1}}=1+\sum_{i=1}^{n}{\frac{1}{a_i}} & \geq k\left(\sum_{i=1}^{n}{\frac{1}{\sqrt{1+\sum_{j=1}^{i}{a_j^2}}}}\right)\\ & =k\left(\sum_{i=1}^{n}{\frac{1}{\sqrt{1+\sum_{j=1}^{i}{2^{j-1}}}}}\right) \\ & =k\left(\sum_{i=1}^{n}{\frac{1}{\sqrt{2^i}}}\right) \\ & =k\frac{1}{\sqrt{2}}\frac{1-\frac{1}{\sqrt{2}^n}}{1-\frac{1}{\sqrt{2}}} \end{align}

Así \begin{align} k \leq \frac{1+\frac{1-\frac{1}{\sqrt{2}^n}}{1-\frac{1}{\sqrt{2}}}}{\frac{1}{\sqrt{2}}\frac{1-\frac{1}{\sqrt{2}^n}}{1-\frac{1}{\sqrt{2}}}}=\sqrt{2}+\frac{1}{\frac{1}{\sqrt{2}}\frac{1-\frac{1}{\sqrt{2}^n}}{1-\frac{1}{\sqrt{2}}}}=\sqrt{2}+\frac{\sqrt{2}-1}{1-\frac{1}{\sqrt{2}^n}} \end{align}

Ya que esta debe mantener para todos los $n$,$k \leq 2\sqrt{2}-1$. Vamos a demostrar que $k=2\sqrt{2}-1$ obras, de modo que $2 \sqrt{2}-1$ es el valor máximo de $k$. En otras palabras, vamos a mostrar que

$$1+\sum_{i=1}^{n}{\frac{1}{a_i}} \geq (2\sqrt{2}-1)\left(\sum_{i=1}^{n}{\frac{1}{\sqrt{1+\sum_{j=1}^{i}{a_j^2}}}}\right)$$

Por Cauchy Schwarz desigualdad tenemos

$$\sqrt{2}^i\sqrt{1+\sum_{j=1}^{i}{a_j^2}}=\sqrt{1+\sum_{j=1}^{i}{a_j^2}}\sqrt{1+\sum_{j=1}^{i}{2^{j-1}}} \geq 1+\sum_{j=1}^{i}{\sqrt{2}^{j-1}a_j}$$

Por ponderados AM-HM inequidad que tenemos

$$\frac{1+\sum_{j=1}^{i}{\sqrt{2}^{j-1}a_j}}{2^i}=\frac{1+\sum_{j=1}^{i}{2^{j-1}\frac{a_j}{\sqrt{2}^{j-1}}}}{1+\sum_{j=1}^{i}{2^{j-1}}} \geq \frac{1+\sum_{j=1}^{i}{2^{j-1}}}{1+\sum_{j=1}^{i}{2^{j-1}\frac{\sqrt{2}^{j-1}}{a_j}}}=\frac{2^i}{1+\sum_{j=1}^{i}{\frac{(2\sqrt{2})^{j-1}}{a_j}}}$$

Así

\begin{align} \sum_{i=1}^{n}{\frac{1}{\sqrt{1+\sum_{j=1}^{i}{a_j^2}}}} \leq \sum_{i=1}^{n}{\frac{\sqrt{2}^i}{1+\sum_{j=1}^{i}{\sqrt{2}^{j-1}a_j}}} & \leq \sum_{i=1}^{n}{\frac{1+\sum_{j=1}^{i}{\frac{(2\sqrt{2})^{j-1}}{a_j}}}{(2\sqrt{2})^i}} \\ &=\sum_{i=1}^{n}{\frac{1}{(2\sqrt{2})^i}}+\sum_{j=1}^{n}{\frac{(2\sqrt{2})^{j-1}}{a_j}\sum_{i=j}^{n}{\frac{1}{(2\sqrt{2})^i}}} \\ &=\sum_{i=1}^{n}{\frac{1}{(2\sqrt{2})^i}}+\sum_{j=1}^{n}{\frac{1}{a_j}\sum_{i=1}^{n-j+1}{\frac{1}{(2\sqrt{2})^i}}} \\ & \leq \sum_{i=1}^{\infty}{\frac{1}{(2\sqrt{2})^i}}+\sum_{j=1}^{n}{\frac{1}{a_j}\sum_{i=1}^{\infty}{\frac{1}{(2\sqrt{2})^i}}} \\ &=\frac{1}{2\sqrt{2}-1}(1+\sum_{i=1}^{n}{\frac{1}{a_i}}) \end{align}

Answer 2

Vamos a reducir las declaraciones:

$$(1):\qquad 1+\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n} \quad=\quad 1+\sum_{i = 1}^{n}\frac{1}{a_i}$$

$$(2):\qquad k\left( \frac{1}{\sqrt{1+{a_1}^2}}+...+\frac{1}{\sqrt{1+{a_1}^2+...+{a_n}^2}} \right) \quad=\quad k\left ( \sum_{i=1}^{n} \frac{1}{\sqrt{(1+\left( \sum_{j = 1}^{i}{{a_j}^2}\right )}}\right )$$

Ahora, con una mayor reducción, un aviso, como $(2)$ implica:

$$(3):\qquad k\left ( \sum_{i=1}^{n} \frac{1}{\sqrt{(1+\left( \sum_{j = 1}^{i}{{a_j}^2}\right )}}\right ) = \frac{k}{1-k}$$

y:

$$(4):\qquad 1+\sum_{i = 1}^{n}\frac{1}{a_i}\ge\frac{k}{1-k} \Rightarrow$$ $$(5):\qquad 1+\sum_{i = 1}^{n}\frac{1}{a_i} + \frac{k}{k-1}\ge0$$

Así tenemos:

$$(6):\qquad 1+\sum_{i = 1}^{n}\frac{1}{a_i} \ge k\left ( \sum_{i=1}^{n} \frac{1}{\sqrt{(1+\left( \sum_{j = 1}^{i}{{a_j}^2}\right )}}\right ) \Rightarrow$$ $$1+\sum_{i = 1}^{n}\frac{1}{a_i} + \frac{k}{k-1}\ge0$$