Show that sequence is a Cauchy sequence












2












$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac{1}{2}+frac{1}{3}-frac{1}{4}+.....+frac{(-1)^{n-1}}{n}$$



is a Cauchy sequence



My attempt :
$|f_{n}-f_{m}|=Biggl|dfrac{(-1)^{m}}{m+1}+dfrac{(-1)^{m+1}}{m+2}cdotsdots+dfrac{(-1)^{n-1}}{n}Biggr|$



using $ m+1>m implies dfrac{1}{m+1}<dfrac{1}{m} $



$|f_{n}-f_{m}|le dfrac{1}{m}+dfrac{1}{m}+dfrac{1}{m}cdotscdotsdfrac{1}{m}$



$|f_{n}-f_{m}|ledfrac{n-m}{m}$



I don't know if I am proceeding correctly or if I am, how to proceed further, any hint would be really helpful .






sequences-and-series cauchy-sequences







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    4 hours ago






  • 1




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    4 hours ago
















2












$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac{1}{2}+frac{1}{3}-frac{1}{4}+.....+frac{(-1)^{n-1}}{n}$$



is a Cauchy sequence



My attempt :
$|f_{n}-f_{m}|=Biggl|dfrac{(-1)^{m}}{m+1}+dfrac{(-1)^{m+1}}{m+2}cdotsdots+dfrac{(-1)^{n-1}}{n}Biggr|$



using $ m+1>m implies dfrac{1}{m+1}<dfrac{1}{m} $



$|f_{n}-f_{m}|le dfrac{1}{m}+dfrac{1}{m}+dfrac{1}{m}cdotscdotsdfrac{1}{m}$



$|f_{n}-f_{m}|ledfrac{n-m}{m}$



I don't know if I am proceeding correctly or if I am, how to proceed further, any hint would be really helpful .






sequences-and-series cauchy-sequences







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    4 hours ago






  • 1




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    4 hours ago














2












2








2





$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac{1}{2}+frac{1}{3}-frac{1}{4}+.....+frac{(-1)^{n-1}}{n}$$



is a Cauchy sequence



My attempt :
$|f_{n}-f_{m}|=Biggl|dfrac{(-1)^{m}}{m+1}+dfrac{(-1)^{m+1}}{m+2}cdotsdots+dfrac{(-1)^{n-1}}{n}Biggr|$



using $ m+1>m implies dfrac{1}{m+1}<dfrac{1}{m} $



$|f_{n}-f_{m}|le dfrac{1}{m}+dfrac{1}{m}+dfrac{1}{m}cdotscdotsdfrac{1}{m}$



$|f_{n}-f_{m}|ledfrac{n-m}{m}$



I don't know if I am proceeding correctly or if I am, how to proceed further, any hint would be really helpful .






sequences-and-series cauchy-sequences







share|cite|improve this question











$endgroup$




Prove that given sequence $$langle f_nrangle =1-frac{1}{2}+frac{1}{3}-frac{1}{4}+.....+frac{(-1)^{n-1}}{n}$$



is a Cauchy sequence



My attempt :
$|f_{n}-f_{m}|=Biggl|dfrac{(-1)^{m}}{m+1}+dfrac{(-1)^{m+1}}{m+2}cdotsdots+dfrac{(-1)^{n-1}}{n}Biggr|$



using $ m+1>m implies dfrac{1}{m+1}<dfrac{1}{m} $



$|f_{n}-f_{m}|le dfrac{1}{m}+dfrac{1}{m}+dfrac{1}{m}cdotscdotsdfrac{1}{m}$



$|f_{n}-f_{m}|ledfrac{n-m}{m}$



I don't know if I am proceeding correctly or if I am, how to proceed further, any hint would be really helpful .






sequences-and-series cauchy-sequences




sequences-and-series cauchy-sequences






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 4 hours ago









Bernard

121k740116




121k740116










asked 4 hours ago









kira0705kira0705

1167




1167








  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    4 hours ago






  • 1




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    4 hours ago














  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    4 hours ago






  • 1




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    4 hours ago








1




1




$begingroup$
Well, the limit of the sequence because of Leibniz' criterion.
$endgroup$
– egreg
4 hours ago




