0
$\begingroup$

Let $k \geq 6$ and I know $k!$ < $\dfrac{k^k}{2^k}$ I want to show the following:

$(k+1)! < \dfrac{(k+1)^{k+1}}{2^{k+1}}$

Now I am going to show my solution, let me know if my reasoning is correct as well.

Simplifying what we have above we get: $(k+1)k!$ < $\dfrac{(k+1)(k+1)^k}{2^{k+1}}$

Now divide $(k+1)$ from both sides: $k!$ < $\dfrac{(k+1)^k}{2^{k+1}}$

Next, factor out a k from the right side: $k!$ < $\dfrac{k^k(1+ \frac{1}{k})^k}{2^{k+1}}$

Now we know $\lim_{k\to\infty}$ $(1+ \frac{1}{k})^k$ is $e$ so we can write:

$k!$ < $\dfrac{k^ke}{2^{k+1}}$ $\iff$ $k!$ < $\dfrac{k^ke}{2\cdot2^k}$

This is also equivalent to: $k!$ < $\dfrac{k^k}{2^k}$ $\cdot$ $\dfrac{e}{2}$

Since I know $k!$ < $\dfrac{k^k}{2^k}$ (from an induction hypothesis) and I am multiplying by $\dfrac{e}{2}$ which is > $1$ the inequality holds. End of Proof.

The step I am most unsure of is setting the $(1+ \frac{1}{k})^k$ to $e$. Can I do this?

  • 0
    Sorry, typo. For $k\ge 2$, $(1+x)^k\ge 1+kx+\frac{k(k-1)}{2}x^2$. (Shouldn't try to type math in comments.) Put $x=1/k$. The first two terms give 1+k(1/k)=2$, the next adds to it. Actually, you only need $\ge 2$, so $x^2$ term not needed.2012-09-21

1 Answers 1

1

You can use the inequality $ \left(1 + \frac{1}{n}\right)^n < e < \left(1 + \frac{1}{n}\right)^{n+1}. $ (This can be proved using the Taylor series of $\log$.)