How to finish ths last step of the induction question

  • Thread starter Thread starter transgalactic
  • Start date Start date
  • Tags Tags
    Induction
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
1 reply · 2K views
transgalactic
Messages
1,386
Reaction score
0
here is the full question and the last step to which i understand
i don't know how to go further??

http://img147.imageshack.us/img147/3077/14993551of0.gif

i got this suggestion from hallsofivy :
You know that for every n, [itex]a_n- L- \epsilon< a_{n+1}< an+ L+ \epsilon[/itex] so [itex]a_n- k(L+ \epsilon)< a_{n+k}< a_n+ k(L+ \epsilon)[/itex] is certainly true for k= 1. Now suppose [itex]a_n- k(L+ \epsilon)< a_n< a_{n+1}+ k(L+ \epsilon)[/itex] is true for some specific k and all n. Then [itex]a_n- (k+1)(L+ \epsilon)= [a_n- (L+ \epsilon)]- k(L+\epsilon)< a_{n+1}-k(L+\epsilon)[/itex] and now use [itex]a_n- k(L+ \epsilon)< a_{n+1}[/itex] with n+1 instead of n- which you can do because it is true for all n.


but i can't see in it my base (k) expression and using it to prove the (k+1) expression
i don't know how to apply it the step i got stuck
??
 
Last edited by a moderator:
Physics news on Phys.org
http://img360.imageshack.us/img360/7791/63228047ot8.gif
 
Last edited by a moderator: