Interesting proofs of this sum











up vote
0
down vote

favorite












So I was asked to solve the following sum using Fourier Series:



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)}$$



I decided to try splitting it up into two sums (for even and odd $n$) in the hopes that it would telescope and be easier to evaluate. It did not, but I was able to salvage my work by employing the arctangent Taylor Series. The purpose of this post is twofold: to post a rather unusual approach and to ask others how they might do this problem more easily/differently.



First I noted



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=sum_{ninmathbb N}frac{1}{16n^2-1}^{(2)}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}^{(3)}$$



Using partial fractions of the first sum on the RHS:



$$(2);sum_{ninmathbb N}frac{1}{16n^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Using partial fractions on the second sum on the RHS:



$$(3);sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-3}-frac{1}{4n-1}right)=-frac{1}{2}+frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Combining results for the even and odd sums from the RHS:



$$sum_{ninmathbb N}frac{1}{16n^2-1}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=-frac{1}{2}+sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)^{(4)}$$



Then I saw that the rightmost sum was the following:



$$sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)=sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}^{(5)}$$



Note the Taylor series for arctangent:



$$text{atan}(x)=sum_{n=1}^inftyfrac{(-1)^{n-1}x^n}{2n-1}$$



Letting $x=1$:



$$text{atan}(1)=frac{pi}{4}=sum_{n=1}^inftyfrac{(-1)^{n+1}}{2n-1}$$



Accounting for index and sign difference, we see that



$$(5);sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}=1-frac{pi}{4}$$



And finally, from the $-1/2$ term in $(4)$, we see that



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=frac{2-pi}{4}$$










share|cite|improve this question


















  • 1




    and what is your question?
    – Masacroso
    6 hours ago






  • 3




    @Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
    – Lanier Freeman
    6 hours ago















up vote
0
down vote

favorite












So I was asked to solve the following sum using Fourier Series:



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)}$$



I decided to try splitting it up into two sums (for even and odd $n$) in the hopes that it would telescope and be easier to evaluate. It did not, but I was able to salvage my work by employing the arctangent Taylor Series. The purpose of this post is twofold: to post a rather unusual approach and to ask others how they might do this problem more easily/differently.



First I noted



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=sum_{ninmathbb N}frac{1}{16n^2-1}^{(2)}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}^{(3)}$$



Using partial fractions of the first sum on the RHS:



$$(2);sum_{ninmathbb N}frac{1}{16n^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Using partial fractions on the second sum on the RHS:



$$(3);sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-3}-frac{1}{4n-1}right)=-frac{1}{2}+frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Combining results for the even and odd sums from the RHS:



$$sum_{ninmathbb N}frac{1}{16n^2-1}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=-frac{1}{2}+sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)^{(4)}$$



Then I saw that the rightmost sum was the following:



$$sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)=sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}^{(5)}$$



Note the Taylor series for arctangent:



$$text{atan}(x)=sum_{n=1}^inftyfrac{(-1)^{n-1}x^n}{2n-1}$$



Letting $x=1$:



$$text{atan}(1)=frac{pi}{4}=sum_{n=1}^inftyfrac{(-1)^{n+1}}{2n-1}$$



Accounting for index and sign difference, we see that



$$(5);sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}=1-frac{pi}{4}$$



And finally, from the $-1/2$ term in $(4)$, we see that



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=frac{2-pi}{4}$$










share|cite|improve this question


















  • 1




    and what is your question?
    – Masacroso
    6 hours ago






  • 3




    @Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
    – Lanier Freeman
    6 hours ago













up vote
0
down vote

favorite









up vote
0
down vote

favorite











So I was asked to solve the following sum using Fourier Series:



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)}$$



I decided to try splitting it up into two sums (for even and odd $n$) in the hopes that it would telescope and be easier to evaluate. It did not, but I was able to salvage my work by employing the arctangent Taylor Series. The purpose of this post is twofold: to post a rather unusual approach and to ask others how they might do this problem more easily/differently.



First I noted



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=sum_{ninmathbb N}frac{1}{16n^2-1}^{(2)}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}^{(3)}$$



Using partial fractions of the first sum on the RHS:



