Does this series $sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)} $ diverge or converge?











up vote
0
down vote

favorite












I have this series:
$$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)} $$



Like every absolutely convergent series are convergent i am working on:
$$sum_{n=1}^infty frac{(n)^2} {1+(n^2)} $$



The ratio test gives me:



$lim_{n to infty} frac{frac{(n+1)^2}{1+(n+1)^2}}{frac{(n)^2}{1+(n)^2}}$ = 1



Wich is inconclusive. Then i take the limit:



$lim_{n to infty} a_n= lim_{n to infty} frac{(n)^2} {1+(n^2)} $= 1

That is different to zero.
So i can conclude that this series diverges .
What do you think? Is this correct?










share|cite|improve this question


















  • 4




    Seems good. Series diverges.
    – Frank W.
    Dec 3 at 3:38






  • 1




    NB: $(n)^2=(n^2)=n^2$.
    – Shaun
    Dec 3 at 4:00















up vote
0
down vote

favorite












I have this series:
$$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)} $$



Like every absolutely convergent series are convergent i am working on:
$$sum_{n=1}^infty frac{(n)^2} {1+(n^2)} $$



The ratio test gives me:



$lim_{n to infty} frac{frac{(n+1)^2}{1+(n+1)^2}}{frac{(n)^2}{1+(n)^2}}$ = 1



Wich is inconclusive. Then i take the limit:



$lim_{n to infty} a_n= lim_{n to infty} frac{(n)^2} {1+(n^2)} $= 1

That is different to zero.
So i can conclude that this series diverges .
What do you think? Is this correct?










share|cite|improve this question


















  • 4




    Seems good. Series diverges.
    – Frank W.
    Dec 3 at 3:38






  • 1




    NB: $(n)^2=(n^2)=n^2$.
    – Shaun
    Dec 3 at 4:00













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have this series:
$$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)} $$



Like every absolutely convergent series are convergent i am working on:
$$sum_{n=1}^infty frac{(n)^2} {1+(n^2)} $$



The ratio test gives me:



$lim_{n to infty} frac{frac{(n+1)^2}{1+(n+1)^2}}{frac{(n)^2}{1+(n)^2}}$ = 1



Wich is inconclusive. Then i take the limit:



$lim_{n to infty} a_n= lim_{n to infty} frac{(n)^2} {1+(n^2)} $= 1

That is different to zero.
So i can conclude that this series diverges .
What do you think? Is this correct?










share|cite|improve this question













I have this series:
$$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)} $$



Like every absolutely convergent series are convergent i am working on:
$$sum_{n=1}^infty frac{(n)^2} {1+(n^2)} $$



The ratio test gives me:



$lim_{n to infty} frac{frac{(n+1)^2}{1+(n+1)^2}}{frac{(n)^2}{1+(n)^2}}$ = 1



Wich is inconclusive. Then i take the limit:



$lim_{n to infty} a_n= lim_{n to infty} frac{(n)^2} {1+(n^2)} $= 1

That is different to zero.
So i can conclude that this series diverges .
What do you think? Is this correct?







calculus sequences-and-series






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 3 at 3:35









Kanaloa

63




63








  • 4




    Seems good. Series diverges.
    – Frank W.
    Dec 3 at 3:38






  • 1




    NB: $(n)^2=(n^2)=n^2$.
    – Shaun
    Dec 3 at 4:00














  • 4




    Seems good. Series diverges.
    – Frank W.
    Dec 3 at 3:38






  • 1




    NB: $(n)^2=(n^2)=n^2$.
    – Shaun
    Dec 3 at 4:00








4




4




Seems good. Series diverges.
– Frank W.
Dec 3 at 3:38




Seems good. Series diverges.
– Frank W.
Dec 3 at 3:38




1




1




NB: $(n)^2=(n^2)=n^2$.
– Shaun
Dec 3 at 4:00




NB: $(n)^2=(n^2)=n^2$.
– Shaun
Dec 3 at 4:00










7 Answers
7






active

oldest

votes

















up vote
2
down vote













If a series converges the the lim of the sequence is zero, so this series diverges.






share|cite|improve this answer








New contributor




Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

























    up vote
    1
    down vote













    The series is diverge but your proof is not correct because a series which is not absolutely convergent can also be convergent (conditionally convergent).






    share|cite|improve this answer








    New contributor




    WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.


















    • For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
      – Eff
      Dec 3 at 13:05




















    up vote
    0
    down vote













    $$sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}$$
    is neither conditionally or absolutely convergent since the absolute value of the main term does not tend to zero as $nto +infty$. On the other hand it is Cesàro-summable:
    $$ lim_{varepsilonto 0^+}sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}e^{-varepsilon n}=-frac{1}{2}-sum_{ngeq 1}frac{(-1)^n}{1+n^2}=frac{1}{4}left(frac{pi}{sinh pi}-1right). $$
    The last identity can be seen as a consequence of the Poisson summation formula, the (inverse) Laplace transform or just Herglotz' trick.






    share|cite|improve this answer




























      up vote
      0
      down vote













      We may rewrite it as $$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)}{=-{1over 2}+sum_{n=1}^infty frac{(2n)^2} {1+(2n)^2}-frac{(2n+1)^2} {1+(2n+1)^2}\=-{1over 2}+sum_{n=1}^infty frac{1} {1+(2n+1)^2}-frac{1} {1+(2n)^2}\=-{1over 2}+sum_{n=1}^infty frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}}$$which converges for sure since $$frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}sim -{1over 4n^3}$$for large enough $n$.






      share|cite|improve this answer





















      • This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
        – GEdgar
        Dec 3 at 16:28










      • No need to that. Only a simple comparison test works here.
        – Mostafa Ayaz
        Dec 3 at 16:29










      • Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
        – GEdgar
        Dec 3 at 17:46










      • Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
        – Mostafa Ayaz
        Dec 3 at 18:00










      • And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
        – GEdgar
        Dec 3 at 18:14


















      up vote
      0
      down vote













      It's definitely divergent, that one, because the terms become closer to 1 in magnitude with increasing $n$; the sum becomes more & more like just alternating beween adding & subtracting 1 as in increases.






      share|cite|improve this answer




























        up vote
        0
        down vote













        $newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
        newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
        newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
        newcommand{dd}{mathrm{d}}
        newcommand{ds}[1]{displaystyle{#1}}
        newcommand{expo}[1]{,mathrm{e}^{#1},}
        newcommand{ic}{mathrm{i}}
        newcommand{mc}[1]{mathcal{#1}}
        newcommand{mrm}[1]{mathrm{#1}}
        newcommand{pars}[1]{left(,{#1},right)}
        newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
        newcommand{root}[2]{,sqrt[#1]{,{#2},},}
        newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
        newcommand{verts}[1]{leftvert,{#1},rightvert}$




        With $ds{N in mathbb{N}_{geq 1}}$:




        begin{align}
        sum_{n = 1}^{N}{n^{2}pars{-1}^{n} over 1 + n^{2}} & =
        sum_{n = 0}^{leftlfloor N/2rightrfloor}
        {4n^{2} over 1 + 4n^{2}} -
        sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
        {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}
        \[5mm] & =
        sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
        {4n^{2} over 1 + 4n^{2}}
        \[5mm] &
        + underbrace{sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
        bracks{{4n^{2} over 1 + 4n^{2}} - {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}}}
        _{ds{stackrel{mrm{as} N to infty}{LARGEto}
        -,{1 + picscpars{pi} over 2}}}
        end{align}




        Note that




        begin{align}
        &bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
        {4n^{2} over 1 + 4n^{2}}}
        \[5mm] = &
        left{begin{array}{lcl}
        ds{{4pars{m - 1}^{2} over
        1 + 4pars{m - 1}^{2}} +
        {4m^{2} over 1 + 4m^{2}}} & mbox{if} &
        ds{N} even, ds{N equiv 2m}
        \[2mm]
        ds{4m^{2} over 1 + 4m^{2}} & mbox{if} &
        ds{N} phantom{n}odd, ds{N equiv 2m + 1}
        end{array}right.
        \[5mm] implies &
        lim_{N to infty}bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
        {4n^{2} over 1 + 4n^{2}}}
        mbox{doesn't} exist.
        end{align}






        share|cite|improve this answer




























          up vote
          0
          down vote













          Further remark on Mostafa's answer.
          $$
          lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)}=
          frac{-pi+sinh pi}{2sinh pi} approx 0.36,
          \
          lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)}=
          frac{-pi-sinh pi}{2sinh pi} approx -0.64.
          $$

          These do not agree, so $sum_{n=1}^infty$ does not exist.






          share|cite|improve this answer























          • Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
            – JV.Stalker
            Dec 4 at 12:11













          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%2f3023583%2fdoes-this-series-sum-n-1-infty-fracn2-1n-1n2-diverge-or-co%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          7 Answers
          7






          active

          oldest

          votes








          7 Answers
          7






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          2
          down vote













          If a series converges the the lim of the sequence is zero, so this series diverges.






          share|cite|improve this answer








          New contributor




          Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.






















            up vote
            2
            down vote













            If a series converges the the lim of the sequence is zero, so this series diverges.






            share|cite|improve this answer








            New contributor




            Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.




















              up vote
              2
              down vote










              up vote
              2
              down vote









              If a series converges the the lim of the sequence is zero, so this series diverges.






              share|cite|improve this answer








              New contributor




              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.









              If a series converges the the lim of the sequence is zero, so this series diverges.







              share|cite|improve this answer








              New contributor




              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.









              share|cite|improve this answer



              share|cite|improve this answer






              New contributor




              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.









              answered Dec 3 at 7:14









              Amit Levy

              232




              232




              New contributor




              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.





              New contributor





              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.






              Amit Levy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.






















                  up vote
                  1
                  down vote













                  The series is diverge but your proof is not correct because a series which is not absolutely convergent can also be convergent (conditionally convergent).






                  share|cite|improve this answer








                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.


















                  • For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                    – Eff
                    Dec 3 at 13:05

















                  up vote
                  1
                  down vote













                  The series is diverge but your proof is not correct because a series which is not absolutely convergent can also be convergent (conditionally convergent).






                  share|cite|improve this answer








                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.


















                  • For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                    – Eff
                    Dec 3 at 13:05















                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  The series is diverge but your proof is not correct because a series which is not absolutely convergent can also be convergent (conditionally convergent).






                  share|cite|improve this answer








                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.









                  The series is diverge but your proof is not correct because a series which is not absolutely convergent can also be convergent (conditionally convergent).







                  share|cite|improve this answer








                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.









                  share|cite|improve this answer



                  share|cite|improve this answer






                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.









                  answered Dec 3 at 7:59









                  WUJI

                  192




                  192




                  New contributor




                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.





                  New contributor





                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.






                  WUJI is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                  Check out our Code of Conduct.












                  • For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                    – Eff
                    Dec 3 at 13:05




















                  • For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                    – Eff
                    Dec 3 at 13:05


















                  For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                  – Eff
                  Dec 3 at 13:05






                  For a series $sum a_n$, if $a_nnotto 0$ then it neither converges conditionally or absolutely, it is guaranteed to be divergent. So if you show that $a_n notto 0$, then it is enough to conclude divergence.
                  – Eff
                  Dec 3 at 13:05












                  up vote
                  0
                  down vote













                  $$sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}$$
                  is neither conditionally or absolutely convergent since the absolute value of the main term does not tend to zero as $nto +infty$. On the other hand it is Cesàro-summable:
                  $$ lim_{varepsilonto 0^+}sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}e^{-varepsilon n}=-frac{1}{2}-sum_{ngeq 1}frac{(-1)^n}{1+n^2}=frac{1}{4}left(frac{pi}{sinh pi}-1right). $$
                  The last identity can be seen as a consequence of the Poisson summation formula, the (inverse) Laplace transform or just Herglotz' trick.






                  share|cite|improve this answer

























                    up vote
                    0
                    down vote













                    $$sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}$$
                    is neither conditionally or absolutely convergent since the absolute value of the main term does not tend to zero as $nto +infty$. On the other hand it is Cesàro-summable:
                    $$ lim_{varepsilonto 0^+}sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}e^{-varepsilon n}=-frac{1}{2}-sum_{ngeq 1}frac{(-1)^n}{1+n^2}=frac{1}{4}left(frac{pi}{sinh pi}-1right). $$
                    The last identity can be seen as a consequence of the Poisson summation formula, the (inverse) Laplace transform or just Herglotz' trick.






                    share|cite|improve this answer























                      up vote
                      0
                      down vote










                      up vote
                      0
                      down vote









                      $$sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}$$
                      is neither conditionally or absolutely convergent since the absolute value of the main term does not tend to zero as $nto +infty$. On the other hand it is Cesàro-summable:
                      $$ lim_{varepsilonto 0^+}sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}e^{-varepsilon n}=-frac{1}{2}-sum_{ngeq 1}frac{(-1)^n}{1+n^2}=frac{1}{4}left(frac{pi}{sinh pi}-1right). $$
                      The last identity can be seen as a consequence of the Poisson summation formula, the (inverse) Laplace transform or just Herglotz' trick.






                      share|cite|improve this answer












                      $$sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}$$
                      is neither conditionally or absolutely convergent since the absolute value of the main term does not tend to zero as $nto +infty$. On the other hand it is Cesàro-summable:
                      $$ lim_{varepsilonto 0^+}sum_{ngeq 1}frac{(-1)^n n^2}{1+n^2}e^{-varepsilon n}=-frac{1}{2}-sum_{ngeq 1}frac{(-1)^n}{1+n^2}=frac{1}{4}left(frac{pi}{sinh pi}-1right). $$
                      The last identity can be seen as a consequence of the Poisson summation formula, the (inverse) Laplace transform or just Herglotz' trick.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Dec 3 at 13:01









                      Jack D'Aurizio

                      284k33275654




                      284k33275654






















                          up vote
                          0
                          down vote













                          We may rewrite it as $$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)}{=-{1over 2}+sum_{n=1}^infty frac{(2n)^2} {1+(2n)^2}-frac{(2n+1)^2} {1+(2n+1)^2}\=-{1over 2}+sum_{n=1}^infty frac{1} {1+(2n+1)^2}-frac{1} {1+(2n)^2}\=-{1over 2}+sum_{n=1}^infty frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}}$$which converges for sure since $$frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}sim -{1over 4n^3}$$for large enough $n$.






                          share|cite|improve this answer





















                          • This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                            – GEdgar
                            Dec 3 at 16:28










                          • No need to that. Only a simple comparison test works here.
                            – Mostafa Ayaz
                            Dec 3 at 16:29










                          • Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                            – GEdgar
                            Dec 3 at 17:46










                          • Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                            – Mostafa Ayaz
                            Dec 3 at 18:00










                          • And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                            – GEdgar
                            Dec 3 at 18:14















                          up vote
                          0
                          down vote













                          We may rewrite it as $$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)}{=-{1over 2}+sum_{n=1}^infty frac{(2n)^2} {1+(2n)^2}-frac{(2n+1)^2} {1+(2n+1)^2}\=-{1over 2}+sum_{n=1}^infty frac{1} {1+(2n+1)^2}-frac{1} {1+(2n)^2}\=-{1over 2}+sum_{n=1}^infty frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}}$$which converges for sure since $$frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}sim -{1over 4n^3}$$for large enough $n$.






                          share|cite|improve this answer





















                          • This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                            – GEdgar
                            Dec 3 at 16:28










                          • No need to that. Only a simple comparison test works here.
                            – Mostafa Ayaz
                            Dec 3 at 16:29










                          • Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                            – GEdgar
                            Dec 3 at 17:46










                          • Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                            – Mostafa Ayaz
                            Dec 3 at 18:00










                          • And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                            – GEdgar
                            Dec 3 at 18:14













                          up vote
                          0
                          down vote










                          up vote
                          0
                          down vote









                          We may rewrite it as $$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)}{=-{1over 2}+sum_{n=1}^infty frac{(2n)^2} {1+(2n)^2}-frac{(2n+1)^2} {1+(2n+1)^2}\=-{1over 2}+sum_{n=1}^infty frac{1} {1+(2n+1)^2}-frac{1} {1+(2n)^2}\=-{1over 2}+sum_{n=1}^infty frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}}$$which converges for sure since $$frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}sim -{1over 4n^3}$$for large enough $n$.






                          share|cite|improve this answer












                          We may rewrite it as $$sum_{n=1}^infty frac{(n)^2(-1)^n} {1+(n^2)}{=-{1over 2}+sum_{n=1}^infty frac{(2n)^2} {1+(2n)^2}-frac{(2n+1)^2} {1+(2n+1)^2}\=-{1over 2}+sum_{n=1}^infty frac{1} {1+(2n+1)^2}-frac{1} {1+(2n)^2}\=-{1over 2}+sum_{n=1}^infty frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}}$$which converges for sure since $$frac{-4n-1} {(1+(2n+1)^2)(1+(2n)^2)}sim -{1over 4n^3}$$for large enough $n$.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Dec 3 at 16:17









                          Mostafa Ayaz

                          13.4k3836




                          13.4k3836












                          • This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                            – GEdgar
                            Dec 3 at 16:28










                          • No need to that. Only a simple comparison test works here.
                            – Mostafa Ayaz
                            Dec 3 at 16:29










                          • Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                            – GEdgar
                            Dec 3 at 17:46










                          • Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                            – Mostafa Ayaz
                            Dec 3 at 18:00










                          • And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                            – GEdgar
                            Dec 3 at 18:14


















                          • This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                            – GEdgar
                            Dec 3 at 16:28










                          • No need to that. Only a simple comparison test works here.
                            – Mostafa Ayaz
                            Dec 3 at 16:29










                          • Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                            – GEdgar
                            Dec 3 at 17:46










                          • Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                            – Mostafa Ayaz
                            Dec 3 at 18:00










                          • And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                            – GEdgar
                            Dec 3 at 18:14
















                          This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                          – GEdgar
                          Dec 3 at 16:28




                          This method is often a good one for convergence of an alternating series. But to finish, you would need to show that the single term goes to zero, which fails here.
                          – GEdgar
                          Dec 3 at 16:28












                          No need to that. Only a simple comparison test works here.
                          – Mostafa Ayaz
                          Dec 3 at 16:29




                          No need to that. Only a simple comparison test works here.
                          – Mostafa Ayaz
                          Dec 3 at 16:29












                          Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                          – GEdgar
                          Dec 3 at 17:46




                          Your argument shows that the two limits$$ lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)},qquad lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)} $$ both exist, but not that $sum_{n=1}^infty$ exists.
                          – GEdgar
                          Dec 3 at 17:46












                          Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                          – Mostafa Ayaz
                          Dec 3 at 18:00




                          Surely not. As the series has been defined as $sum (-1)^n a_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots$ I defined $b_n=-(a_{2n-1}-a_{2n})$ therefore $$sum b_n=-(a_1-a_2)-(a_2-a_3)-(a_3-a_4)-cdots=sum (-1)^na_n$$
                          – Mostafa Ayaz
                          Dec 3 at 18:00












                          And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                          – GEdgar
                          Dec 3 at 18:14




                          And thus we see that "grouping" of a divergent series may produce a convergent series. Another example: $1-1+1-1+1-1+dots$.
                          – GEdgar
                          Dec 3 at 18:14










                          up vote
                          0
                          down vote













                          It's definitely divergent, that one, because the terms become closer to 1 in magnitude with increasing $n$; the sum becomes more & more like just alternating beween adding & subtracting 1 as in increases.






                          share|cite|improve this answer

























                            up vote
                            0
                            down vote













                            It's definitely divergent, that one, because the terms become closer to 1 in magnitude with increasing $n$; the sum becomes more & more like just alternating beween adding & subtracting 1 as in increases.






                            share|cite|improve this answer























                              up vote
                              0
                              down vote










                              up vote
                              0
                              down vote









                              It's definitely divergent, that one, because the terms become closer to 1 in magnitude with increasing $n$; the sum becomes more & more like just alternating beween adding & subtracting 1 as in increases.






                              share|cite|improve this answer












                              It's definitely divergent, that one, because the terms become closer to 1 in magnitude with increasing $n$; the sum becomes more & more like just alternating beween adding & subtracting 1 as in increases.







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered Dec 3 at 20:21









                              AmbretteOrrisey

                              47310




                              47310






















                                  up vote
                                  0
                                  down vote













                                  $newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
                                  newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
                                  newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
                                  newcommand{dd}{mathrm{d}}
                                  newcommand{ds}[1]{displaystyle{#1}}
                                  newcommand{expo}[1]{,mathrm{e}^{#1},}
                                  newcommand{ic}{mathrm{i}}
                                  newcommand{mc}[1]{mathcal{#1}}
                                  newcommand{mrm}[1]{mathrm{#1}}
                                  newcommand{pars}[1]{left(,{#1},right)}
                                  newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
                                  newcommand{root}[2]{,sqrt[#1]{,{#2},},}
                                  newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
                                  newcommand{verts}[1]{leftvert,{#1},rightvert}$




                                  With $ds{N in mathbb{N}_{geq 1}}$:




                                  begin{align}
                                  sum_{n = 1}^{N}{n^{2}pars{-1}^{n} over 1 + n^{2}} & =
                                  sum_{n = 0}^{leftlfloor N/2rightrfloor}
                                  {4n^{2} over 1 + 4n^{2}} -
                                  sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                  {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}
                                  \[5mm] & =
                                  sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                  {4n^{2} over 1 + 4n^{2}}
                                  \[5mm] &
                                  + underbrace{sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                  bracks{{4n^{2} over 1 + 4n^{2}} - {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}}}
                                  _{ds{stackrel{mrm{as} N to infty}{LARGEto}
                                  -,{1 + picscpars{pi} over 2}}}
                                  end{align}




                                  Note that




                                  begin{align}
                                  &bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                  {4n^{2} over 1 + 4n^{2}}}
                                  \[5mm] = &
                                  left{begin{array}{lcl}
                                  ds{{4pars{m - 1}^{2} over
                                  1 + 4pars{m - 1}^{2}} +
                                  {4m^{2} over 1 + 4m^{2}}} & mbox{if} &
                                  ds{N} even, ds{N equiv 2m}
                                  \[2mm]
                                  ds{4m^{2} over 1 + 4m^{2}} & mbox{if} &
                                  ds{N} phantom{n}odd, ds{N equiv 2m + 1}
                                  end{array}right.
                                  \[5mm] implies &
                                  lim_{N to infty}bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                  {4n^{2} over 1 + 4n^{2}}}
                                  mbox{doesn't} exist.
                                  end{align}






                                  share|cite|improve this answer

























                                    up vote
                                    0
                                    down vote













                                    $newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
                                    newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
                                    newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
                                    newcommand{dd}{mathrm{d}}
                                    newcommand{ds}[1]{displaystyle{#1}}
                                    newcommand{expo}[1]{,mathrm{e}^{#1},}
                                    newcommand{ic}{mathrm{i}}
                                    newcommand{mc}[1]{mathcal{#1}}
                                    newcommand{mrm}[1]{mathrm{#1}}
                                    newcommand{pars}[1]{left(,{#1},right)}
                                    newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
                                    newcommand{root}[2]{,sqrt[#1]{,{#2},},}
                                    newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
                                    newcommand{verts}[1]{leftvert,{#1},rightvert}$




                                    With $ds{N in mathbb{N}_{geq 1}}$:




                                    begin{align}
                                    sum_{n = 1}^{N}{n^{2}pars{-1}^{n} over 1 + n^{2}} & =
                                    sum_{n = 0}^{leftlfloor N/2rightrfloor}
                                    {4n^{2} over 1 + 4n^{2}} -
                                    sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                    {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}
                                    \[5mm] & =
                                    sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                    {4n^{2} over 1 + 4n^{2}}
                                    \[5mm] &
                                    + underbrace{sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                    bracks{{4n^{2} over 1 + 4n^{2}} - {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}}}
                                    _{ds{stackrel{mrm{as} N to infty}{LARGEto}
                                    -,{1 + picscpars{pi} over 2}}}
                                    end{align}




                                    Note that




                                    begin{align}
                                    &bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                    {4n^{2} over 1 + 4n^{2}}}
                                    \[5mm] = &
                                    left{begin{array}{lcl}
                                    ds{{4pars{m - 1}^{2} over
                                    1 + 4pars{m - 1}^{2}} +
                                    {4m^{2} over 1 + 4m^{2}}} & mbox{if} &
                                    ds{N} even, ds{N equiv 2m}
                                    \[2mm]
                                    ds{4m^{2} over 1 + 4m^{2}} & mbox{if} &
                                    ds{N} phantom{n}odd, ds{N equiv 2m + 1}
                                    end{array}right.
                                    \[5mm] implies &
                                    lim_{N to infty}bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                    {4n^{2} over 1 + 4n^{2}}}
                                    mbox{doesn't} exist.
                                    end{align}






                                    share|cite|improve this answer























                                      up vote
                                      0
                                      down vote










                                      up vote
                                      0
                                      down vote









                                      $newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
                                      newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
                                      newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
                                      newcommand{dd}{mathrm{d}}
                                      newcommand{ds}[1]{displaystyle{#1}}
                                      newcommand{expo}[1]{,mathrm{e}^{#1},}
                                      newcommand{ic}{mathrm{i}}
                                      newcommand{mc}[1]{mathcal{#1}}
                                      newcommand{mrm}[1]{mathrm{#1}}
                                      newcommand{pars}[1]{left(,{#1},right)}
                                      newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
                                      newcommand{root}[2]{,sqrt[#1]{,{#2},},}
                                      newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
                                      newcommand{verts}[1]{leftvert,{#1},rightvert}$




                                      With $ds{N in mathbb{N}_{geq 1}}$:




                                      begin{align}
                                      sum_{n = 1}^{N}{n^{2}pars{-1}^{n} over 1 + n^{2}} & =
                                      sum_{n = 0}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}} -
                                      sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                      {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}
                                      \[5mm] & =
                                      sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}
                                      \[5mm] &
                                      + underbrace{sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                      bracks{{4n^{2} over 1 + 4n^{2}} - {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}}}
                                      _{ds{stackrel{mrm{as} N to infty}{LARGEto}
                                      -,{1 + picscpars{pi} over 2}}}
                                      end{align}




                                      Note that




                                      begin{align}
                                      &bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}}
                                      \[5mm] = &
                                      left{begin{array}{lcl}
                                      ds{{4pars{m - 1}^{2} over
                                      1 + 4pars{m - 1}^{2}} +
                                      {4m^{2} over 1 + 4m^{2}}} & mbox{if} &
                                      ds{N} even, ds{N equiv 2m}
                                      \[2mm]
                                      ds{4m^{2} over 1 + 4m^{2}} & mbox{if} &
                                      ds{N} phantom{n}odd, ds{N equiv 2m + 1}
                                      end{array}right.
                                      \[5mm] implies &
                                      lim_{N to infty}bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}}
                                      mbox{doesn't} exist.
                                      end{align}






                                      share|cite|improve this answer












                                      $newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
                                      newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
                                      newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
                                      newcommand{dd}{mathrm{d}}
                                      newcommand{ds}[1]{displaystyle{#1}}
                                      newcommand{expo}[1]{,mathrm{e}^{#1},}
                                      newcommand{ic}{mathrm{i}}
                                      newcommand{mc}[1]{mathcal{#1}}
                                      newcommand{mrm}[1]{mathrm{#1}}
                                      newcommand{pars}[1]{left(,{#1},right)}
                                      newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
                                      newcommand{root}[2]{,sqrt[#1]{,{#2},},}
                                      newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
                                      newcommand{verts}[1]{leftvert,{#1},rightvert}$




                                      With $ds{N in mathbb{N}_{geq 1}}$:




                                      begin{align}
                                      sum_{n = 1}^{N}{n^{2}pars{-1}^{n} over 1 + n^{2}} & =
                                      sum_{n = 0}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}} -
                                      sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                      {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}
                                      \[5mm] & =
                                      sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}
                                      \[5mm] &
                                      + underbrace{sum_{n = 0}^{leftlfloorpars{N - 1}/2rightrfloor}
                                      bracks{{4n^{2} over 1 + 4n^{2}} - {pars{2n + 1}^{2} over 1 + pars{2n + 1}^{2}}}}
                                      _{ds{stackrel{mrm{as} N to infty}{LARGEto}
                                      -,{1 + picscpars{pi} over 2}}}
                                      end{align}




                                      Note that




                                      begin{align}
                                      &bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}}
                                      \[5mm] = &
                                      left{begin{array}{lcl}
                                      ds{{4pars{m - 1}^{2} over
                                      1 + 4pars{m - 1}^{2}} +
                                      {4m^{2} over 1 + 4m^{2}}} & mbox{if} &
                                      ds{N} even, ds{N equiv 2m}
                                      \[2mm]
                                      ds{4m^{2} over 1 + 4m^{2}} & mbox{if} &
                                      ds{N} phantom{n}odd, ds{N equiv 2m + 1}
                                      end{array}right.
                                      \[5mm] implies &
                                      lim_{N to infty}bbox[10px,#ffd]{sum_{n = leftlfloorpars{N - 1}/2rightrfloor + 1}^{leftlfloor N/2rightrfloor}
                                      {4n^{2} over 1 + 4n^{2}}}
                                      mbox{doesn't} exist.
                                      end{align}







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered Dec 4 at 5:27









                                      Felix Marin

                                      66.5k7107139




                                      66.5k7107139






















                                          up vote
                                          0
                                          down vote













                                          Further remark on Mostafa's answer.
                                          $$
                                          lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi+sinh pi}{2sinh pi} approx 0.36,
                                          \
                                          lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi-sinh pi}{2sinh pi} approx -0.64.
                                          $$

                                          These do not agree, so $sum_{n=1}^infty$ does not exist.






                                          share|cite|improve this answer























                                          • Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                            – JV.Stalker
                                            Dec 4 at 12:11

















                                          up vote
                                          0
                                          down vote













                                          Further remark on Mostafa's answer.
                                          $$
                                          lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi+sinh pi}{2sinh pi} approx 0.36,
                                          \
                                          lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi-sinh pi}{2sinh pi} approx -0.64.
                                          $$

                                          These do not agree, so $sum_{n=1}^infty$ does not exist.






                                          share|cite|improve this answer























                                          • Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                            – JV.Stalker
                                            Dec 4 at 12:11















                                          up vote
                                          0
                                          down vote










                                          up vote
                                          0
                                          down vote









                                          Further remark on Mostafa's answer.
                                          $$
                                          lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi+sinh pi}{2sinh pi} approx 0.36,
                                          \
                                          lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi-sinh pi}{2sinh pi} approx -0.64.
                                          $$

                                          These do not agree, so $sum_{n=1}^infty$ does not exist.






                                          share|cite|improve this answer














                                          Further remark on Mostafa's answer.
                                          $$
                                          lim_{Ntoinfty}sum_{n=1}^{2N} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi+sinh pi}{2sinh pi} approx 0.36,
                                          \
                                          lim_{Ntoinfty}sum_{n=1}^{2N+1} frac{(n)^2(-1)^n} {1+(n^2)}=
                                          frac{-pi-sinh pi}{2sinh pi} approx -0.64.
                                          $$

                                          These do not agree, so $sum_{n=1}^infty$ does not exist.







                                          share|cite|improve this answer














                                          share|cite|improve this answer



                                          share|cite|improve this answer








                                          edited Dec 4 at 14:11

























                                          answered Dec 3 at 17:58









                                          GEdgar

                                          61.2k267167




                                          61.2k267167












                                          • Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                            – JV.Stalker
                                            Dec 4 at 12:11




















                                          • Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                            – JV.Stalker
                                            Dec 4 at 12:11


















                                          Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                          – JV.Stalker
                                          Dec 4 at 12:11






                                          Let me have a question, how did you determin the result of the first limsum? Because I get the same result but for the original sum. (I started from $sumlimits_{n=1}^infty (-1)^nbig(1-frac{1} {1+(n^2)}big)$, then separated the sum odd and even parts, using partial fractions and integration.)
                                          – JV.Stalker
                                          Dec 4 at 12:11




















                                          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%2f3023583%2fdoes-this-series-sum-n-1-infty-fracn2-1n-1n2-diverge-or-co%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

                                          Bressuire

                                          Cabo Verde

                                          Gyllenstierna