SOLUTION: Prove that (n+1)! >2 n for all n>1.

SOLUTION: Prove that (n+1)! >2 n for all n>1.

Algebra.Com

Question 1052627: Prove that (n+1)2 n for all n>1.

Answer by rothauserc(4718) (Show Source): You can put this solution on YOUR website!
if n = k+1 (k > 1), we have that
:
(k+1) 2(k+1)
:
we have to prove that
:
(k+2) 2(k+2)
:
(k+2)! = (k+2)(k+1) (k+2)2(k+1) (since (k+1) 2(k+1))
:
this implies that
:
(k+2) 2(k+2)
RELATED QUESTIONS
Prove that for all positive integers n,... (answered by Edwin McCravy)

prove that : n! (n+2) = n! +... (answered by tommyt3rd)

prove that: 1+2+3+....+n =... (answered by ikleyn)

use mathematical induction to prove that 1^2 + 2^2 + 3^2 +...+ n^2 = n(n+1)(2n+1)/6... (answered by solver91311)

Pls help USE MATHEMATICAL INDUCTION TO PROVE THAT (n+1)^n < 2n^2 for all natural... (answered by ikleyn)

Prove 1 + 2^n < 3^n for n... (answered by checkley77)

Prove that 2C(2n − 1,n) = C(2n,n) for all n >... (answered by greenestamps)

Prove that for any n >= 2 , given {{{(sin(pi/n))*(sin(2pi/n))*"..."*(sin((n-1)pi/n)) =... (answered by Edwin McCravy)

Mathematical induction How can we prove that : (1 + 1 / 3) (1 + 5 / 4)(1 + 7 /... (answered by ikleyn)