Proof by Induction of a Recursively Defined Sequence












3












$begingroup$


The question I'm currently struggling with is:




Consider the following recursively defined sequence:



$$ a_1 = 0, a_{n+1}= frac{a^2_n+4}{5} $$



a) Show by induction that $0le a_n le 1 $ for all n



b) Prove that if $a_n$ converges, so that $lim_{nto infty}a_n=A$ then $A^2−5A+4 =0$, and thus $A = 1$.



c) Prove by induction that $a_n$ is strictly increasing, $a_{n+1}>a_n$ for all n.



d) Conclude that $lim_{n toinfty}a_n$ exists, and thus that $lim_{n to infty}a_n=1$




I've managed to complete part a) where I did:



Basis - at $n=1$ $a_{1+1}=frac{0+4}{5}$



Inductive Hypothesis - for k as an element of the natural numbers, it is always true that $0 le a_{k+1} le 1$ where $a_{k+1}=frac{a_k+4}{5}$



Inductive Step - Here I tried to prove it by making $n=k+1$ which meant



$a_{k+2}= frac{a_k+1^2+4}{5}$



which I split in to $frac{a_k+1^2}{5}+frac{4}{5}$



and from the inductive hypothesis I know that $0 le a_{k+1} le 1$ and therefore it's evident that $frac{a_k+1^2}{5}$ can take a minimum value of $frac{0}{5}$ and a minimum value of $frac{1}{5}$



Part b) seems relatively simple as you can prove



$A^2−5A+4 =0$ quite easily but I'm unsure how to get the equation in the first place. I think it has something to do with rearranging:



$a_{k+1}= frac{a^2_k+4}{5} $



Part c) is the part I'm struggling with most and the answer in my notes doesn't really explain to me how it's done.



I did the basis and my inductive hypothesis and at the inductive step I got to:



$a_{k+1}^2-5a_{k+1}+4>0$ but I'm not sure what to do after this



Would anyone mind helping me with part c) and d)?










share|cite|improve this question











$endgroup$












  • $begingroup$
    @saulspatz I already wrote that
    $endgroup$
    – greedoid
    Feb 28 at 18:03
















3












$begingroup$


The question I'm currently struggling with is:




Consider the following recursively defined sequence:



$$ a_1 = 0, a_{n+1}= frac{a^2_n+4}{5} $$



a) Show by induction that $0le a_n le 1 $ for all n



b) Prove that if $a_n$ converges, so that $lim_{nto infty}a_n=A$ then $A^2−5A+4 =0$, and thus $A = 1$.



c) Prove by induction that $a_n$ is strictly increasing, $a_{n+1}>a_n$ for all n.



d) Conclude that $lim_{n toinfty}a_n$ exists, and thus that $lim_{n to infty}a_n=1$




I've managed to complete part a) where I did:



Basis - at $n=1$ $a_{1+1}=frac{0+4}{5}$



Inductive Hypothesis - for k as an element of the natural numbers, it is always true that $0 le a_{k+1} le 1$ where $a_{k+1}=frac{a_k+4}{5}$



Inductive Step - Here I tried to prove it by making $n=k+1$ which meant



$a_{k+2}= frac{a_k+1^2+4}{5}$



which I split in to $frac{a_k+1^2}{5}+frac{4}{5}$



and from the inductive hypothesis I know that $0 le a_{k+1} le 1$ and therefore it's evident that $frac{a_k+1^2}{5}$ can take a minimum value of $frac{0}{5}$ and a minimum value of $frac{1}{5}$



Part b) seems relatively simple as you can prove



$A^2−5A+4 =0$ quite easily but I'm unsure how to get the equation in the first place. I think it has something to do with rearranging:



$a_{k+1}= frac{a^2_k+4}{5} $



Part c) is the part I'm struggling with most and the answer in my notes doesn't really explain to me how it's done.



I did the basis and my inductive hypothesis and at the inductive step I got to:



$a_{k+1}^2-5a_{k+1}+4>0$ but I'm not sure what to do after this



Would anyone mind helping me with part c) and d)?










share|cite|improve this question











$endgroup$












  • $begingroup$
    @saulspatz I already wrote that
    $endgroup$
    – greedoid
    Feb 28 at 18:03














3












3








3





$begingroup$


The question I'm currently struggling with is:




Consider the following recursively defined sequence:



$$ a_1 = 0, a_{n+1}= frac{a^2_n+4}{5} $$



