Show that sequence is a Cauchy sequence

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP












2












$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac12+frac13-frac14+.....+frac(-1)^n-1n$$



is a Cauchy sequence



My attempt :
$|f_n-f_m|=Biggl|dfrac(-1)^mm+1+dfrac(-1)^m+1m+2cdotsdots+dfrac(-1)^n-1nBiggr|$



using $ m+1>m implies dfrac1m+1<dfrac1m $



$|f_n-f_m|le dfrac1m+dfrac1m+dfrac1mcdotscdotsdfrac1m$



$|f_n-f_m|ledfracn-mm$



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










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    Feb 22 at 22:15






  • 3




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    Feb 22 at 22:16















2












$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac12+frac13-frac14+.....+frac(-1)^n-1n$$



is a Cauchy sequence



My attempt :
$|f_n-f_m|=Biggl|dfrac(-1)^mm+1+dfrac(-1)^m+1m+2cdotsdots+dfrac(-1)^n-1nBiggr|$



using $ m+1>m implies dfrac1m+1<dfrac1m $



$|f_n-f_m|le dfrac1m+dfrac1m+dfrac1mcdotscdotsdfrac1m$



$|f_n-f_m|ledfracn-mm$



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










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    Feb 22 at 22:15






  • 3




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    Feb 22 at 22:16













2












2








2





$begingroup$


Prove that given sequence $$langle f_nrangle =1-frac12+frac13-frac14+.....+frac(-1)^n-1n$$



is a Cauchy sequence



My attempt :
$|f_n-f_m|=Biggl|dfrac(-1)^mm+1+dfrac(-1)^m+1m+2cdotsdots+dfrac(-1)^n-1nBiggr|$



using $ m+1>m implies dfrac1m+1<dfrac1m $



$|f_n-f_m|le dfrac1m+dfrac1m+dfrac1mcdotscdotsdfrac1m$



$|f_n-f_m|ledfracn-mm$



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










share|cite|improve this question











$endgroup$




Prove that given sequence $$langle f_nrangle =1-frac12+frac13-frac14+.....+frac(-1)^n-1n$$



is a Cauchy sequence



My attempt :
$|f_n-f_m|=Biggl|dfrac(-1)^mm+1+dfrac(-1)^m+1m+2cdotsdots+dfrac(-1)^n-1nBiggr|$



using $ m+1>m implies dfrac1m+1<dfrac1m $



$|f_n-f_m|le dfrac1m+dfrac1m+dfrac1mcdotscdotsdfrac1m$



$|f_n-f_m|ledfracn-mm$



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















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 22 at 22:16









Bernard

123k741117




123k741117










asked Feb 22 at 22:03









kira0705kira0705

1167




1167







  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    Feb 22 at 22:15






  • 3




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    Feb 22 at 22:16












  • 1




    $begingroup$
    Well, the limit of the sequence because of Leibniz' criterion.
    $endgroup$
    – egreg
    Feb 22 at 22:15






  • 3




    $begingroup$
    Hint: a convergent sequence is Cauchy.
    $endgroup$
    – Bernard
    Feb 22 at 22:16







1




1




$begingroup$
Well, the limit of the sequence because of Leibniz' criterion.
$endgroup$
– egreg
Feb 22 at 22:15




$begingroup$
Well, the limit of the sequence because of Leibniz' criterion.
$endgroup$
– egreg
Feb 22 at 22:15




3




3




$begingroup$
Hint: a convergent sequence is Cauchy.
$endgroup$
– Bernard
Feb 22 at 22:16




$begingroup$
Hint: a convergent sequence is Cauchy.
$endgroup$
– Bernard
Feb 22 at 22:16










2 Answers
2






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)^kk
$

so,
if $n > m$,
$f_n-f_m
=sum_k=m+1^n dfrac(-1)^kk
=sum_k=1^n-m dfrac(-1)^k+mk+m
=(-1)^msum_k=1^n-m dfrac(-1)^kk+m
$
.



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



$beginarray\
f_n-f_m
&=(-1)^msum_k=1^2j dfrac(-1)^kk+m\
&=(-1)^msum_k=1^j left(dfrac(-1)^2k-12k-1+m+dfrac(-1)^2k2k+mright)\
&=(-1)^msum_k=1^j (-1)^2k-1left(dfrac-12k-1+m+dfrac12k+mright)\
&=(-1)^msum_k=1^j (-1)^2k-1left(dfrac(2k-1+m)-(2k+m)(2k-1+m)(2k+m)right)\
&=(-1)^m+1sum_k=1^j left(dfrac-1(2k-1+m)(2k+m)right)\
&=(-1)^msum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
textso\
|f_n-f_m|
&=sum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
&=sum_k=1^jdfrac14 left(dfrac1(k-frac12+fracm2)(k+fracm2)right)\
&lt dfrac14sum_k=1^j left(dfrac1(k-1+fracm2)(k+fracm2)right)
quadtextthis is the sneaky part\
&lt dfrac14sum_k=1^j left(dfrac1k-1+fracm2-dfrac1k+fracm2right)\
&= dfrac14 left(dfrac1fracm2-dfrac1j+fracm2right)\
&= dfrac12 left(dfrac1m-dfrac12j+mright)\
&= dfrac12 left(dfrac1m-dfrac1nright)\
&< dfrac12m\
&to 0 text as m to infty\
endarray
$



