# Prove $2n-1 \leq n!$ is true using mathematical induction

Prove the statement is true using mathematical induction: $$2n-1 \leq n!$$

My attempt: this is true for $n=1$.

Suppose it is true for $n$, i.e., $2n-1 \leq n!$

Now, $2n-1 \leq n!\implies 2n-1+2 \leq n!+2$

From here, how do I proceed?

• Hint: $(n + 1)! = (n + 1) \cdot n!$ – iamwhoiam Sep 7 '17 at 3:18
• $(n+1)!-n!=n.n!>2n!>2$ – Nosrati Sep 7 '17 at 3:19

$$\forall n\geq2, \ (n+1)!=n!(n+1)\geq(2n-1)(n+1)\geq2n+1$$
but for $n=2$ our statement is false, which says that $\ \forall n\geq 3, \ n!\geq2n-1$.
• And $2n + 1 > 2n - 1$ – Mr Pie Sep 7 '17 at 3:22
for $n+1$ we get $2(n+1)-1=2n+1=2n-1+3 \le n!+3\le n!(n+1)$, which is true for $n \ge 2$