Showing that $a_n to 0$ if $a_n/a_n+1 to l > 1$.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












How can we prove that $lim_nrightarrowinftya_n=0$
if $a_n>0$ and $lim_ntoinfty a_n / a_n+1 = l >1$?










share|cite|improve this question



























    up vote
    1
    down vote

    favorite












    How can we prove that $lim_nrightarrowinftya_n=0$
    if $a_n>0$ and $lim_ntoinfty a_n / a_n+1 = l >1$?










    share|cite|improve this question

























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      How can we prove that $lim_nrightarrowinftya_n=0$
      if $a_n>0$ and $lim_ntoinfty a_n / a_n+1 = l >1$?










      share|cite|improve this question















      How can we prove that $lim_nrightarrowinftya_n=0$
      if $a_n>0$ and $lim_ntoinfty a_n / a_n+1 = l >1$?







      calculus






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Sep 7 at 10:44









      Jendrik Stelzner

      7,69121137




      7,69121137










      asked May 24 '12 at 13:35









      Francis King

      367




      367




















          3 Answers
          3






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          There is some $N$ sufficiently large so that, for all $n > N$, we have $a_n+1/a_n leq c < 1$.



          For for $n > 0$ we have $0 < a_n+N leq a_N c^n$. By the squeeze theorem, $a_n+N rightarrow 0$.






          share|cite|improve this answer




















          • The key observation in applying the squeeze theorem is $a_N$ is fixed.
            – toypajme
            May 24 '12 at 14:18











          • I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
            – Francis King
            May 24 '12 at 15:09











          • I have get the point.thanks
            – Francis King
            May 24 '12 at 15:19


















          up vote
          1
          down vote













          Hint:



          If $limlimits_nrightarrowinftya_nover a_n+1=l>1$, then $limlimits_nrightarrowinftya_n+1over a_n =1over l<1$. Choose $0<c<1$, and choose $N$ so that if $nge N$, then $a_n+1over a_n<c$.



          Then note:



          $ a_N+1<c, a_N$,



          $ a_N+2<c,a_N+1<c^2a_N$,



          $ a_N+3<c,a_N+2<c^3a_N$,



          $ vdots$






          share|cite|improve this answer




















          • thanks. your step-by-step induction helps me a lot.
            – Francis King
            May 24 '12 at 15:20

















          up vote
          1
          down vote













          Another proof not-by-the-definition: the series $,displaystylesum_n=1^infty a_n,$ is a positive one and it converges by D'Alembert's test (or the quotient test), since $,displaystylefraca_n+1a_nto frac1l<1,$ , thus it must be $,a_nto 0$






          share|cite|improve this answer




















          • Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
            – Siminore
            May 24 '12 at 16:27










          • No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
            – DonAntonio
            May 24 '12 at 18:01










          Your Answer




          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "69"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          convertImagesToLinks: true,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f149216%2fshowing-that-a-n-to-0-if-a-n-a-n1-to-l-1%23new-answer', 'question_page');

          );

          Post as a guest






























          3 Answers
          3






          active

          oldest

          votes








          3 Answers
          3






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          3
          down vote



          accepted










          There is some $N$ sufficiently large so that, for all $n > N$, we have $a_n+1/a_n leq c < 1$.



          For for $n > 0$ we have $0 < a_n+N leq a_N c^n$. By the squeeze theorem, $a_n+N rightarrow 0$.






          share|cite|improve this answer




















          • The key observation in applying the squeeze theorem is $a_N$ is fixed.
            – toypajme
            May 24 '12 at 14:18











          • I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
            – Francis King
            May 24 '12 at 15:09











          • I have get the point.thanks
            – Francis King
            May 24 '12 at 15:19















          up vote
          3
          down vote



          accepted










          There is some $N$ sufficiently large so that, for all $n > N$, we have $a_n+1/a_n leq c < 1$.



          For for $n > 0$ we have $0 < a_n+N leq a_N c^n$. By the squeeze theorem, $a_n+N rightarrow 0$.






          share|cite|improve this answer




















          • The key observation in applying the squeeze theorem is $a_N$ is fixed.
            – toypajme
            May 24 '12 at 14:18











          • I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
            – Francis King
            May 24 '12 at 15:09











          • I have get the point.thanks
            – Francis King
            May 24 '12 at 15:19













          up vote
          3
          down vote



          accepted







          up vote
          3
          down vote



          accepted






          There is some $N$ sufficiently large so that, for all $n > N$, we have $a_n+1/a_n leq c < 1$.



          For for $n > 0$ we have $0 < a_n+N leq a_N c^n$. By the squeeze theorem, $a_n+N rightarrow 0$.






          share|cite|improve this answer












          There is some $N$ sufficiently large so that, for all $n > N$, we have $a_n+1/a_n leq c < 1$.



          For for $n > 0$ we have $0 < a_n+N leq a_N c^n$. By the squeeze theorem, $a_n+N rightarrow 0$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered May 24 '12 at 13:46









          David Harris

          706411




          706411











          • The key observation in applying the squeeze theorem is $a_N$ is fixed.
            – toypajme
            May 24 '12 at 14:18











          • I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
            – Francis King
            May 24 '12 at 15:09











          • I have get the point.thanks
            – Francis King
            May 24 '12 at 15:19

















          • The key observation in applying the squeeze theorem is $a_N$ is fixed.
            – toypajme
            May 24 '12 at 14:18











          • I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
            – Francis King
            May 24 '12 at 15:09











          • I have get the point.thanks
            – Francis King
            May 24 '12 at 15:19
















          The key observation in applying the squeeze theorem is $a_N$ is fixed.
          – toypajme
          May 24 '12 at 14:18





          The key observation in applying the squeeze theorem is $a_N$ is fixed.
          – toypajme
          May 24 '12 at 14:18













          I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
          – Francis King
          May 24 '12 at 15:09





          I don't certainly get the point that how we reach the inequality $a_n+N<a_Nc^n$ thanks
          – Francis King
          May 24 '12 at 15:09













          I have get the point.thanks
          – Francis King
          May 24 '12 at 15:19





          I have get the point.thanks
          – Francis King
          May 24 '12 at 15:19











          up vote
          1
          down vote













          Hint:



          If $limlimits_nrightarrowinftya_nover a_n+1=l>1$, then $limlimits_nrightarrowinftya_n+1over a_n =1over l<1$. Choose $0<c<1$, and choose $N$ so that if $nge N$, then $a_n+1over a_n<c$.



          Then note:



          $ a_N+1<c, a_N$,



          $ a_N+2<c,a_N+1<c^2a_N$,



          $ a_N+3<c,a_N+2<c^3a_N$,



          $ vdots$






          share|cite|improve this answer




















          • thanks. your step-by-step induction helps me a lot.
            – Francis King
            May 24 '12 at 15:20














          up vote
          1
          down vote













          Hint:



          If $limlimits_nrightarrowinftya_nover a_n+1=l>1$, then $limlimits_nrightarrowinftya_n+1over a_n =1over l<1$. Choose $0<c<1$, and choose $N$ so that if $nge N$, then $a_n+1over a_n<c$.



          Then note:



          $ a_N+1<c, a_N$,



          $ a_N+2<c,a_N+1<c^2a_N$,



          $ a_N+3<c,a_N+2<c^3a_N$,



          $ vdots$






          share|cite|improve this answer




















          • thanks. your step-by-step induction helps me a lot.
            – Francis King
            May 24 '12 at 15:20












          up vote
          1
          down vote










          up vote
          1
          down vote









          Hint:



          If $limlimits_nrightarrowinftya_nover a_n+1=l>1$, then $limlimits_nrightarrowinftya_n+1over a_n =1over l<1$. Choose $0<c<1$, and choose $N$ so that if $nge N$, then $a_n+1over a_n<c$.



          Then note:



          $ a_N+1<c, a_N$,



          $ a_N+2<c,a_N+1<c^2a_N$,



          $ a_N+3<c,a_N+2<c^3a_N$,



          $ vdots$






          share|cite|improve this answer












          Hint:



          If $limlimits_nrightarrowinftya_nover a_n+1=l>1$, then $limlimits_nrightarrowinftya_n+1over a_n =1over l<1$. Choose $0<c<1$, and choose $N$ so that if $nge N$, then $a_n+1over a_n<c$.



          Then note:



          $ a_N+1<c, a_N$,



          $ a_N+2<c,a_N+1<c^2a_N$,



          $ a_N+3<c,a_N+2<c^3a_N$,



          $ vdots$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered May 24 '12 at 13:46









          David Mitra

          62k695159




          62k695159











          • thanks. your step-by-step induction helps me a lot.
            – Francis King
            May 24 '12 at 15:20
















          • thanks. your step-by-step induction helps me a lot.
            – Francis King
            May 24 '12 at 15:20















          thanks. your step-by-step induction helps me a lot.
          – Francis King
          May 24 '12 at 15:20




          thanks. your step-by-step induction helps me a lot.
          – Francis King
          May 24 '12 at 15:20










          up vote
          1
          down vote













          Another proof not-by-the-definition: the series $,displaystylesum_n=1^infty a_n,$ is a positive one and it converges by D'Alembert's test (or the quotient test), since $,displaystylefraca_n+1a_nto frac1l<1,$ , thus it must be $,a_nto 0$






          share|cite|improve this answer




















          • Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
            – Siminore
            May 24 '12 at 16:27










          • No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
            – DonAntonio
            May 24 '12 at 18:01














          up vote
          1
          down vote













          Another proof not-by-the-definition: the series $,displaystylesum_n=1^infty a_n,$ is a positive one and it converges by D'Alembert's test (or the quotient test), since $,displaystylefraca_n+1a_nto frac1l<1,$ , thus it must be $,a_nto 0$






          share|cite|improve this answer




















          • Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
            – Siminore
            May 24 '12 at 16:27










          • No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
            – DonAntonio
            May 24 '12 at 18:01












          up vote
          1
          down vote










          up vote
          1
          down vote









          Another proof not-by-the-definition: the series $,displaystylesum_n=1^infty a_n,$ is a positive one and it converges by D'Alembert's test (or the quotient test), since $,displaystylefraca_n+1a_nto frac1l<1,$ , thus it must be $,a_nto 0$






          share|cite|improve this answer












          Another proof not-by-the-definition: the series $,displaystylesum_n=1^infty a_n,$ is a positive one and it converges by D'Alembert's test (or the quotient test), since $,displaystylefraca_n+1a_nto frac1l<1,$ , thus it must be $,a_nto 0$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered May 24 '12 at 14:04









          DonAntonio

          173k1487220




          173k1487220











          • Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
            – Siminore
            May 24 '12 at 16:27










          • No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
            – DonAntonio
            May 24 '12 at 18:01
















          • Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
            – Siminore
            May 24 '12 at 16:27










          • No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
            – DonAntonio
            May 24 '12 at 18:01















          Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
          – Siminore
          May 24 '12 at 16:27




          Right. But I guess that D'Alembert's test is proved the same way as the fact asked here. Your suggestion might be a circular reasoning.
          – Siminore
          May 24 '12 at 16:27












          No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
          – DonAntonio
          May 24 '12 at 18:01




          No, or at least not the proof I know, which proves the sequence of partial sums of the series is bounded (using a geometric convergente series) and thus the series converges.
          – DonAntonio
          May 24 '12 at 18:01

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f149216%2fshowing-that-a-n-to-0-if-a-n-a-n1-to-l-1%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Carbon dioxide

          Why am i infinitely getting the same tweet with the Twitter Search API?