In the proof by Denis Hanson (see Lemma 3), this is presented as obvious if $a \ge 2$ and $n > a$:
$$\left(1 + \dfrac{1}{(n-a+1)/(a-1)}\right)^{(n-a+1)/(a-1)} < e$$
where $e$ is Euler's constant which is approximately $2.72$
For me, this is not obvious so I thought I would detail the argument for why this is true.
Here's what I came up with (I understand that induction can be used for real numbers under certain circumstances):
Let $u = (n-a+1)/(a-1)$
Base Case: for $n=a$, then $u = \dfrac{1}{a-1}$
$\left(1 + \dfrac{1}{u}\right)^u = a^{\frac{1}{a-1}} < 2 < e$ since $\dfrac{\log a}{\log 2} \le a-1 $
Inductive Hypothesis: up to some $u \ge \dfrac{1}{a-1}$: $$\left(1 + \dfrac{1}{u}\right)^{u} < e$$
Inductive case: For $\epsilon > 0$:
$\dfrac{u+1}{u} > \dfrac{u+1+\epsilon}{u+\epsilon}$ since $(u+1)(u+\epsilon) = u^2 + u + u\epsilon + \epsilon > u^2 + u + u\epsilon = (u)(u+1+\epsilon)$
$\left(\dfrac{u+1}{u}\right)^u > \left(\dfrac{u+\epsilon+1}{u+\epsilon}\right)^u$
$\left(\dfrac{u+\epsilon+1}{u+\epsilon}\right)^{\epsilon} < 1$
Which gives us that:
$$\left(1 + \dfrac{1}{u+\epsilon}\right)^{u+\epsilon}< \left(1+\dfrac{1}{u}\right)^{u} < e$$
Is this argument valid? Is there a simpler way to establish Hanson's step?