$begingroup$
Well, the limit of the sequence because of Leibniz' criterion.
$endgroup$
– egreg
4 hours ago




1




1




$begingroup$
Hint: a convergent sequence is Cauchy.
$endgroup$
– Bernard
4 hours ago




$begingroup$
Hint: a convergent sequence is Cauchy.
$endgroup$
– Bernard
4 hours ago










3 Answers
3






active

oldest

votes


















2












$begingroup$

If you ignore the signs of the terms,
the result diverges.
So you can't do that.



$f_n
=sum_{k=1}^n dfrac{(-1)^k}{k}
$
so,
if $n > m$,
$f_n-f_m
=sum_{k=m+1}^n dfrac{(-1)^k}{k}
=sum_{k=1}^{n-m} dfrac{(-1)^{k+m}}{k+m}
=(-1)^msum_{k=1}^{n-m} dfrac{(-1)^{k}}{k+m}
$.



If
$n-m$ is even,
so $n-m = 2j$,
then



$begin{array}\
f_n-f_m
&=(-1)^msum_{k=1}^{2j} dfrac{(-1)^{k}}{k+m}\
&=(-1)^msum_{k=1}^{j} left(dfrac{(-1)^{2k-1}}{2k-1+m}+dfrac{(-1)^{2k}}{2k+m}right)\
&=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{-1}{2k-1+m}+dfrac{1}{2k+m}right)\
&=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{(2k-1+m)-(2k+m)}{(2k-1+m)(2k+m)}right)\
&=(-1)^{m+1}sum_{k=1}^{j} left(dfrac{-1}{(2k-1+m)(2k+m)}right)\
&=(-1)^{m}sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
text{so}\
|f_n-f_m|
&=sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
&=sum_{k=1}^{j}dfrac14 left(dfrac{1}{(k-frac12+frac{m}{2})(k+frac{m}{2})}right)\
&lt dfrac14sum_{k=1}^{j} left(dfrac{1}{(k-1+frac{m}{2})(k+frac{m}{2})}right)
quadtext{this is the sneaky part}\
&lt dfrac14sum_{k=1}^{j} left(dfrac{1}{k-1+frac{m}{2}}-dfrac{1}{k+frac{m}{2}}right)\
&= dfrac14 left(dfrac{1}{frac{m}{2}}-dfrac{1}{j+frac{m}{2}}right)\
&= dfrac12 left(dfrac{1}{m}-dfrac{1}{2j+m}right)\
&= dfrac12 left(dfrac{1}{m}-dfrac{1}{n}right)\
&< dfrac{1}{2m}\
&to 0 text{ as } m to infty\
end{array}
$



If $n-m$ is odd,
the sum changes
by at most $frac1{n}$
so it still goes to zero.






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
    $endgroup$
    – kira0705
    3 hours ago



















2












$begingroup$

Hint :



