Finding limit of a strangely defined recursive sequence











up vote
0
down vote

favorite












I have problems finding limits of recursive sequence like: $a_1 = 5$ $a_{n+1} = frac{(a_n)^2}{10n + 3} + 1$



I know that intuitively the limit will be $1$, since $frac{(a_n)^2}{10n + 3}$ tends to 0, but I have problems proving that.



Hints would be appreciated.










share|cite|improve this question







New contributor




José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
























    up vote
    0
    down vote

    favorite












    I have problems finding limits of recursive sequence like: $a_1 = 5$ $a_{n+1} = frac{(a_n)^2}{10n + 3} + 1$



    I know that intuitively the limit will be $1$, since $frac{(a_n)^2}{10n + 3}$ tends to 0, but I have problems proving that.



    Hints would be appreciated.










    share|cite|improve this question







    New contributor




    José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I have problems finding limits of recursive sequence like: $a_1 = 5$ $a_{n+1} = frac{(a_n)^2}{10n + 3} + 1$



      I know that intuitively the limit will be $1$, since $frac{(a_n)^2}{10n + 3}$ tends to 0, but I have problems proving that.



      Hints would be appreciated.










      share|cite|improve this question







      New contributor




      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      I have problems finding limits of recursive sequence like: $a_1 = 5$ $a_{n+1} = frac{(a_n)^2}{10n + 3} + 1$



      I know that intuitively the limit will be $1$, since $frac{(a_n)^2}{10n + 3}$ tends to 0, but I have problems proving that.



      Hints would be appreciated.







      limits limits-without-lhopital






      share|cite|improve this question







      New contributor




      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question







      New contributor




      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question






      New contributor




      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked Nov 22 at 10:29









      José

      11




      11




      New contributor




      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      José is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          1
          down vote













          First to all we'll need to show that $a_n$ is monotone, in particular decreasing by induction.



          It's simple verify that $a_2<a_1$ and $a_ngeq 1$ for every $n$ because the term $frac{a^2_n}{10n+3}$ is always $geq 0$, now suppose $a_n<a_{n-1}$ then $a_n^2<a_{n-1}^2$ and
          $$
          a_{n+1}=frac{a_n^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10n+3}+1=a_n
          $$



          Now $a_n$ is decreasing and lower bounded by $1$ so $a_n$ has got a limit: $lim_{nrightarrow +infty}a_n=linmathbb R$. Then
          $$
          l=lim_{nrightarrow +infty}a_{n+1}=lim_{nrightarrow +infty}frac{a_n^2}{10n+3}+1=frac l{+infty}+1=0+1=1
          $$

          then $l=1$.






          share|cite|improve this answer








          New contributor




          P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.


















          • Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
            – José
            Nov 22 at 11:14










          • Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
            – P De Donato
            Nov 22 at 11:16












          • For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
            – P De Donato
            Nov 22 at 11:19


















          up vote
          0
          down vote













          It should be clear that $a_n >0$ for all n.



          Now prove, by induction, that $(a_n)$ is decreasing.



          Hence $(a_n)$ is monotonic and bounded and therefore convergent. If $a$ is the limit of $(a_n)$ then $ frac{(a_n)^2}{10n + 3} + 1 to 1$ as $n to infty$, hence $a_{n+1} to 1$ as $n to infty$.






          share|cite|improve this answer





















            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: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });






            José is a new contributor. Be nice, and check out our Code of Conduct.










             

            draft saved


            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3008963%2ffinding-limit-of-a-strangely-defined-recursive-sequence%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            1
            down vote













            First to all we'll need to show that $a_n$ is monotone, in particular decreasing by induction.



            It's simple verify that $a_2<a_1$ and $a_ngeq 1$ for every $n$ because the term $frac{a^2_n}{10n+3}$ is always $geq 0$, now suppose $a_n<a_{n-1}$ then $a_n^2<a_{n-1}^2$ and
            $$
            a_{n+1}=frac{a_n^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10n+3}+1=a_n
            $$



            Now $a_n$ is decreasing and lower bounded by $1$ so $a_n$ has got a limit: $lim_{nrightarrow +infty}a_n=linmathbb R$. Then
            $$
            l=lim_{nrightarrow +infty}a_{n+1}=lim_{nrightarrow +infty}frac{a_n^2}{10n+3}+1=frac l{+infty}+1=0+1=1
            $$

            then $l=1$.






            share|cite|improve this answer








            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.


















            • Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
              – José
              Nov 22 at 11:14










            • Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
              – P De Donato
              Nov 22 at 11:16












            • For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
              – P De Donato
              Nov 22 at 11:19















            up vote
            1
            down vote













            First to all we'll need to show that $a_n$ is monotone, in particular decreasing by induction.



            It's simple verify that $a_2<a_1$ and $a_ngeq 1$ for every $n$ because the term $frac{a^2_n}{10n+3}$ is always $geq 0$, now suppose $a_n<a_{n-1}$ then $a_n^2<a_{n-1}^2$ and
            $$
            a_{n+1}=frac{a_n^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10n+3}+1=a_n
            $$



            Now $a_n$ is decreasing and lower bounded by $1$ so $a_n$ has got a limit: $lim_{nrightarrow +infty}a_n=linmathbb R$. Then
            $$
            l=lim_{nrightarrow +infty}a_{n+1}=lim_{nrightarrow +infty}frac{a_n^2}{10n+3}+1=frac l{+infty}+1=0+1=1
            $$

            then $l=1$.






            share|cite|improve this answer








            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.


















            • Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
              – José
              Nov 22 at 11:14










            • Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
              – P De Donato
              Nov 22 at 11:16












            • For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
              – P De Donato
              Nov 22 at 11:19













            up vote
            1
            down vote










            up vote
            1
            down vote









            First to all we'll need to show that $a_n$ is monotone, in particular decreasing by induction.



            It's simple verify that $a_2<a_1$ and $a_ngeq 1$ for every $n$ because the term $frac{a^2_n}{10n+3}$ is always $geq 0$, now suppose $a_n<a_{n-1}$ then $a_n^2<a_{n-1}^2$ and
            $$
            a_{n+1}=frac{a_n^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10n+3}+1=a_n
            $$



            Now $a_n$ is decreasing and lower bounded by $1$ so $a_n$ has got a limit: $lim_{nrightarrow +infty}a_n=linmathbb R$. Then
            $$
            l=lim_{nrightarrow +infty}a_{n+1}=lim_{nrightarrow +infty}frac{a_n^2}{10n+3}+1=frac l{+infty}+1=0+1=1
            $$

            then $l=1$.






            share|cite|improve this answer








            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.









            First to all we'll need to show that $a_n$ is monotone, in particular decreasing by induction.



            It's simple verify that $a_2<a_1$ and $a_ngeq 1$ for every $n$ because the term $frac{a^2_n}{10n+3}$ is always $geq 0$, now suppose $a_n<a_{n-1}$ then $a_n^2<a_{n-1}^2$ and
            $$
            a_{n+1}=frac{a_n^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10(n+1)+3}+1<frac{a_{n-1}^2}{10n+3}+1=a_n
            $$



            Now $a_n$ is decreasing and lower bounded by $1$ so $a_n$ has got a limit: $lim_{nrightarrow +infty}a_n=linmathbb R$. Then
            $$
            l=lim_{nrightarrow +infty}a_{n+1}=lim_{nrightarrow +infty}frac{a_n^2}{10n+3}+1=frac l{+infty}+1=0+1=1
            $$

            then $l=1$.







            share|cite|improve this answer








            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.









            share|cite|improve this answer



            share|cite|improve this answer






            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.









            answered Nov 22 at 10:50









            P De Donato

            2797




            2797




            New contributor




            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.





            New contributor





            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            P De Donato is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.












            • Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
              – José
              Nov 22 at 11:14










            • Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
              – P De Donato
              Nov 22 at 11:16












            • For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
              – P De Donato
              Nov 22 at 11:19


















            • Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
              – José
              Nov 22 at 11:14










            • Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
              – P De Donato
              Nov 22 at 11:16












            • For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
              – P De Donato
              Nov 22 at 11:19
















            Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
            – José
            Nov 22 at 11:14




            Would it be enough to show that $a_n$ is non-increasing instead of showing it's decreasing?
            – José
            Nov 22 at 11:14












            Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
            – P De Donato
            Nov 22 at 11:16






            Yes, for generic successions $a_n$ you need at least one of: 1. $a_n$ not decreasing ($a_ngeq a_{n-1}$) and upper bounded; 2. $a_n$ not increasing ($a_nleq a_{n-1}$) and lower bounded.
            – P De Donato
            Nov 22 at 11:16














            For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
            – P De Donato
            Nov 22 at 11:19




            For example succession $a_n=(-1)^n$ is lower and upper bounded but hasn't limit (it isn't monotone).
            – P De Donato
            Nov 22 at 11:19










            up vote
            0
            down vote













            It should be clear that $a_n >0$ for all n.



            Now prove, by induction, that $(a_n)$ is decreasing.



            Hence $(a_n)$ is monotonic and bounded and therefore convergent. If $a$ is the limit of $(a_n)$ then $ frac{(a_n)^2}{10n + 3} + 1 to 1$ as $n to infty$, hence $a_{n+1} to 1$ as $n to infty$.






            share|cite|improve this answer

























              up vote
              0
              down vote













              It should be clear that $a_n >0$ for all n.



              Now prove, by induction, that $(a_n)$ is decreasing.



              Hence $(a_n)$ is monotonic and bounded and therefore convergent. If $a$ is the limit of $(a_n)$ then $ frac{(a_n)^2}{10n + 3} + 1 to 1$ as $n to infty$, hence $a_{n+1} to 1$ as $n to infty$.






              share|cite|improve this answer























                up vote
                0
                down vote










                up vote
                0
                down vote









                It should be clear that $a_n >0$ for all n.



                Now prove, by induction, that $(a_n)$ is decreasing.



                Hence $(a_n)$ is monotonic and bounded and therefore convergent. If $a$ is the limit of $(a_n)$ then $ frac{(a_n)^2}{10n + 3} + 1 to 1$ as $n to infty$, hence $a_{n+1} to 1$ as $n to infty$.






                share|cite|improve this answer












                It should be clear that $a_n >0$ for all n.



                Now prove, by induction, that $(a_n)$ is decreasing.



                Hence $(a_n)$ is monotonic and bounded and therefore convergent. If $a$ is the limit of $(a_n)$ then $ frac{(a_n)^2}{10n + 3} + 1 to 1$ as $n to infty$, hence $a_{n+1} to 1$ as $n to infty$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 22 at 10:48









                Fred

                42.4k1642




                42.4k1642






















                    José is a new contributor. Be nice, and check out our Code of Conduct.










                     

                    draft saved


                    draft discarded


















                    José is a new contributor. Be nice, and check out our Code of Conduct.













                    José is a new contributor. Be nice, and check out our Code of Conduct.












                    José is a new contributor. Be nice, and check out our Code of Conduct.















                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3008963%2ffinding-limit-of-a-strangely-defined-recursive-sequence%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Basket-ball féminin

                    Different font size/position of beamer's navigation symbols template's content depending on regular/plain...

                    I want to find a topological embedding $f : X rightarrow Y$ and $g: Y rightarrow X$, yet $X$ is not...