I need some help to prove this inequality:
$\ (1 + \frac{1}{a_n})^{a_n} \le (1 + \frac{1}{\lfloor{a_n}\rfloor})^{\lfloor{a_n}\rfloor + 1} $
where $\ n \in \mathbb{N} $ and$\ a_n \in \mathbb{R}$ with$\ a_n > 1 $ is any element of a sequence.
I need some help to prove this inequality:
$\ (1 + \frac{1}{a_n})^{a_n} \le (1 + \frac{1}{\lfloor{a_n}\rfloor})^{\lfloor{a_n}\rfloor + 1} $
where $\ n \in \mathbb{N} $ and$\ a_n \in \mathbb{R}$ with$\ a_n > 1 $ is any element of a sequence.
An Elementary Answer
Since $\lfloor x\rfloor+1\ge x$, we can use Bernoulli's Inequality: $$ \begin{align} \left(1+\frac1{\lfloor x\rfloor}\right)^{\lfloor x\rfloor+1} &=\left[\left(1+\frac1{\lfloor x\rfloor}\right)^{\large\frac{\lfloor x\rfloor+1}x}\right]^{\normalsize\,x}\\ &\ge\left(1+\frac{\lfloor x\rfloor+1}{\lfloor x\rfloor x}\right)^{\normalsize x}\\[9pt] &\ge\left(1+\frac1x\right)^x \end{align} $$ for $x\ge1$, so that $\frac1{\lfloor x\rfloor}$ exists.
Notes on Bernoulli's Inequality
At the end of this answer, Bernoulli's Inequality is proven for integer exponents using only induction.
At the end of this answer, the integer version is extended to the rational version using only induction.
The exercise ask to prove that also $(1+\frac{1}{a_n})^{a_n} $ converges to e. The exercise ask to use this inequality: $\ (1 + \frac{1}{a_n + 1})^{\lfloor a_n \rfloor } \le (1 + \frac{1}{a_n})^{a_n} \le (1 + \frac{1}{\lfloor{a_n}\rfloor})^{\lfloor{a_n}\rfloor + 1} $ to give a proof. – Stefano Balzarotti Dec 27 '16 at 17:29
I already proven with definition that both extremes of inequality converges to e. I was also able to prove that the first part of inequality is valid for any $\ a_n > 1 $, but I am unable to prove the second part of inequality.
– Stefano Balzarotti Dec 27 '16 at 17:38