$$frac{1}{2n-1}-frac{1}{2n}=frac{1}{(2n-1)2n}leq frac{1}{(n-1)n}= frac{1}{n-1}-frac{1}{n} $$






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    Fix $epsilon > 0$, then for $n > frac{2}{sqrt{epsilon}}$ (So since both sides of the inequality are positive, $n^2 > frac{4}{epsilon} implies frac{epsilon}{2} > frac{2}{n^2}$), observe that $$|f_n - f_{n+1}| = |frac{1}{n} + frac{1}{n+1}| = |frac{n+2}{n(n+1)}| = frac{n+2}{n(n+1)} < frac{n+2}{n^2} =frac{1}{n} +frac{2}{n^2} < frac{1}{frac{2}{sqrt{epsilon}}} + frac{epsilon}{2} = frac{sqrt{epsilon}}{2} + frac{epsilon}{2} < frac{epsilon}{2} + frac{epsilon}{2} = epsilon $$






    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%2f3123120%2fshow-that-sequence-is-a-cauchy-sequence%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$

      If you ignore the signs of the terms,
      the result diverges.
      So you can't do that.



      $f_n
      =sum_{k=1}^n dfrac{(-1)^k}{k}
      $
      so,
      if $n > m$,
      $f_n-f_m
      =sum_{k=m+1}^n dfrac{(-1)^k}{k}
      =sum_{k=1}^{n-m} dfrac{(-1)^{k+m}}{k+m}
      =(-1)^msum_{k=1}^{n-m} dfrac{(-1)^{k}}{k+m}
      $      .



      If
      $n-m$ is even,
      so $n-m = 2j$,
      then



      $begin{array}\
      f_n-f_m
      &=(-1)^msum_{k=1}^{2j} dfrac{(-1)^{k}}{k+m}\
      &=(-1)^msum_{k=1}^{j} left(dfrac{(-1)^{2k-1}}{2k-1+m}+dfrac{(-1)^{2k}}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{-1}{2k-1+m}+dfrac{1}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{(2k-1+m)-(2k+m)}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m+1}sum_{k=1}^{j} left(dfrac{-1}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m}sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      text{so}\
      |f_n-f_m|
      &=sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      &=sum_{k=1}^{j}dfrac14 left(dfrac{1}{(k-frac12+frac{m}{2})(k+frac{m}{2})}right)\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{(k-1+frac{m}{2})(k+frac{m}{2})}right)
      quadtext{this is the sneaky part}\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{k-1+frac{m}{2}}-dfrac{1}{k+frac{m}{2}}right)\
      &= dfrac14 left(dfrac{1}{frac{m}{2}}-dfrac{1}{j+frac{m}{2}}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{2j+m}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{n}right)\
      &< dfrac{1}{2m}\
      &to 0 text{ as } m to infty\
      end{array}
      $



      If $n-m$ is odd,
      the sum changes
      by at most $frac1{n}$
      so it still goes to zero.






      share|cite|improve this answer









      $endgroup$









      • 1




        $begingroup$
        Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
        $endgroup$
        – kira0705
        3 hours ago
















      2












      $begingroup$

      If you ignore the signs of the terms,
      the result diverges.
      So you can't do that.



      $f_n
      =sum_{k=1}^n dfrac{(-1)^k}{k}
      $
      so,
      if $n > m$,
      $f_n-f_m
      =sum_{k=m+1}^n dfrac{(-1)^k}{k}
      =sum_{k=1}^{n-m} dfrac{(-1)^{k+m}}{k+m}
      =(-1)^msum_{k=1}^{n-m} dfrac{(-1)^{k}}{k+m}
      $      .



      If
      $n-m$ is even,
      so $n-m = 2j$,
      then



      $begin{array}\
      f_n-f_m
      &=(-1)^msum_{k=1}^{2j} dfrac{(-1)^{k}}{k+m}\
      &=(-1)^msum_{k=1}^{j} left(dfrac{(-1)^{2k-1}}{2k-1+m}+dfrac{(-1)^{2k}}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{-1}{2k-1+m}+dfrac{1}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{(2k-1+m)-(2k+m)}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m+1}sum_{k=1}^{j} left(dfrac{-1}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m}sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      text{so}\
      |f_n-f_m|
      &=sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      &=sum_{k=1}^{j}dfrac14 left(dfrac{1}{(k-frac12+frac{m}{2})(k+frac{m}{2})}right)\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{(k-1+frac{m}{2})(k+frac{m}{2})}right)
      quadtext{this is the sneaky part}\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{k-1+frac{m}{2}}-dfrac{1}{k+frac{m}{2}}right)\
      &= dfrac14 left(dfrac{1}{frac{m}{2}}-dfrac{1}{j+frac{m}{2}}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{2j+m}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{n}right)\
      &< dfrac{1}{2m}\
      &to 0 text{ as } m to infty\
      end{array}
      $



      If $n-m$ is odd,
      the sum changes
      by at most $frac1{n}$
      so it still goes to zero.






      share|cite|improve this answer









      $endgroup$









      • 1




        $begingroup$
        Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
        $endgroup$
        – kira0705
        3 hours ago














      2












      2








      2





      $begingroup$

      If you ignore the signs of the terms,
      the result diverges.
      So you can't do that.



      $f_n
      =sum_{k=1}^n dfrac{(-1)^k}{k}
      $
      so,
      if $n > m$,
      $f_n-f_m
      =sum_{k=m+1}^n dfrac{(-1)^k}{k}
      =sum_{k=1}^{n-m} dfrac{(-1)^{k+m}}{k+m}
      =(-1)^msum_{k=1}^{n-m} dfrac{(-1)^{k}}{k+m}
      $      .



      If
      $n-m$ is even,
      so $n-m = 2j$,
      then



      $begin{array}\
      f_n-f_m
      &=(-1)^msum_{k=1}^{2j} dfrac{(-1)^{k}}{k+m}\
      &=(-1)^msum_{k=1}^{j} left(dfrac{(-1)^{2k-1}}{2k-1+m}+dfrac{(-1)^{2k}}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{-1}{2k-1+m}+dfrac{1}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{(2k-1+m)-(2k+m)}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m+1}sum_{k=1}^{j} left(dfrac{-1}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m}sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      text{so}\
      |f_n-f_m|
      &=sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      &=sum_{k=1}^{j}dfrac14 left(dfrac{1}{(k-frac12+frac{m}{2})(k+frac{m}{2})}right)\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{(k-1+frac{m}{2})(k+frac{m}{2})}right)
      quadtext{this is the sneaky part}\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{k-1+frac{m}{2}}-dfrac{1}{k+frac{m}{2}}right)\
      &= dfrac14 left(dfrac{1}{frac{m}{2}}-dfrac{1}{j+frac{m}{2}}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{2j+m}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{n}right)\
      &< dfrac{1}{2m}\
      &to 0 text{ as } m to infty\
      end{array}
      $



      If $n-m$ is odd,
      the sum changes
      by at most $frac1{n}$
      so it still goes to zero.






      share|cite|improve this answer









      $endgroup$



      If you ignore the signs of the terms,
      the result diverges.
      So you can't do that.



      $f_n
      =sum_{k=1}^n dfrac{(-1)^k}{k}
      $
      so,
      if $n > m$,
      $f_n-f_m
      =sum_{k=m+1}^n dfrac{(-1)^k}{k}
      =sum_{k=1}^{n-m} dfrac{(-1)^{k+m}}{k+m}
      =(-1)^msum_{k=1}^{n-m} dfrac{(-1)^{k}}{k+m}
      $      .



      If
      $n-m$ is even,
      so $n-m = 2j$,
      then



      $begin{array}\
      f_n-f_m
      &=(-1)^msum_{k=1}^{2j} dfrac{(-1)^{k}}{k+m}\
      &=(-1)^msum_{k=1}^{j} left(dfrac{(-1)^{2k-1}}{2k-1+m}+dfrac{(-1)^{2k}}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{-1}{2k-1+m}+dfrac{1}{2k+m}right)\
      &=(-1)^msum_{k=1}^{j} (-1)^{2k-1}left(dfrac{(2k-1+m)-(2k+m)}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m+1}sum_{k=1}^{j} left(dfrac{-1}{(2k-1+m)(2k+m)}right)\
      &=(-1)^{m}sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      text{so}\
      |f_n-f_m|
      &=sum_{k=1}^{j} left(dfrac{1}{(2k-1+m)(2k+m)}right)\
      &=sum_{k=1}^{j}dfrac14 left(dfrac{1}{(k-frac12+frac{m}{2})(k+frac{m}{2})}right)\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{(k-1+frac{m}{2})(k+frac{m}{2})}right)
      quadtext{this is the sneaky part}\
      &lt dfrac14sum_{k=1}^{j} left(dfrac{1}{k-1+frac{m}{2}}-dfrac{1}{k+frac{m}{2}}right)\
      &= dfrac14 left(dfrac{1}{frac{m}{2}}-dfrac{1}{j+frac{m}{2}}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{2j+m}right)\
      &= dfrac12 left(dfrac{1}{m}-dfrac{1}{n}right)\
      &< dfrac{1}{2m}\
      &to 0 text{ as } m to infty\
      end{array}
      $



      If $n-m$ is odd,
      the sum changes
      by at most $frac1{n}$
      so it still goes to zero.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered 3 hours ago









      marty cohenmarty cohen

      73.8k549128




      73.8k549128








      • 1




        $begingroup$
        Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
        $endgroup$
        – kira0705
        3 hours ago














      • 1




        $begingroup$
        Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
        $endgroup$
        – kira0705
        3 hours ago








      1




      1




      $begingroup$
      Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
      $endgroup$
      – kira0705
      3 hours ago




      $begingroup$
      Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
      $endgroup$
      – kira0705
      3 hours ago











      2












      $begingroup$

      Hint :



      $$frac{1}{2n-1}-frac{1}{2n}=frac{1}{(2n-1)2n}leq frac{1}{(n-1)n}= frac{1}{n-1}-frac{1}{n} $$






      share|cite|improve this answer









      $endgroup$


















        2












        $begingroup$

        Hint :



        $$frac{1}{2n-1}-frac{1}{2n}=frac{1}{(2n-1)2n}leq frac{1}{(n-1)n}= frac{1}{n-1}-frac{1}{n} $$






        share|cite|improve this answer









        $endgroup$
















          2












          2








          2





          $begingroup$

          Hint :



          $$frac{1}{2n-1}-frac{1}{2n}=frac{1}{(2n-1)2n}leq frac{1}{(n-1)n}= frac{1}{n-1}-frac{1}{n} $$






          share|cite|improve this answer









          $endgroup$



          Hint :



          $$frac{1}{2n-1}-frac{1}{2n}=frac{1}{(2n-1)2n}leq frac{1}{(n-1)n}= frac{1}{n-1}-frac{1}{n} $$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 3 hours ago









          Clément GuérinClément Guérin

          10k1736




          10k1736























              0












              $begingroup$

              Fix $epsilon > 0$, then for $n > frac{2}{sqrt{epsilon}}$ (So since both sides of the inequality are positive, $n^2 > frac{4}{epsilon} implies frac{epsilon}{2} > frac{2}{n^2}$), observe that $$|f_n - f_{n+1}| = |frac{1}{n} + frac{1}{n+1}| = |frac{n+2}{n(n+1)}| = frac{n+2}{n(n+1)} < frac{n+2}{n^2} =frac{1}{n} +frac{2}{n^2} < frac{1}{frac{2}{sqrt{epsilon}}} + frac{epsilon}{2} = frac{sqrt{epsilon}}{2} + frac{epsilon}{2} < frac{epsilon}{2} + frac{epsilon}{2} = epsilon $$






              share|cite|improve this answer











              $endgroup$


















                0












                $begingroup$

                Fix $epsilon > 0$, then for $n > frac{2}{sqrt{epsilon}}$ (So since both sides of the inequality are positive, $n^2 > frac{4}{epsilon} implies frac{epsilon}{2} > frac{2}{n^2}$), observe that $$|f_n - f_{n+1}| = |frac{1}{n} + frac{1}{n+1}| = |frac{n+2}{n(n+1)}| = frac{n+2}{n(n+1)} < frac{n+2}{n^2} =frac{1}{n} +frac{2}{n^2} < frac{1}{frac{2}{sqrt{epsilon}}} + frac{epsilon}{2} = frac{sqrt{epsilon}}{2} + frac{epsilon}{2} < frac{epsilon}{2} + frac{epsilon}{2} = epsilon $$






                share|cite|improve this answer











                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  Fix $epsilon > 0$, then for $n > frac{2}{sqrt{epsilon}}$ (So since both sides of the inequality are positive, $n^2 > frac{4}{epsilon} implies frac{epsilon}{2} > frac{2}{n^2}$), observe that $$|f_n - f_{n+1}| = |frac{1}{n} + frac{1}{n+1}| = |frac{n+2}{n(n+1)}| = frac{n+2}{n(n+1)} < frac{n+2}{n^2} =frac{1}{n} +frac{2}{n^2} < frac{1}{frac{2}{sqrt{epsilon}}} + frac{epsilon}{2} = frac{sqrt{epsilon}}{2} + frac{epsilon}{2} < frac{epsilon}{2} + frac{epsilon}{2} = epsilon $$






                  share|cite|improve this answer











                  $endgroup$



                  Fix $epsilon > 0$, then for $n > frac{2}{sqrt{epsilon}}$ (So since both sides of the inequality are positive, $n^2 > frac{4}{epsilon} implies frac{epsilon}{2} > frac{2}{n^2}$), observe that $$|f_n - f_{n+1}| = |frac{1}{n} + frac{1}{n+1}| = |frac{n+2}{n(n+1)}| = frac{n+2}{n(n+1)} < frac{n+2}{n^2} =frac{1}{n} +frac{2}{n^2} < frac{1}{frac{2}{sqrt{epsilon}}} + frac{epsilon}{2} = frac{sqrt{epsilon}}{2} + frac{epsilon}{2} < frac{epsilon}{2} + frac{epsilon}{2} = epsilon $$







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited 3 hours ago

























                  answered 3 hours ago









                  user516079user516079

                  318210




                  318210






























                      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%2f3123120%2fshow-that-sequence-is-a-cauchy-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

                      Fluorita

                      Image
                      Fluorita Fluorita (blau) amb pirita (daurat). Fórmula química CaF 2 Epònim fluor Localitat tipus Jáchymov Classificació Categoria Halurs Nickel-Strunz 10a ed. 3.AB.25 Nickel-Strunz 9a ed. 3.AB.25 Nickel-Strunz 8a ed. III/A.08 Dana 9.2.1.1 Heys 8.4.7 Propietats Sistema cristal·lí Cúbic Hàbit cristal·lí Sol presentar cubs; menys freqüentment dodecaedres. De vegades hexaoctaedres i tetrahexaedres. Per la combinació d'aquestes formes, les arestes dels cubs són sovint modificades. De vegades els cristalls poden presentar diferències de creixement entre les cares. Sovint s'observen cristalls compostos per sobrecreixement. Pot ser massiva, compacta, terrosa, columnar (poc freqüent), globular en agregats o botroïdal. Estructura cristal·lina a = 5.4626Å Simetria Classe (H-M): m 3 m (4/ m 3 2/ m ) - Hexoctaèdric; Grup espacial: Fm 3 m Color Blanc, groc, verd, violeta, vermell, rosa, blau o negre Mac...
                      Read more

                      Hulsita

                      Image
                      Hulsita Hulsita de la localitat tipus Fórmula química Fe 2+ 2 Fe 3+ O 2 BO 3 Epònim Alfred Hulse Brooks Localitat tipus mont Brooks, península de Seward, Nome Borough, Alaska, Estats Units Classificació Categoria borats Nickel-Strunz 10a ed. 6.AB.45 Nickel-Strunz 9a ed. 6.AB.45 Nickel-Strunz 8a ed. V/G.03 Dana 24.2.3.1 Heys 9.6.4 Propietats Sistema cristal·lí monoclínic Estructura cristal·lina a = 10,68Å; b = 3,09Å; c = 5,43Å; β = 94,15° Color negre Macles en [001]; un membre de la macla es troba girat 120° en relació a l'altre Exfoliació bona en {110} Duresa 3 Lluïssor vítria, submetàl·lica Densitat 4,28 g/cm 3 (mesurada); Més informació Estatus IMA mineral heretat (G) i mineral heretat (G) Any d'aprovació 1908 Referències [1] La hulsita és un mineral de la classe dels borats, que pertany al grup de la pinakiolita. Rep el seu nom en honor del nord-americà ...
                      Read more

                      Península de Txukotka

                      Image
                      Península de Txukotka Tipus Península Ubicació 66° N, 172° O  /  66°N , 172°O  / 66; -172 Mar mar dels Txuktxis La península de Txukotka a l'extrem oriental de Sibèria La península de Txukotka o península dels Txuktxis (en rus Чуко́тский полуо́стров , Txukotski poluóstrov ) és una península que es troba a l'extrem oriental d'Euràsia. Contingut 1 Descripció 2 Població 3 Vegeu també 4 Bibliografia Descripció L'estret de Bering, entre la península de Txukotka i la península de Seward a Alaska Foto de satèl·lit de la zona amb la península de Txukotka a l'esquerra El seu punt més extrem és el cap Dezhnev a la vora del nucli d'Uelen, un dels poquíssims llocs habitats de la zona. Al nord limita amb el mar dels Txuktxis i amb el mar de Bering al sud i amb l'estret de Bering a l'est. A la costa sud es troben la badia de Sant Lawrence i la badia de Kresta. La penínsu...
                      Read more