a limit of recurrence relation












1












$begingroup$


I have and the following recurrence relaation:



(x_{n})_{ngeq 0}, x_{n+1}=x_{n}+frac{1}{a}cdot x_{n}^{1-a},ageq 1,ngeq 0,x_{0}=1



I need to solve lim_{nrightarrow infty }frac{x_{n}^{a}}{n}



I found that this string is increasing and I tried to find z and w from general form x_{n+1}=zcdot x_{n}+w



I tried to factorize xn but I didn't get too far.










share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    I have and the following recurrence relaation:



    (x_{n})_{ngeq 0}, x_{n+1}=x_{n}+frac{1}{a}cdot x_{n}^{1-a},ageq 1,ngeq 0,x_{0}=1



    I need to solve lim_{nrightarrow infty }frac{x_{n}^{a}}{n}



    I found that this string is increasing and I tried to find z and w from general form x_{n+1}=zcdot x_{n}+w



    I tried to factorize xn but I didn't get too far.










    share|cite|improve this question









    $endgroup$















      1












      1








      1


      0



      $begingroup$


      I have and the following recurrence relaation:



      (x_{n})_{ngeq 0}, x_{n+1}=x_{n}+frac{1}{a}cdot x_{n}^{1-a},ageq 1,ngeq 0,x_{0}=1



      I need to solve lim_{nrightarrow infty }frac{x_{n}^{a}}{n}



      I found that this string is increasing and I tried to find z and w from general form x_{n+1}=zcdot x_{n}+w



      I tried to factorize xn but I didn't get too far.










      share|cite|improve this question









      $endgroup$




      I have and the following recurrence relaation:



      (x_{n})_{ngeq 0}, x_{n+1}=x_{n}+frac{1}{a}cdot x_{n}^{1-a},ageq 1,ngeq 0,x_{0}=1



      I need to solve lim_{nrightarrow infty }frac{x_{n}^{a}}{n}



      I found that this string is increasing and I tried to find z and w from general form x_{n+1}=zcdot x_{n}+w



      I tried to factorize xn but I didn't get too far.







      recurrence-relations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 5 at 12:43









      Vali ROVali RO

      686




      686






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          You can prove by induction that $x_ngeq 1$. This implies that for all $ngeq 0$, $$x_{n+1}-x_ngeq frac 1 a$$
          Summing this up leads to $$x_ngeq 1 + frac n a$$
          So, clearly, $x_nrightarrow +infty$ as $nrightarrow +infty$.



          The trick is to look for an estimate of $u_n = x_n^a$.
          Note that just like $(x_n)_{ngeq 0}$, $(u_n)_{n geq 0}$ tends to $+infty$, so we can use the appropriate Taylor expansion:
          $$begin{split}
          u_{n+1} &= left (x_n + frac 1 a x_n^{1-a}right)^a\
          &= u_n left (1 + frac 1 a frac 1 {u_n}right)^{a}\
          &= u_n left (1 + frac 1 {u_n} + oleft (frac 1 {u_n}right)right)\
          &= u_n +1 +o(1)
          end{split}$$

          So summing this up leads to $u_n=n+o(n)$, which implies that
          $$lim_{nrightarrow +infty} frac {x_n^a}n = 1$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks a lot! :)
            $endgroup$
            – Vali RO
            Jan 7 at 12:34










          • $begingroup$
            You're welcome!
            $endgroup$
            – Stefan Lafon
            Jan 7 at 16:57












          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%2f3062679%2fa-limit-of-recurrence-relation%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          1












          $begingroup$

          You can prove by induction that $x_ngeq 1$. This implies that for all $ngeq 0$, $$x_{n+1}-x_ngeq frac 1 a$$
          Summing this up leads to $$x_ngeq 1 + frac n a$$
          So, clearly, $x_nrightarrow +infty$ as $nrightarrow +infty$.



          The trick is to look for an estimate of $u_n = x_n^a$.
          Note that just like $(x_n)_{ngeq 0}$, $(u_n)_{n geq 0}$ tends to $+infty$, so we can use the appropriate Taylor expansion:
          $$begin{split}
          u_{n+1} &= left (x_n + frac 1 a x_n^{1-a}right)^a\
          &= u_n left (1 + frac 1 a frac 1 {u_n}right)^{a}\
          &= u_n left (1 + frac 1 {u_n} + oleft (frac 1 {u_n}right)right)\
          &= u_n +1 +o(1)
          end{split}$$

          So summing this up leads to $u_n=n+o(n)$, which implies that
          $$lim_{nrightarrow +infty} frac {x_n^a}n = 1$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks a lot! :)
            $endgroup$
            – Vali RO
            Jan 7 at 12:34










          • $begingroup$
            You're welcome!
            $endgroup$
            – Stefan Lafon
            Jan 7 at 16:57
















          1












          $begingroup$

          You can prove by induction that $x_ngeq 1$. This implies that for all $ngeq 0$, $$x_{n+1}-x_ngeq frac 1 a$$
          Summing this up leads to $$x_ngeq 1 + frac n a$$
          So, clearly, $x_nrightarrow +infty$ as $nrightarrow +infty$.



          The trick is to look for an estimate of $u_n = x_n^a$.
          Note that just like $(x_n)_{ngeq 0}$, $(u_n)_{n geq 0}$ tends to $+infty$, so we can use the appropriate Taylor expansion:
          $$begin{split}
          u_{n+1} &= left (x_n + frac 1 a x_n^{1-a}right)^a\
          &= u_n left (1 + frac 1 a frac 1 {u_n}right)^{a}\
          &= u_n left (1 + frac 1 {u_n} + oleft (frac 1 {u_n}right)right)\
          &= u_n +1 +o(1)
          end{split}$$

          So summing this up leads to $u_n=n+o(n)$, which implies that
          $$lim_{nrightarrow +infty} frac {x_n^a}n = 1$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks a lot! :)
            $endgroup$
            – Vali RO
            Jan 7 at 12:34










          • $begingroup$
            You're welcome!
            $endgroup$
            – Stefan Lafon
            Jan 7 at 16:57














          1












          1








          1





          $begingroup$

          You can prove by induction that $x_ngeq 1$. This implies that for all $ngeq 0$, $$x_{n+1}-x_ngeq frac 1 a$$
          Summing this up leads to $$x_ngeq 1 + frac n a$$
          So, clearly, $x_nrightarrow +infty$ as $nrightarrow +infty$.



          The trick is to look for an estimate of $u_n = x_n^a$.
          Note that just like $(x_n)_{ngeq 0}$, $(u_n)_{n geq 0}$ tends to $+infty$, so we can use the appropriate Taylor expansion:
          $$begin{split}
          u_{n+1} &= left (x_n + frac 1 a x_n^{1-a}right)^a\
          &= u_n left (1 + frac 1 a frac 1 {u_n}right)^{a}\
          &= u_n left (1 + frac 1 {u_n} + oleft (frac 1 {u_n}right)right)\
          &= u_n +1 +o(1)
          end{split}$$

          So summing this up leads to $u_n=n+o(n)$, which implies that
          $$lim_{nrightarrow +infty} frac {x_n^a}n = 1$$






          share|cite|improve this answer









          $endgroup$



          You can prove by induction that $x_ngeq 1$. This implies that for all $ngeq 0$, $$x_{n+1}-x_ngeq frac 1 a$$
          Summing this up leads to $$x_ngeq 1 + frac n a$$
          So, clearly, $x_nrightarrow +infty$ as $nrightarrow +infty$.



          The trick is to look for an estimate of $u_n = x_n^a$.
          Note that just like $(x_n)_{ngeq 0}$, $(u_n)_{n geq 0}$ tends to $+infty$, so we can use the appropriate Taylor expansion:
          $$begin{split}
          u_{n+1} &= left (x_n + frac 1 a x_n^{1-a}right)^a\
          &= u_n left (1 + frac 1 a frac 1 {u_n}right)^{a}\
          &= u_n left (1 + frac 1 {u_n} + oleft (frac 1 {u_n}right)right)\
          &= u_n +1 +o(1)
          end{split}$$

          So summing this up leads to $u_n=n+o(n)$, which implies that
          $$lim_{nrightarrow +infty} frac {x_n^a}n = 1$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 7 at 5:41









          Stefan LafonStefan Lafon

          3,005212




          3,005212












          • $begingroup$
            Thanks a lot! :)
            $endgroup$
            – Vali RO
            Jan 7 at 12:34










          • $begingroup$
            You're welcome!
            $endgroup$
            – Stefan Lafon
            Jan 7 at 16:57


















          • $begingroup$
            Thanks a lot! :)
            $endgroup$
            – Vali RO
            Jan 7 at 12:34










          • $begingroup$
            You're welcome!
            $endgroup$
            – Stefan Lafon
            Jan 7 at 16:57
















          $begingroup$
          Thanks a lot! :)
          $endgroup$
          – Vali RO
          Jan 7 at 12:34




          $begingroup$
          Thanks a lot! :)
          $endgroup$
          – Vali RO
          Jan 7 at 12:34












          $begingroup$
          You're welcome!
          $endgroup$
          – Stefan Lafon
          Jan 7 at 16:57




          $begingroup$
          You're welcome!
          $endgroup$
          – Stefan Lafon
          Jan 7 at 16:57


















          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%2f3062679%2fa-limit-of-recurrence-relation%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

          Wiesbaden

          Marschland

          Dieringhausen