Suppose that we want to prove that (1/2)*(3/4)...((2n-1)/2n)) < 1/(sq root

  • Thread starter Thread starter Tom D
  • Start date Start date
T

Tom D

Guest
3n) for all positive integers n.? A) Show that if we try to prove this inequality using mathematical induction, the basis step works, but the inductive step fails.

B) Show that mathematical induction can be used to prove the stronger inequality
(1/2)*(3/4)...((2n-1)/(2n)) < i/(sq root 3n+1)
for all integers greater than 1, which, together with a verification for the case where n=1, establishes the weaker inequality we originally tried to prove using mathematical induction.

thanks
 
Back
Top