If $n-m$ is odd,
the sum changes
by at most $frac1n$
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
    Feb 22 at 23:20


















2












$begingroup$

Hint :



$$frac12n-1-frac12n=frac1(2n-1)2nleq frac1(n-1)n= frac1n-1-frac1n $$






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

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    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)^kk
    $

    so,
    if $n > m$,
    $f_n-f_m
    =sum_k=m+1^n dfrac(-1)^kk
    =sum_k=1^n-m dfrac(-1)^k+mk+m
    =(-1)^msum_k=1^n-m dfrac(-1)^kk+m
    $
    .



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



    $beginarray\
    f_n-f_m
    &=(-1)^msum_k=1^2j dfrac(-1)^kk+m\
    &=(-1)^msum_k=1^j left(dfrac(-1)^2k-12k-1+m+dfrac(-1)^2k2k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac-12k-1+m+dfrac12k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac(2k-1+m)-(2k+m)(2k-1+m)(2k+m)right)\
    &=(-1)^m+1sum_k=1^j left(dfrac-1(2k-1+m)(2k+m)right)\
    &=(-1)^msum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    textso\
    |f_n-f_m|
    &=sum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    &=sum_k=1^jdfrac14 left(dfrac1(k-frac12+fracm2)(k+fracm2)right)\
    &lt dfrac14sum_k=1^j left(dfrac1(k-1+fracm2)(k+fracm2)right)
    quadtextthis is the sneaky part\
    &lt dfrac14sum_k=1^j left(dfrac1k-1+fracm2-dfrac1k+fracm2right)\
    &= dfrac14 left(dfrac1fracm2-dfrac1j+fracm2right)\
    &= dfrac12 left(dfrac1m-dfrac12j+mright)\
    &= dfrac12 left(dfrac1m-dfrac1nright)\
    &< dfrac12m\
    &to 0 text as m to infty\
    endarray
    $



    If $n-m$ is odd,
    the sum changes
    by at most $frac1n$
    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
      Feb 22 at 23:20















    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)^kk
    $

    so,
    if $n > m$,
    $f_n-f_m
    =sum_k=m+1^n dfrac(-1)^kk
    =sum_k=1^n-m dfrac(-1)^k+mk+m
    =(-1)^msum_k=1^n-m dfrac(-1)^kk+m
    $
    .



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



    $beginarray\
    f_n-f_m
    &=(-1)^msum_k=1^2j dfrac(-1)^kk+m\
    &=(-1)^msum_k=1^j left(dfrac(-1)^2k-12k-1+m+dfrac(-1)^2k2k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac-12k-1+m+dfrac12k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac(2k-1+m)-(2k+m)(2k-1+m)(2k+m)right)\
    &=(-1)^m+1sum_k=1^j left(dfrac-1(2k-1+m)(2k+m)right)\
    &=(-1)^msum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    textso\
    |f_n-f_m|
    &=sum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    &=sum_k=1^jdfrac14 left(dfrac1(k-frac12+fracm2)(k+fracm2)right)\
    &lt dfrac14sum_k=1^j left(dfrac1(k-1+fracm2)(k+fracm2)right)
    quadtextthis is the sneaky part\
    &lt dfrac14sum_k=1^j left(dfrac1k-1+fracm2-dfrac1k+fracm2right)\
    &= dfrac14 left(dfrac1fracm2-dfrac1j+fracm2right)\
    &= dfrac12 left(dfrac1m-dfrac12j+mright)\
    &= dfrac12 left(dfrac1m-dfrac1nright)\
    &< dfrac12m\
    &to 0 text as m to infty\
    endarray
    $



    If $n-m$ is odd,
    the sum changes
    by at most $frac1n$
    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
      Feb 22 at 23:20













    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)^kk
    $

    so,
    if $n > m$,
    $f_n-f_m
    =sum_k=m+1^n dfrac(-1)^kk
    =sum_k=1^n-m dfrac(-1)^k+mk+m
    =(-1)^msum_k=1^n-m dfrac(-1)^kk+m
    $
    .



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



    $beginarray\
    f_n-f_m
    &=(-1)^msum_k=1^2j dfrac(-1)^kk+m\
    &=(-1)^msum_k=1^j left(dfrac(-1)^2k-12k-1+m+dfrac(-1)^2k2k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac-12k-1+m+dfrac12k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac(2k-1+m)-(2k+m)(2k-1+m)(2k+m)right)\
    &=(-1)^m+1sum_k=1^j left(dfrac-1(2k-1+m)(2k+m)right)\
    &=(-1)^msum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    textso\
    |f_n-f_m|
    &=sum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    &=sum_k=1^jdfrac14 left(dfrac1(k-frac12+fracm2)(k+fracm2)right)\
    &lt dfrac14sum_k=1^j left(dfrac1(k-1+fracm2)(k+fracm2)right)
    quadtextthis is the sneaky part\
    &lt dfrac14sum_k=1^j left(dfrac1k-1+fracm2-dfrac1k+fracm2right)\
    &= dfrac14 left(dfrac1fracm2-dfrac1j+fracm2right)\
    &= dfrac12 left(dfrac1m-dfrac12j+mright)\
    &= dfrac12 left(dfrac1m-dfrac1nright)\
    &< dfrac12m\
    &to 0 text as m to infty\
    endarray
    $



    If $n-m$ is odd,
    the sum changes
    by at most $frac1n$
    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)^kk
    $

    so,
    if $n > m$,
    $f_n-f_m
    =sum_k=m+1^n dfrac(-1)^kk
    =sum_k=1^n-m dfrac(-1)^k+mk+m
    =(-1)^msum_k=1^n-m dfrac(-1)^kk+m
    $
    .



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



    $beginarray\
    f_n-f_m
    &=(-1)^msum_k=1^2j dfrac(-1)^kk+m\
    &=(-1)^msum_k=1^j left(dfrac(-1)^2k-12k-1+m+dfrac(-1)^2k2k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac-12k-1+m+dfrac12k+mright)\
    &=(-1)^msum_k=1^j (-1)^2k-1left(dfrac(2k-1+m)-(2k+m)(2k-1+m)(2k+m)right)\
    &=(-1)^m+1sum_k=1^j left(dfrac-1(2k-1+m)(2k+m)right)\
    &=(-1)^msum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    textso\
    |f_n-f_m|
    &=sum_k=1^j left(dfrac1(2k-1+m)(2k+m)right)\
    &=sum_k=1^jdfrac14 left(dfrac1(k-frac12+fracm2)(k+fracm2)right)\
    &lt dfrac14sum_k=1^j left(dfrac1(k-1+fracm2)(k+fracm2)right)
    quadtextthis is the sneaky part\
    &lt dfrac14sum_k=1^j left(dfrac1k-1+fracm2-dfrac1k+fracm2right)\
    &= dfrac14 left(dfrac1fracm2-dfrac1j+fracm2right)\
    &= dfrac12 left(dfrac1m-dfrac12j+mright)\
    &= dfrac12 left(dfrac1m-dfrac1nright)\
    &< dfrac12m\
    &to 0 text as m to infty\
    endarray
    $



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







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Feb 22 at 22:43









    marty cohenmarty cohen

    74.4k549129




    74.4k549129







    • 1




      $begingroup$
      Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
      $endgroup$
      – kira0705
      Feb 22 at 23:20












    • 1




      $begingroup$
      Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
      $endgroup$
      – kira0705
      Feb 22 at 23:20







    1




    1




    $begingroup$
    Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
    $endgroup$
    – kira0705
    Feb 22 at 23:20




    $begingroup$
    Thank you for such an elaborate proof , not ignoring the signs was an important step indeed.
    $endgroup$
    – kira0705
    Feb 22 at 23:20











    2












    $begingroup$

    Hint :



    $$frac12n-1-frac12n=frac1(2n-1)2nleq frac1(n-1)n= frac1n-1-frac1n $$






    share|cite|improve this answer









    $endgroup$

















      2












      $begingroup$

      Hint :



      $$frac12n-1-frac12n=frac1(2n-1)2nleq frac1(n-1)n= frac1n-1-frac1n $$






      share|cite|improve this answer









      $endgroup$















        2












        2








        2





        $begingroup$

        Hint :



        $$frac12n-1-frac12n=frac1(2n-1)2nleq frac1(n-1)n= frac1n-1-frac1n $$






        share|cite|improve this answer









        $endgroup$



        Hint :



        $$frac12n-1-frac12n=frac1(2n-1)2nleq frac1(n-1)n= frac1n-1-frac1n $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 22 at 22:24









        Clément GuérinClément Guérin

        10k1836




        10k1836



























            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

            Peggy Mitchell

            Palaiologos

            The Forum (Inglewood, California)