a) Show by induction that $0le a_n le 1 $ for all n



b) Prove that if $a_n$ converges, so that $lim_{nto infty}a_n=A$ then $A^2−5A+4 =0$, and thus $A = 1$.



c) Prove by induction that $a_n$ is strictly increasing, $a_{n+1}>a_n$ for all n.



d) Conclude that $lim_{n toinfty}a_n$ exists, and thus that $lim_{n to infty}a_n=1$




I've managed to complete part a) where I did:



Basis - at $n=1$ $a_{1+1}=frac{0+4}{5}$



Inductive Hypothesis - for k as an element of the natural numbers, it is always true that $0 le a_{k+1} le 1$ where $a_{k+1}=frac{a_k+4}{5}$



Inductive Step - Here I tried to prove it by making $n=k+1$ which meant



$a_{k+2}= frac{a_k+1^2+4}{5}$



which I split in to $frac{a_k+1^2}{5}+frac{4}{5}$



and from the inductive hypothesis I know that $0 le a_{k+1} le 1$ and therefore it's evident that $frac{a_k+1^2}{5}$ can take a minimum value of $frac{0}{5}$ and a minimum value of $frac{1}{5}$



Part b) seems relatively simple as you can prove



$A^2−5A+4 =0$ quite easily but I'm unsure how to get the equation in the first place. I think it has something to do with rearranging:



$a_{k+1}= frac{a^2_k+4}{5} $



Part c) is the part I'm struggling with most and the answer in my notes doesn't really explain to me how it's done.



I did the basis and my inductive hypothesis and at the inductive step I got to:



$a_{k+1}^2-5a_{k+1}+4>0$ but I'm not sure what to do after this



Would anyone mind helping me with part c) and d)?










share|cite|improve this question











$endgroup$




The question I'm currently struggling with is:




Consider the following recursively defined sequence:



$$ a_1 = 0, a_{n+1}= frac{a^2_n+4}{5} $$



a) Show by induction that $0le a_n le 1 $ for all n



b) Prove that if $a_n$ converges, so that $lim_{nto infty}a_n=A$ then $A^2−5A+4 =0$, and thus $A = 1$.



c) Prove by induction that $a_n$ is strictly increasing, $a_{n+1}>a_n$ for all n.



d) Conclude that $lim_{n toinfty}a_n$ exists, and thus that $lim_{n to infty}a_n=1$




I've managed to complete part a) where I did:



Basis - at $n=1$ $a_{1+1}=frac{0+4}{5}$



Inductive Hypothesis - for k as an element of the natural numbers, it is always true that $0 le a_{k+1} le 1$ where $a_{k+1}=frac{a_k+4}{5}$



Inductive Step - Here I tried to prove it by making $n=k+1$ which meant



$a_{k+2}= frac{a_k+1^2+4}{5}$



which I split in to $frac{a_k+1^2}{5}+frac{4}{5}$



and from the inductive hypothesis I know that $0 le a_{k+1} le 1$ and therefore it's evident that $frac{a_k+1^2}{5}$ can take a minimum value of $frac{0}{5}$ and a minimum value of $frac{1}{5}$



Part b) seems relatively simple as you can prove



$A^2−5A+4 =0$ quite easily but I'm unsure how to get the equation in the first place. I think it has something to do with rearranging:



$a_{k+1}= frac{a^2_k+4}{5} $



Part c) is the part I'm struggling with most and the answer in my notes doesn't really explain to me how it's done.



I did the basis and my inductive hypothesis and at the inductive step I got to:



$a_{k+1}^2-5a_{k+1}+4>0$ but I'm not sure what to do after this



Would anyone mind helping me with part c) and d)?







real-analysis sequences-and-series induction






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 28 at 20:35









greedoid

46.4k1160118




46.4k1160118










asked Feb 28 at 17:57









kingking

405




405












  • $begingroup$
    @saulspatz I already wrote that
    $endgroup$
    – greedoid
    Feb 28 at 18:03


















  • $begingroup$
    @saulspatz I already wrote that
    $endgroup$
    – greedoid
    Feb 28 at 18:03
















$begingroup$
@saulspatz I already wrote that
$endgroup$
– greedoid
Feb 28 at 18:03




$begingroup$
@saulspatz I already wrote that
$endgroup$
– greedoid
Feb 28 at 18:03










4 Answers
4