$$(2);sum_{ninmathbb N}frac{1}{16n^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Using partial fractions on the second sum on the RHS:



$$(3);sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-3}-frac{1}{4n-1}right)=-frac{1}{2}+frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Combining results for the even and odd sums from the RHS:



$$sum_{ninmathbb N}frac{1}{16n^2-1}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=-frac{1}{2}+sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)^{(4)}$$



Then I saw that the rightmost sum was the following:



$$sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)=sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}^{(5)}$$



Note the Taylor series for arctangent:



$$text{atan}(x)=sum_{n=1}^inftyfrac{(-1)^{n-1}x^n}{2n-1}$$



Letting $x=1$:



$$text{atan}(1)=frac{pi}{4}=sum_{n=1}^inftyfrac{(-1)^{n+1}}{2n-1}$$



Accounting for index and sign difference, we see that



$$(5);sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}=1-frac{pi}{4}$$



And finally, from the $-1/2$ term in $(4)$, we see that



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=frac{2-pi}{4}$$










share|cite|improve this question













So I was asked to solve the following sum using Fourier Series:



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)}$$



I decided to try splitting it up into two sums (for even and odd $n$) in the hopes that it would telescope and be easier to evaluate. It did not, but I was able to salvage my work by employing the arctangent Taylor Series. The purpose of this post is twofold: to post a rather unusual approach and to ask others how they might do this problem more easily/differently.



First I noted



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=sum_{ninmathbb N}frac{1}{16n^2-1}^{(2)}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}^{(3)}$$



Using partial fractions of the first sum on the RHS:



$$(2);sum_{ninmathbb N}frac{1}{16n^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Using partial fractions on the second sum on the RHS:



$$(3);sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-3}-frac{1}{4n-1}right)=-frac{1}{2}+frac{1}{2}sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)$$



Combining results for the even and odd sums from the RHS:



$$sum_{ninmathbb N}frac{1}{16n^2-1}-sum_{ninmathbb N}frac{1}{4(2n-1)^2-1}=-frac{1}{2}+sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)^{(4)}$$



Then I saw that the rightmost sum was the following:



$$sum_{ninmathbb N}left(frac{1}{4n-1}-frac{1}{4n+1}right)=sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}^{(5)}$$



Note the Taylor series for arctangent:



$$text{atan}(x)=sum_{n=1}^inftyfrac{(-1)^{n-1}x^n}{2n-1}$$



Letting $x=1$:



$$text{atan}(1)=frac{pi}{4}=sum_{n=1}^inftyfrac{(-1)^{n+1}}{2n-1}$$



Accounting for index and sign difference, we see that



$$(5);sum_{n=2}^inftyfrac{(-1)^{n}}{2n-1}=1-frac{pi}{4}$$



And finally, from the $-1/2$ term in $(4)$, we see that



$$sum_{ninBbb N}frac{(-1)^n}{4n^2-1}=frac{2-pi}{4}$$







summation fourier-series






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 6 hours ago









Lanier Freeman

2,820827




2,820827








  • 1




    and what is your question?
    – Masacroso
    6 hours ago






  • 3




    @Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
    – Lanier Freeman
    6 hours ago














  • 1




    and what is your question?
    – Masacroso
    6 hours ago






  • 3




    @Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
    – Lanier Freeman
    6 hours ago








1




1




and what is your question?
– Masacroso
6 hours ago




and what is your question?
– Masacroso
6 hours ago




3




3




@Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
– Lanier Freeman
6 hours ago




@Masacroso MSE has explicitly said that asking your own question and answering with an interesting result is well-received, albeit uncommon. I also asked if anyone else had nice approaches to this specific question
– Lanier Freeman
6 hours ago










1 Answer
1






active

oldest

votes

















up vote
1
down vote













I would go about it in a similar way like you do, just shorter, as follows:



By partial fractions,



$$
frac{1}{4n^2-1} = frac12 left(frac{1}{2n-1} - frac{1}{2n+1} right)
$$

So
$$
sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 sum_{ninBbb N} left(frac{(-1)^n}{2n-1} - frac{(-1)^n}{2(n+1)-1} right)
$$

