Proving Induction Formula with Calculus - Maximilian

  • Context: Undergrad 
  • Thread starter Thread starter dustwave
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary
SUMMARY

The discussion centers on proving the induction formula for the inequality \((1 * 3 * 5 * ... * (2n - 1)) / (1 * 2 * 3 * ... * n) \leq 2^n\) using mathematical induction. The user, Maximilian, successfully establishes the base case \(P(1)\) and discusses the inductive step \(P(k+1)\). A key insight is the need to prove that \((2k + 1)/(k + 1) < 2\) for all \(k\), which can be approached by treating it as a lemma and applying induction to validate it. The discussion also touches on factorial expressions and their relationships to powers of two.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with factorial notation and properties
  • Basic knowledge of inequalities and limits
  • Proficiency in calculus concepts related to sequences and series
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Learn how to manipulate and prove inequalities involving factorials
  • Research the properties of sequences, particularly odd and even sequences
  • Explore advanced calculus topics, including limits and convergence of series
USEFUL FOR

Students in calculus courses, educators teaching mathematical induction, and anyone interested in advanced mathematical proofs and inequalities.

dustwave
Messages
2
Reaction score
0
Hello, I have this problem in my calculus class where I have to prove a formula with induction.

the problem is:

( 1 * 3 * 5 * ... * (2n - 1) ) / ( 1 * 2 * 3 * ... * n) =< 2^n

=< = equal or lesser than

P(1) is easy to solve, and so is P(k), but I start having problems with P(k+1) to prove the formula.. can someone give me a hand? =)

thanks!

/Maximilian
 
Physics news on Phys.org
Yes, P(1) is "easy to solve": 1/1= 1< 21.
I'm not sure what you mean by saying P(k) is "easy to solve"- there's nothing to solve there!

You do, of course, assume that (1*2*...*(2k-1))/(1*2*...*k)<2k

Now, for P(k+1), you have to look at (1*2*..*(2k-1)(2(k+1)-1)/(1*2*...*k*(k+1))
2(k+1)-1= 2k+1 of course, so this is
(1*2*...*(2k-1)*(2k+1)/(1*2*...*k*(k+1)= {(1*2*...*(2k-1))/(1*2*...*k)}{(2k+1)/(k+1)}< 2k{(2k+1)/(k+1)}.

Looks to me like you need to prove that (2k+1)/(k+1)< 2 for all k! I would be inclined to write that as a "lemma" first and use induction to prove it.
 
(2n-1)!/{(2^(n-1)(n-1)!(n!)}=<2^n

{2^n(n!)}{2^(n-1)(n-1)!}>=(2n-1)!

(2n-1)!/(n!)(n-1)!=<2^(2n-1)

C(2n-1,n)=<2^(2n-1)
True?
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K