If the series {$a_n$} is defined recursively in the following way:
- $a_1 = 1$,
- $a_k = \sum\limits_{i=1}^{k-1}a_i\cdot\left(\frac{1}{k-i}-\frac{1}{k-i+1}\right)$ for $k=2,\cdots, n$,
how can I prove that $a_k$ is decreasing?
If the series {$a_n$} is defined recursively in the following way:
how can I prove that $a_k$ is decreasing?
Copyright © 2021 JogjaFile Inc.
Let $F(x) = \sum_{k=1}^\infty a_k x^k$ for $x \in (-1,1)$ (convergence is clear).
Claim: We have $F(x) = \frac{x}{(1-x^{-1})\log(1-x)}$ for $x \in (-1,1)$.
Now, since $(1-x^{-1})F(x) = -1+\sum_{k=1}^\infty (a_k-a_{k+1})x^k$, we see $\frac{x}{\log(1-x)} = -1+\sum_{k=1}^\infty (a_k-a_{k+1})x^k$ for $x \in (-1,1)$. Changing $x \mapsto -x$, we have, for $x \in (-1,1)$, $$\frac{x}{\log(1+x)} = 1-\sum_{k=1}^\infty (-1)^k(a_k-a_{k+1})x^k.$$ We wish to prove $(-1)^k \frac{\partial^k}{\partial x^k}\left[\frac{x}{\log(1+x)}\right]\Big|_{x=0} \le 0$ for all $k \ge 0$. It then suffices to show $(-1)^k \frac{\partial^k}{\partial x^k}\left[\frac{x}{\log(1+x)}\right] \le 0$ on all of $[0,\infty)$, i.e., that $\frac{x}{\log(1+x)}$ is a Bernstein function. But this follows from the fact that $\log(1+x)$ is a complete Bernstein function together with the general result that $x/f(x)$ is a (complete) Bernstein function if $f(x)$ is.