and by shifting the sum index
$$
sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 left(
sum_{n=1}^infty frac{(-1)^n}{2n-1} + sum_{n=2}^infty frac{(-1)^n}{2n-1} right)\
= frac12 left( 1 -
2 sum_{n=1}^infty frac{(-1)^{n+1}}{2n-1} right) = frac{2-pi}{4}
$$

where in the last line the $arctan$ result was used.






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',
    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%2f2996476%2finteresting-proofs-of-this-sum%23new-answer', 'question_page');
    }
    );

    Post as a guest
































    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote













    I would go about it in a similar way like you do, just shorter, as follows:



    By partial fractions,



    $$
    frac{1}{4n^2-1} = frac12 left(frac{1}{2n-1} - frac{1}{2n+1} right)
    $$

    So
    $$
    sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 sum_{ninBbb N} left(frac{(-1)^n}{2n-1} - frac{(-1)^n}{2(n+1)-1} right)
    $$

    and by shifting the sum index
    $$
    sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 left(
    sum_{n=1}^infty frac{(-1)^n}{2n-1} + sum_{n=2}^infty frac{(-1)^n}{2n-1} right)\
    = frac12 left( 1 -
    2 sum_{n=1}^infty frac{(-1)^{n+1}}{2n-1} right) = frac{2-pi}{4}
    $$

    where in the last line the $arctan$ result was used.






    share|cite|improve this answer

























      up vote
      1
      down vote













      I would go about it in a similar way like you do, just shorter, as follows:



      By partial fractions,



      $$
      frac{1}{4n^2-1} = frac12 left(frac{1}{2n-1} - frac{1}{2n+1} right)
      $$

      So
      $$
      sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 sum_{ninBbb N} left(frac{(-1)^n}{2n-1} - frac{(-1)^n}{2(n+1)-1} right)
      $$

      and by shifting the sum index
      $$
      sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 left(
      sum_{n=1}^infty frac{(-1)^n}{2n-1} + sum_{n=2}^infty frac{(-1)^n}{2n-1} right)\
      = frac12 left( 1 -
      2 sum_{n=1}^infty frac{(-1)^{n+1}}{2n-1} right) = frac{2-pi}{4}
      $$

      where in the last line the $arctan$ result was used.






      share|cite|improve this answer























        up vote
        1
        down vote










        up vote
        1
        down vote









        I would go about it in a similar way like you do, just shorter, as follows:



        By partial fractions,



        $$
        frac{1}{4n^2-1} = frac12 left(frac{1}{2n-1} - frac{1}{2n+1} right)
        $$

        So
        $$
        sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 sum_{ninBbb N} left(frac{(-1)^n}{2n-1} - frac{(-1)^n}{2(n+1)-1} right)
        $$

        and by shifting the sum index
        $$
        sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 left(
        sum_{n=1}^infty frac{(-1)^n}{2n-1} + sum_{n=2}^infty frac{(-1)^n}{2n-1} right)\
        = frac12 left( 1 -
        2 sum_{n=1}^infty frac{(-1)^{n+1}}{2n-1} right) = frac{2-pi}{4}
        $$

        where in the last line the $arctan$ result was used.






        share|cite|improve this answer












        I would go about it in a similar way like you do, just shorter, as follows:



        By partial fractions,



        $$
        frac{1}{4n^2-1} = frac12 left(frac{1}{2n-1} - frac{1}{2n+1} right)
        $$

        So
        $$
        sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 sum_{ninBbb N} left(frac{(-1)^n}{2n-1} - frac{(-1)^n}{2(n+1)-1} right)
        $$

        and by shifting the sum index
        $$
        sum_{ninBbb N}frac{(-1)^n}{4n^2-1}^{(1)} = frac12 left(
        sum_{n=1}^infty frac{(-1)^n}{2n-1} + sum_{n=2}^infty frac{(-1)^n}{2n-1} right)\
        = frac12 left( 1 -
        2 sum_{n=1}^infty frac{(-1)^{n+1}}{2n-1} right) = frac{2-pi}{4}
        $$

        where in the last line the $arctan$ result was used.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 6 hours ago









        Andreas

        7,4491037




        7,4491037






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996476%2finteresting-proofs-of-this-sum%23new-answer', 'question_page');
            }
            );

            Post as a guest




















































































            Popular posts from this blog

            Index of /

            Tribalistas

            Listed building