Register to reply

Proving inequality by mathematical induction

Share this thread:
dustbin
#1
May9-12, 04:10 PM
P: 239
1. The problem statement, all variables and given/known data

I am asked to prove:
2n < (n+1)! , where n≥2

3. The attempt at a solution

Base step: set n=2, then test 22 < (2+1)!

22 = 4
(2+1)!= 3! = 3(2)(1) = 6
so 4 < 6 , which is true.

Induction hypothesis is 2k < (k+1)!
Using this, prove 2(k+1) < [(k+1)+1]! = (k+2)!

Attempt to solve:

starting with what I know: 2k < (k+1)!
Multiplying both sides by 2: 2(2k) = 2(k+1) < 2(k+1)!

I know that 2(k+1)! < (k+2)!
since (k+2)! = (k+2)(k+1)! and because k≥2, (k+2) will be greater than 2. Thus, multiplying (k+1)! by 2 on the LHS is less than multiplying (k+1)! by (k+2) on the RHS.

Thus, since 2(k+1) < 2(k+1)! is true, then 2k+1 < [(k+1)+1]!.

P(k+1) follows from P(k), completing the induction step. By mathematical induction, P(n) is true for n≥2.


Thanks for any help!
EDIT: fixed a couple of type-o's.
Phys.Org News Partner Science news on Phys.org
Experts defend operational earthquake forecasting, counter critiques
EU urged to convert TV frequencies to mobile broadband
Sierra Nevada freshwater runoff could drop 26 percent by 2100
Mark44
#2
May9-12, 05:41 PM
Mentor
P: 21,311
Quote Quote by dustbin View Post
1. The problem statement, all variables and given/known data

I am asked to prove:
2n < (n+1)! , where n≥2

3. The attempt at a solution

Base step: set n=2, then test 22 < (2+1)!

22 = 4
(2+1)!= 3! = 3(2)(1) = 6
so 4 < 6 , which is true.

Induction hypothesis is 2k < (k+1)!
Using this, prove 2(k+1) < [(k+1)+1]! = (k+2)!

Attempt to solve:

starting with what I know: 2k < (k+1)!
Multiplying both sides by 2: 2(2k) = 2(k+1) < 2(k+1)!

I know that 2(k+1)! < (k+2)!
since (k+2)! = (k+2)(k+1)! and because k≥2, (k+2) will be greater than 2. Thus, multiplying (k+1)! by 2 on the LHS is less than multiplying (k+1)! by (k+2) on the RHS.

Thus, since 2(k+1) < 2(k+1)! is true, then 2k+1 < [(k+1)+1]!.

P(k+1) follows from P(k), completing the induction step. By mathematical induction, P(n) is true for n≥2.


Thanks for any help!
EDIT: fixed a couple of type-o's.
Welcome to PF, and very nice first post! Looks good!
dustbin
#3
May9-12, 06:54 PM
P: 239
Thank you very much for your response! It was posted as an extra credit problem by my professor. I wanted to make sure my reasoning was correct before posting it on the board, as I've been having a little difficulty grasping what we covered about mathematical induction.

Mark44
#4
May9-12, 07:15 PM
Mentor
P: 21,311
Proving inequality by mathematical induction

It looks to me like you have the idea of induction proofs.


Register to reply

Related Discussions
Proving inequality with mathematical induction Calculus & Beyond Homework 2
Mathematical Induction with an Inequality Calculus & Beyond Homework 4
Inequality Mathematical Induction Precalculus Mathematics Homework 5
Proving inequality by induction,given a condition Calculus & Beyond Homework 4
Proving an inequality (not induction) Precalculus Mathematics Homework 3