sequence of $a^n$












0














I am trying to show that when a $in Bbb R$ with $lvert arvert < 1$ the limit $lim_{nto+infty} a^n = 0$ using the definition of convergence of a sequence. So far I have



$lvert a^n - 0rvert < epsilon$



$lvert a^n rvert < epsilon$



$lvert arvert^n < epsilon$



and



$lvert a rvert < 1 $ $implies$ $lvert arvert^n < 1$



But I don't see where I am supposed to head with this in order to prove it? any advice would be greatly appreciated in understanding this. Thank you.










share|cite|improve this question
























  • For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
    – Stockfish
    Nov 29 '18 at 13:47


















0














I am trying to show that when a $in Bbb R$ with $lvert arvert < 1$ the limit $lim_{nto+infty} a^n = 0$ using the definition of convergence of a sequence. So far I have



$lvert a^n - 0rvert < epsilon$



$lvert a^n rvert < epsilon$



$lvert arvert^n < epsilon$



and



$lvert a rvert < 1 $ $implies$ $lvert arvert^n < 1$



But I don't see where I am supposed to head with this in order to prove it? any advice would be greatly appreciated in understanding this. Thank you.










share|cite|improve this question
























  • For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
    – Stockfish
    Nov 29 '18 at 13:47
















0












0








0







I am trying to show that when a $in Bbb R$ with $lvert arvert < 1$ the limit $lim_{nto+infty} a^n = 0$ using the definition of convergence of a sequence. So far I have



$lvert a^n - 0rvert < epsilon$



$lvert a^n rvert < epsilon$



$lvert arvert^n < epsilon$



and



$lvert a rvert < 1 $ $implies$ $lvert arvert^n < 1$



But I don't see where I am supposed to head with this in order to prove it? any advice would be greatly appreciated in understanding this. Thank you.










share|cite|improve this question















I am trying to show that when a $in Bbb R$ with $lvert arvert < 1$ the limit $lim_{nto+infty} a^n = 0$ using the definition of convergence of a sequence. So far I have



$lvert a^n - 0rvert < epsilon$



$lvert a^n rvert < epsilon$



$lvert arvert^n < epsilon$



and



$lvert a rvert < 1 $ $implies$ $lvert arvert^n < 1$



But I don't see where I am supposed to head with this in order to prove it? any advice would be greatly appreciated in understanding this. Thank you.







sequences-and-series analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 '18 at 14:10









Tianlalu

3,08121038




3,08121038










asked Nov 29 '18 at 13:45









adsy9adsy9

32




32












  • For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
    – Stockfish
    Nov 29 '18 at 13:47




















  • For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
    – Stockfish
    Nov 29 '18 at 13:47


















For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
– Stockfish
Nov 29 '18 at 13:47






For given $varepsilon >0$, you have to find $N$ such that for every $n>N$ $|a|^n < varepsilon$ holds. Note that $N$ may depend on $a$. Note further that $n mapsto |a|^n$ is decreasing.
– Stockfish
Nov 29 '18 at 13:47












2 Answers
2






active

oldest

votes


















2














By taking $ln$ from both sides we have $$nln |a|<ln epsilon$$and since $ln |a|<0$ (because $0<|a|<1$) we obtain $$n>{ln epsilonover ln |a|}$$therefore choose $N={ln epsilonover ln |a|}$ and you can conclude for any $n>N$ that $|a|^n<epsilon$ and the proof is complete.






share|cite|improve this answer





























    0














    If $|a|<1$, then $1/|a|>1$, hence $frac{1}{|a|}=1+h$ with some $h>0$. Then we get, with Bernoulli's inequality:



    $frac{1}{|a^n|}=(1+h)^n ge 1+nh > nh.$



    Thus



    $|a^n| < frac{1}{nh}$.



    Can you proceed ?






    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',
      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%2f3018635%2fsequence-of-an%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









      2














      By taking $ln$ from both sides we have $$nln |a|<ln epsilon$$and since $ln |a|<0$ (because $0<|a|<1$) we obtain $$n>{ln epsilonover ln |a|}$$therefore choose $N={ln epsilonover ln |a|}$ and you can conclude for any $n>N$ that $|a|^n<epsilon$ and the proof is complete.






      share|cite|improve this answer


























        2














        By taking $ln$ from both sides we have $$nln |a|<ln epsilon$$and since $ln |a|<0$ (because $0<|a|<1$) we obtain $$n>{ln epsilonover ln |a|}$$therefore choose $N={ln epsilonover ln |a|}$ and you can conclude for any $n>N$ that $|a|^n<epsilon$ and the proof is complete.






        share|cite|improve this answer
























          2












          2








          2






          By taking $ln$ from both sides we have $$nln |a|<ln epsilon$$and since $ln |a|<0$ (because $0<|a|<1$) we obtain $$n>{ln epsilonover ln |a|}$$therefore choose $N={ln epsilonover ln |a|}$ and you can conclude for any $n>N$ that $|a|^n<epsilon$ and the proof is complete.






          share|cite|improve this answer












          By taking $ln$ from both sides we have $$nln |a|<ln epsilon$$and since $ln |a|<0$ (because $0<|a|<1$) we obtain $$n>{ln epsilonover ln |a|}$$therefore choose $N={ln epsilonover ln |a|}$ and you can conclude for any $n>N$ that $|a|^n<epsilon$ and the proof is complete.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 29 '18 at 13:49









          Mostafa AyazMostafa Ayaz

          14.5k3937




          14.5k3937























              0














              If $|a|<1$, then $1/|a|>1$, hence $frac{1}{|a|}=1+h$ with some $h>0$. Then we get, with Bernoulli's inequality:



              $frac{1}{|a^n|}=(1+h)^n ge 1+nh > nh.$



              Thus



              $|a^n| < frac{1}{nh}$.



              Can you proceed ?






              share|cite|improve this answer


























                0














                If $|a|<1$, then $1/|a|>1$, hence $frac{1}{|a|}=1+h$ with some $h>0$. Then we get, with Bernoulli's inequality:



                $frac{1}{|a^n|}=(1+h)^n ge 1+nh > nh.$



                Thus



                $|a^n| < frac{1}{nh}$.



                Can you proceed ?






                share|cite|improve this answer
























                  0












                  0








                  0






                  If $|a|<1$, then $1/|a|>1$, hence $frac{1}{|a|}=1+h$ with some $h>0$. Then we get, with Bernoulli's inequality:



                  $frac{1}{|a^n|}=(1+h)^n ge 1+nh > nh.$



                  Thus



                  $|a^n| < frac{1}{nh}$.



                  Can you proceed ?






                  share|cite|improve this answer












                  If $|a|<1$, then $1/|a|>1$, hence $frac{1}{|a|}=1+h$ with some $h>0$. Then we get, with Bernoulli's inequality:



                  $frac{1}{|a^n|}=(1+h)^n ge 1+nh > nh.$



                  Thus



                  $|a^n| < frac{1}{nh}$.



                  Can you proceed ?







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 29 '18 at 13:51









                  FredFred

                  44.4k1845




                  44.4k1845






























                      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.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • 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.


                      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%2f3018635%2fsequence-of-an%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

                      Ellipse (mathématiques)

                      Quarter-circle Tiles

                      Mont Emei