How can I prove this by mathematical induction

65 Views Asked by At

$n!>n^{n/2}$. For every positive integer greater than $2$

1

There are 1 best solutions below

0
On

Start with $$n^{\frac{n}{2}} <n!$$ multiply by $n+1$ to get $$(n+1)n^{\frac{n}{2}} <(n+1)!$$

we now would like to show that

$$(n+1)^{\frac{n+1}{2}} \leq (n+1)n^{\frac{n}{2}} $$ If we square this and rearrange we get

$$\left(1+\frac{1}{n}\right)^n\leq n+1$$ However $\left(1+\frac{1}{n}\right)^n\leq e<3$ is well known.