active

oldest

votes


















2












$begingroup$

It is $$a_{k+1}^2-5a_{k+1}+4>0$$ and not $a_{k+1}^2-5a_{k+1}-4>0$. So you have $$(a_{k+1}-1)(a_{k+1}-4)>0$$



which is true by a).






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Ahh yes thank you that was a typo in my post but I see what you do with it now
    $endgroup$
    – king
    Feb 28 at 19:06



















2












$begingroup$

The inductive step for the monotonicity (c) is just
$$
a_{n+1} > a_n implies frac{a^2_{n+1}+4}{5} > frac{a^2_n+4}{5} implies a_{n+2} > a_{n+1}
$$

The first implication holds because $a_n ge 0$.



The convergence (d) then follows from the monotone convergence theorem.






share|cite|improve this answer











$endgroup$





















    1












    $begingroup$

    b) The argument is that at the fixed point, which has the value A,
    $$a_{k+1}=a_{k}=A$$

    So
    $$a_{k+1}=frac{a_k^2+4}{5}$$
    becomes
    $$A=frac{A^2+4}{5}$$
    $$5A=A^2+4$$
    $$A^2+5A+4=0$$






    share|cite|improve this answer









    $endgroup$





















      1












      $begingroup$

      a) By the assumption of the induction we obtain:
      $$0leq a_{n+1}=frac{a_n^2+4}{5}<frac{1^2+4}{5}=1.$$
      b),c) $$a_{n+1}-a_n=frac{a_n^2+4}{5}-a_n=frac{(a_n-1)(a_n-4)}{5}>0,$$
      which says that $a$ increases and bounded.



      Thus, there is $limlimits_{nrightarrow+infty}a_n$ and let this limit be equal to $A$.



      Thus, by theorems about limits we obtain: $$A^2-5A+4=0,$$ which gives $A=1$.



      I like the following way:
      $$|a_{n+1}-1|=left|frac{a_n^2+4}{5}-1right|=frac{a_n+1}{5}|a_n-1|<frac{2}{5}|a_n-1|<...<left(frac{2}{5}right)^n|a_1-1|rightarrow0,$$
      Which says $$lim_{nrightarrow+infty}a_n=1.$$






      share|cite|improve this answer











      $endgroup$













        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',
        autoActivateHeartbeat: false,
        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
        });


        }
        });














        draft saved

        draft discarded


















        StackExchange.ready(
        function () {
        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3130515%2fproof-by-induction-of-a-recursively-defined-sequence%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        4 Answers
        4






        active

        oldest

        votes








        4 Answers
        4






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        2












        $begingroup$

        It is $$a_{k+1}^2-5a_{k+1}+4>0$$ and not $a_{k+1}^2-5a_{k+1}-4>0$. So you have $$(a_{k+1}-1)(a_{k+1}-4)>0$$



        which is true by a).






        share|cite|improve this answer









        $endgroup$













        • $begingroup$
          Ahh yes thank you that was a typo in my post but I see what you do with it now
          $endgroup$
          – king
          Feb 28 at 19:06
















        2












        $begingroup$

        It is $$a_{k+1}^2-5a_{k+1}+4>0$$ and not $a_{k+1}^2-5a_{k+1}-4>0$. So you have $$(a_{k+1}-1)(a_{k+1}-4)>0$$



        which is true by a).






        share|cite|improve this answer









        $endgroup$













        • $begingroup$
          Ahh yes thank you that was a typo in my post but I see what you do with it now
          $endgroup$
          – king
          Feb 28 at 19:06














        2












        2








        2





        $begingroup$

        It is $$a_{k+1}^2-5a_{k+1}+4>0$$ and not $a_{k+1}^2-5a_{k+1}-4>0$. So you have $$(a_{k+1}-1)(a_{k+1}-4)>0$$



        which is true by a).






        share|cite|improve this answer









        $endgroup$



        It is $$a_{k+1}^2-5a_{k+1}+4>0$$ and not $a_{k+1}^2-5a_{k+1}-4>0$. So you have $$(a_{k+1}-1)(a_{k+1}-4)>0$$



        which is true by a).







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 28 at 18:02









        greedoidgreedoid

        46.4k1160118




        46.4k1160118












        • $begingroup$
          Ahh yes thank you that was a typo in my post but I see what you do with it now
          $endgroup$
          – king
          Feb 28 at 19:06


















        • $begingroup$
          Ahh yes thank you that was a typo in my post but I see what you do with it now
          $endgroup$
          – king
          Feb 28 at 19:06
















        $begingroup$
        Ahh yes thank you that was a typo in my post but I see what you do with it now
        $endgroup$
        – king
        Feb 28 at 19:06




        $begingroup$
        Ahh yes thank you that was a typo in my post but I see what you do with it now
        $endgroup$
        – king
        Feb 28 at 19:06











        2












        $begingroup$

        The inductive step for the monotonicity (c) is just
        $$
        a_{n+1} > a_n implies frac{a^2_{n+1}+4}{5} > frac{a^2_n+4}{5} implies a_{n+2} > a_{n+1}
        $$

        The first implication holds because $a_n ge 0$.



        The convergence (d) then follows from the monotone convergence theorem.






        share|cite|improve this answer











        $endgroup$


















          2












          $begingroup$

          The inductive step for the monotonicity (c) is just
          $$
          a_{n+1} > a_n implies frac{a^2_{n+1}+4}{5} > frac{a^2_n+4}{5} implies a_{n+2} > a_{n+1}
          $$

          The first implication holds because $a_n ge 0$.



          The convergence (d) then follows from the monotone convergence theorem.






          share|cite|improve this answer











          $endgroup$
















            2












            2








            2





            $begingroup$

            The inductive step for the monotonicity (c) is just
            $$
            a_{n+1} > a_n implies frac{a^2_{n+1}+4}{5} > frac{a^2_n+4}{5} implies a_{n+2} > a_{n+1}
            $$

            The first implication holds because $a_n ge 0$.



            The convergence (d) then follows from the monotone convergence theorem.






            share|cite|improve this answer











            $endgroup$



            The inductive step for the monotonicity (c) is just
            $$
            a_{n+1} > a_n implies frac{a^2_{n+1}+4}{5} > frac{a^2_n+4}{5} implies a_{n+2} > a_{n+1}
            $$

            The first implication holds because $a_n ge 0$.



            The convergence (d) then follows from the monotone convergence theorem.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Feb 28 at 18:23

























            answered Feb 28 at 18:08









            Martin RMartin R

            29.7k33558




            29.7k33558























                1












                $begingroup$

                b) The argument is that at the fixed point, which has the value A,
                $$a_{k+1}=a_{k}=A$$

                So
                $$a_{k+1}=frac{a_k^2+4}{5}$$
                becomes
                $$A=frac{A^2+4}{5}$$
                $$5A=A^2+4$$
                $$A^2+5A+4=0$$






                share|cite|improve this answer









                $endgroup$


















                  1












                  $begingroup$

                  b) The argument is that at the fixed point, which has the value A,
                  $$a_{k+1}=a_{k}=A$$

                  So
                  $$a_{k+1}=frac{a_k^2+4}{5}$$
                  becomes
                  $$A=frac{A^2+4}{5}$$
                  $$5A=A^2+4$$
                  $$A^2+5A+4=0$$






                  share|cite|improve this answer









                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$

                    b) The argument is that at the fixed point, which has the value A,
                    $$a_{k+1}=a_{k}=A$$

                    So
                    $$a_{k+1}=frac{a_k^2+4}{5}$$
                    becomes
                    $$A=frac{A^2+4}{5}$$
                    $$5A=A^2+4$$
                    $$A^2+5A+4=0$$






                    share|cite|improve this answer









                    $endgroup$



                    b) The argument is that at the fixed point, which has the value A,
                    $$a_{k+1}=a_{k}=A$$

                    So
                    $$a_{k+1}=frac{a_k^2+4}{5}$$
                    becomes
                    $$A=frac{A^2+4}{5}$$
                    $$5A=A^2+4$$
                    $$A^2+5A+4=0$$







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Feb 28 at 18:08









                    Martin HansenMartin Hansen

                    19113




                    19113























                        1












                        $begingroup$

                        a) By the assumption of the induction we obtain:
                        $$0leq a_{n+1}=frac{a_n^2+4}{5}<frac{1^2+4}{5}=1.$$
                        b),c) $$a_{n+1}-a_n=frac{a_n^2+4}{5}-a_n=frac{(a_n-1)(a_n-4)}{5}>0,$$
                        which says that $a$ increases and bounded.



                        Thus, there is $limlimits_{nrightarrow+infty}a_n$ and let this limit be equal to $A$.



                        Thus, by theorems about limits we obtain: $$A^2-5A+4=0,$$ which gives $A=1$.



                        I like the following way:
                        $$|a_{n+1}-1|=left|frac{a_n^2+4}{5}-1right|=frac{a_n+1}{5}|a_n-1|<frac{2}{5}|a_n-1|<...<left(frac{2}{5}right)^n|a_1-1|rightarrow0,$$
                        Which says $$lim_{nrightarrow+infty}a_n=1.$$






                        share|cite|improve this answer











                        $endgroup$


















                          1












                          $begingroup$

                          a) By the assumption of the induction we obtain:
                          $$0leq a_{n+1}=frac{a_n^2+4}{5}<frac{1^2+4}{5}=1.$$
                          b),c) $$a_{n+1}-a_n=frac{a_n^2+4}{5}-a_n=frac{(a_n-1)(a_n-4)}{5}>0,$$
                          which says that $a$ increases and bounded.



                          Thus, there is $limlimits_{nrightarrow+infty}a_n$ and let this limit be equal to $A$.



                          Thus, by theorems about limits we obtain: $$A^2-5A+4=0,$$ which gives $A=1$.



                          I like the following way:
                          $$|a_{n+1}-1|=left|frac{a_n^2+4}{5}-1right|=frac{a_n+1}{5}|a_n-1|<frac{2}{5}|a_n-1|<...<left(frac{2}{5}right)^n|a_1-1|rightarrow0,$$
                          Which says $$lim_{nrightarrow+infty}a_n=1.$$






                          share|cite|improve this answer











                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$

                            a) By the assumption of the induction we obtain:
                            $$0leq a_{n+1}=frac{a_n^2+4}{5}<frac{1^2+4}{5}=1.$$
                            b),c) $$a_{n+1}-a_n=frac{a_n^2+4}{5}-a_n=frac{(a_n-1)(a_n-4)}{5}>0,$$
                            which says that $a$ increases and bounded.



                            Thus, there is $limlimits_{nrightarrow+infty}a_n$ and let this limit be equal to $A$.



                            Thus, by theorems about limits we obtain: $$A^2-5A+4=0,$$ which gives $A=1$.



                            I like the following way:
                            $$|a_{n+1}-1|=left|frac{a_n^2+4}{5}-1right|=frac{a_n+1}{5}|a_n-1|<frac{2}{5}|a_n-1|<...<left(frac{2}{5}right)^n|a_1-1|rightarrow0,$$
                            Which says $$lim_{nrightarrow+infty}a_n=1.$$






                            share|cite|improve this answer











                            $endgroup$



                            a) By the assumption of the induction we obtain:
                            $$0leq a_{n+1}=frac{a_n^2+4}{5}<frac{1^2+4}{5}=1.$$
                            b),c) $$a_{n+1}-a_n=frac{a_n^2+4}{5}-a_n=frac{(a_n-1)(a_n-4)}{5}>0,$$
                            which says that $a$ increases and bounded.



                            Thus, there is $limlimits_{nrightarrow+infty}a_n$ and let this limit be equal to $A$.



                            Thus, by theorems about limits we obtain: $$A^2-5A+4=0,$$ which gives $A=1$.



                            I like the following way:
                            $$|a_{n+1}-1|=left|frac{a_n^2+4}{5}-1right|=frac{a_n+1}{5}|a_n-1|<frac{2}{5}|a_n-1|<...<left(frac{2}{5}right)^n|a_1-1|rightarrow0,$$
                            Which says $$lim_{nrightarrow+infty}a_n=1.$$







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Feb 28 at 21:21

























                            answered Feb 28 at 18:58









                            Michael RozenbergMichael Rozenberg

                            107k1894199




                            107k1894199






























                                draft saved

                                draft discarded




















































                                Thanks for contributing an answer to Mathematics Stack Exchange!


                                • Please be sure to answer the question. Provide details and share your research!

                                But avoid



                                • Asking for help, clarification, or responding to other answers.

                                • Making statements based on opinion; back them up with references or personal experience.


                                Use MathJax to format equations. MathJax reference.


                                To learn more, see our tips on writing great answers.




                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function () {
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3130515%2fproof-by-induction-of-a-recursively-defined-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

                                mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

                                How to change which sound is reproduced for terminal bell?

                                Can I use Tabulator js library in my java Spring + Thymeleaf project?