For all \(k \in \mathbb{N}\), we have
\[ k! \le (\frac{k+1}{2})^k. \]This can be proven by induction an Bernoulli’s inequality.
Link Link to heading
- factorial
- \((tfrac{k}{e})^k \le k! \le k^k\) (see (0x68dcfef9) ).
For all \(k \in \mathbb{N}\), we have
\[ k! \le (\frac{k+1}{2})^k. \]This can be proven by induction an Bernoulli’s inequality.