Finding sum to infinity












4












$begingroup$


I am trying to find what this value will converge to
$$sum_{n = 1}^{ infty}frac{n^2}{n!}$$



I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.



Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?






calculus sequences-and-series taylor-expansion







share|cite|improve this question











$endgroup$












  • $begingroup$
    In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
    $endgroup$
    – Sangchul Lee
    42 mins ago


















4












$begingroup$


I am trying to find what this value will converge to
$$sum_{n = 1}^{ infty}frac{n^2}{n!}$$



I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.



Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?






calculus sequences-and-series taylor-expansion







share|cite|improve this question











$endgroup$












  • $begingroup$
    In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
    $endgroup$
    – Sangchul Lee
    42 mins ago
















4












4








4


1



$begingroup$


I am trying to find what this value will converge to
$$sum_{n = 1}^{ infty}frac{n^2}{n!}$$



I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.



Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?






calculus sequences-and-series taylor-expansion







share|cite|improve this question











$endgroup$




I am trying to find what this value will converge to
$$sum_{n = 1}^{ infty}frac{n^2}{n!}$$



I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.



Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?






calculus sequences-and-series taylor-expansion




calculus sequences-and-series taylor-expansion






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 32 mins ago







user601297

















asked 53 mins ago









user601297user601297

37519




37519












  • $begingroup$
    In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
    $endgroup$
    – Sangchul Lee
    42 mins ago




















  • $begingroup$
    In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
    $endgroup$
    – Sangchul Lee
    42 mins ago


















$begingroup$
In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
42 mins ago






$begingroup$
In general, $$ sum_{n=0}^{infty} frac{n^k}{n!} = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
42 mins ago












3 Answers
3






active

oldest

votes


















8












$begingroup$

One may write
begin{align}
sum_{n = 1}^{ infty}frac{n^2}{n!}&=sum_{n = 1}^{ infty}frac{n(n-1)+n}{n!}
\\&=sum_{n = 1}^{ infty}frac{n(n-1)}{n!}+sum_{n = 1}^{ infty}frac{n}{n!}
\\&=sum_{n = 2}^{ infty}frac{1}{(n-2)!}+sum_{n = 1}^{ infty}frac{1}{(n-1)!}
end{align}Can you take it from here?






share|cite|improve this answer









$endgroup$









  • 2




    $begingroup$
    Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
    $endgroup$
    – Jimmy Sabater
    46 mins ago












  • $begingroup$
    Ok both expressions sum to $e$, i get it, thanks a lot
    $endgroup$
    – user601297
    40 mins ago



















2












$begingroup$

$$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
Taking $d/dx$ on both sides,
$$e^x=sum_{ngeq1}frac{n}{n!}x^{n-1}$$
Multiplying both sides by $x$,
$$xe^x=sum_{ngeq1}frac{n}{n!}x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^{n-1}$$
Then plug in $x=1$:
$$sum_{ngeq1}frac{n^2}{n!}=2e$$




Edit



This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfrac{d}{dx}$ operator $k$ times. Example:
$$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
Apply $xfrac{d}{dx}$:
$$xe^x=sum_{ngeq1}frac{x}{n!}x^n$$
Apply $xfrac{d}{dx}$:
$$x(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^n$$
The pattern continues:
$$left(xfrac{d}{dx}right)^k[e^x-1]=sum_{ngeq1}frac{n^k}{n!}x^n$$




A similar thing can be done with integration. Example:



Evaluate $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}$$
Start by recalling that (use geometric series)
$$frac1{1+t^2}=sum_{ngeq0}(-1)^nt^{2n}$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_{ngeq0}frac{(-1)^n}{2n+1}x^{2n+1}$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}=fracpi4-frac12log2$$






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Amazing, this is exactly what I was looking for
    $endgroup$
    – user601297
    34 mins ago










  • $begingroup$
    @user601297 you are very welcome :)
    $endgroup$
    – clathratus
    32 mins ago



















0












$begingroup$

Just to give a slightly different approach,



$$sum_{n=1}^infty{n^2over n!}=sum_{n=1}^infty{nover(n-1)!}=sum_{m=0}^infty{m+1over m!}=sum_{m=0}^infty{mover m!}+e=sum_{m=1}^infty{mover m!}+e=sum_{m=1}^infty{1over(m-1)!}+e=sum_{k=0}^infty{1over k!}+e=e+e$$



The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.






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%2f3078955%2ffinding-sum-to-infinity%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    8












    $begingroup$

    One may write
    begin{align}
    sum_{n = 1}^{ infty}frac{n^2}{n!}&=sum_{n = 1}^{ infty}frac{n(n-1)+n}{n!}
    \\&=sum_{n = 1}^{ infty}frac{n(n-1)}{n!}+sum_{n = 1}^{ infty}frac{n}{n!}
    \\&=sum_{n = 2}^{ infty}frac{1}{(n-2)!}+sum_{n = 1}^{ infty}frac{1}{(n-1)!}
    end{align}    Can you take it from here?






    share|cite|improve this answer









    $endgroup$









    • 2




      $begingroup$
      Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
      $endgroup$
      – Jimmy Sabater
      46 mins ago












    • $begingroup$
      Ok both expressions sum to $e$, i get it, thanks a lot
      $endgroup$
      – user601297
      40 mins ago
















    8












    $begingroup$

    One may write
    begin{align}
    sum_{n = 1}^{ infty}frac{n^2}{n!}&=sum_{n = 1}^{ infty}frac{n(n-1)+n}{n!}
    \\&=sum_{n = 1}^{ infty}frac{n(n-1)}{n!}+sum_{n = 1}^{ infty}frac{n}{n!}
    \\&=sum_{n = 2}^{ infty}frac{1}{(n-2)!}+sum_{n = 1}^{ infty}frac{1}{(n-1)!}
    end{align}    Can you take it from here?






    share|cite|improve this answer









    $endgroup$









    • 2




      $begingroup$
      Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
      $endgroup$
      – Jimmy Sabater
      46 mins ago












    • $begingroup$
      Ok both expressions sum to $e$, i get it, thanks a lot
      $endgroup$
      – user601297
      40 mins ago














    8












    8








    8





    $begingroup$

    One may write
    begin{align}
    sum_{n = 1}^{ infty}frac{n^2}{n!}&=sum_{n = 1}^{ infty}frac{n(n-1)+n}{n!}
    \\&=sum_{n = 1}^{ infty}frac{n(n-1)}{n!}+sum_{n = 1}^{ infty}frac{n}{n!}
    \\&=sum_{n = 2}^{ infty}frac{1}{(n-2)!}+sum_{n = 1}^{ infty}frac{1}{(n-1)!}
    end{align}    Can you take it from here?






    share|cite|improve this answer









    $endgroup$



    One may write
    begin{align}
    sum_{n = 1}^{ infty}frac{n^2}{n!}&=sum_{n = 1}^{ infty}frac{n(n-1)+n}{n!}
    \\&=sum_{n = 1}^{ infty}frac{n(n-1)}{n!}+sum_{n = 1}^{ infty}frac{n}{n!}
    \\&=sum_{n = 2}^{ infty}frac{1}{(n-2)!}+sum_{n = 1}^{ infty}frac{1}{(n-1)!}
    end{align}    Can you take it from here?







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered 49 mins ago









    Olivier OloaOlivier Oloa

    108k17176293




    108k17176293








    • 2




      $begingroup$
      Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
      $endgroup$
      – Jimmy Sabater
      46 mins ago












    • $begingroup$
      Ok both expressions sum to $e$, i get it, thanks a lot
      $endgroup$
      – user601297
      40 mins ago














    • 2




      $begingroup$
      Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
      $endgroup$
      – Jimmy Sabater
      46 mins ago












    • $begingroup$
      Ok both expressions sum to $e$, i get it, thanks a lot
      $endgroup$
      – user601297
      40 mins ago








    2




    2




    $begingroup$
    Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
    $endgroup$
    – Jimmy Sabater
    46 mins ago






    $begingroup$
    Further hints: Since $e^1 = sum_{n=0}^{infty} frac{1}{n!}$, we have $$ sum_{n=2}^{infty} frac{1}{(n-2)!}= 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ and $$ sum_{n=1}^{infty} frac{1}{(n-1)!} = 1 + frac{1}{2} + frac{1}{3!} + .... = sum_{n=0}^{infty} frac{1}{n!} $$ So, ans: $boxed{ 2 mathrm{e} } $
    $endgroup$
    – Jimmy Sabater
    46 mins ago














    $begingroup$
    Ok both expressions sum to $e$, i get it, thanks a lot
    $endgroup$
    – user601297
    40 mins ago




    $begingroup$
    Ok both expressions sum to $e$, i get it, thanks a lot
    $endgroup$
    – user601297
    40 mins ago











    2












    $begingroup$

    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Taking $d/dx$ on both sides,
    $$e^x=sum_{ngeq1}frac{n}{n!}x^{n-1}$$
    Multiplying both sides by $x$,
    $$xe^x=sum_{ngeq1}frac{n}{n!}x^n$$
    Then taking $d/dx$ on both sides again,
    $$(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^{n-1}$$
    Then plug in $x=1$:
    $$sum_{ngeq1}frac{n^2}{n!}=2e$$




    Edit



    This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfrac{d}{dx}$ operator $k$ times. Example:
    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Apply $xfrac{d}{dx}$:
    $$xe^x=sum_{ngeq1}frac{x}{n!}x^n$$
    Apply $xfrac{d}{dx}$:
    $$x(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^n$$
    The pattern continues:
    $$left(xfrac{d}{dx}right)^k[e^x-1]=sum_{ngeq1}frac{n^k}{n!}x^n$$




    A similar thing can be done with integration. Example:



    Evaluate $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}$$
    Start by recalling that (use geometric series)
    $$frac1{1+t^2}=sum_{ngeq0}(-1)^nt^{2n}$$
    Then integrate both sides from $0$ to $x$ to get
    $$arctan x=sum_{ngeq0}frac{(-1)^n}{2n+1}x^{2n+1}$$
    integrate both sides from $0$ to $1$ now to produce
    $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}=fracpi4-frac12log2$$






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Amazing, this is exactly what I was looking for
      $endgroup$
      – user601297
      34 mins ago










    • $begingroup$
      @user601297 you are very welcome :)
      $endgroup$
      – clathratus
      32 mins ago
















    2












    $begingroup$

    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Taking $d/dx$ on both sides,
    $$e^x=sum_{ngeq1}frac{n}{n!}x^{n-1}$$
    Multiplying both sides by $x$,
    $$xe^x=sum_{ngeq1}frac{n}{n!}x^n$$
    Then taking $d/dx$ on both sides again,
    $$(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^{n-1}$$
    Then plug in $x=1$:
    $$sum_{ngeq1}frac{n^2}{n!}=2e$$




    Edit



    This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfrac{d}{dx}$ operator $k$ times. Example:
    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Apply $xfrac{d}{dx}$:
    $$xe^x=sum_{ngeq1}frac{x}{n!}x^n$$
    Apply $xfrac{d}{dx}$:
    $$x(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^n$$
    The pattern continues:
    $$left(xfrac{d}{dx}right)^k[e^x-1]=sum_{ngeq1}frac{n^k}{n!}x^n$$




    A similar thing can be done with integration. Example:



    Evaluate $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}$$
    Start by recalling that (use geometric series)
    $$frac1{1+t^2}=sum_{ngeq0}(-1)^nt^{2n}$$
    Then integrate both sides from $0$ to $x$ to get
    $$arctan x=sum_{ngeq0}frac{(-1)^n}{2n+1}x^{2n+1}$$
    integrate both sides from $0$ to $1$ now to produce
    $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}=fracpi4-frac12log2$$






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Amazing, this is exactly what I was looking for
      $endgroup$
      – user601297
      34 mins ago










    • $begingroup$
      @user601297 you are very welcome :)
      $endgroup$
      – clathratus
      32 mins ago














    2












    2








    2





    $begingroup$

    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Taking $d/dx$ on both sides,
    $$e^x=sum_{ngeq1}frac{n}{n!}x^{n-1}$$
    Multiplying both sides by $x$,
    $$xe^x=sum_{ngeq1}frac{n}{n!}x^n$$
    Then taking $d/dx$ on both sides again,
    $$(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^{n-1}$$
    Then plug in $x=1$:
    $$sum_{ngeq1}frac{n^2}{n!}=2e$$




    Edit



    This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfrac{d}{dx}$ operator $k$ times. Example:
    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Apply $xfrac{d}{dx}$:
    $$xe^x=sum_{ngeq1}frac{x}{n!}x^n$$
    Apply $xfrac{d}{dx}$:
    $$x(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^n$$
    The pattern continues:
    $$left(xfrac{d}{dx}right)^k[e^x-1]=sum_{ngeq1}frac{n^k}{n!}x^n$$




    A similar thing can be done with integration. Example:



    Evaluate $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}$$
    Start by recalling that (use geometric series)
    $$frac1{1+t^2}=sum_{ngeq0}(-1)^nt^{2n}$$
    Then integrate both sides from $0$ to $x$ to get
    $$arctan x=sum_{ngeq0}frac{(-1)^n}{2n+1}x^{2n+1}$$
    integrate both sides from $0$ to $1$ now to produce
    $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}=fracpi4-frac12log2$$






    share|cite|improve this answer











    $endgroup$



    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Taking $d/dx$ on both sides,
    $$e^x=sum_{ngeq1}frac{n}{n!}x^{n-1}$$
    Multiplying both sides by $x$,
    $$xe^x=sum_{ngeq1}frac{n}{n!}x^n$$
    Then taking $d/dx$ on both sides again,
    $$(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^{n-1}$$
    Then plug in $x=1$:
    $$sum_{ngeq1}frac{n^2}{n!}=2e$$




    Edit



    This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfrac{d}{dx}$ operator $k$ times. Example:
    $$e^x-1=sum_{ngeq1}frac{x^n}{n!}$$
    Apply $xfrac{d}{dx}$:
    $$xe^x=sum_{ngeq1}frac{x}{n!}x^n$$
    Apply $xfrac{d}{dx}$:
    $$x(x+1)e^x=sum_{ngeq1}frac{n^2}{n!}x^n$$
    The pattern continues:
    $$left(xfrac{d}{dx}right)^k[e^x-1]=sum_{ngeq1}frac{n^k}{n!}x^n$$




    A similar thing can be done with integration. Example:



    Evaluate $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}$$
    Start by recalling that (use geometric series)
    $$frac1{1+t^2}=sum_{ngeq0}(-1)^nt^{2n}$$
    Then integrate both sides from $0$ to $x$ to get
    $$arctan x=sum_{ngeq0}frac{(-1)^n}{2n+1}x^{2n+1}$$
    integrate both sides from $0$ to $1$ now to produce
    $$S=sum_{ngeq0}frac{(-1)^n}{(2n+2)(2n+1)}=fracpi4-frac12log2$$







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited 7 mins ago

























    answered 39 mins ago









    clathratusclathratus

    3,651332




    3,651332








    • 1




      $begingroup$
      Amazing, this is exactly what I was looking for
      $endgroup$
      – user601297
      34 mins ago










    • $begingroup$
      @user601297 you are very welcome :)
      $endgroup$
      – clathratus
      32 mins ago














    • 1




      $begingroup$
      Amazing, this is exactly what I was looking for
      $endgroup$
      – user601297
      34 mins ago










    • $begingroup$
      @user601297 you are very welcome :)
      $endgroup$
      – clathratus
      32 mins ago








    1




    1




    $begingroup$
    Amazing, this is exactly what I was looking for
    $endgroup$
    – user601297
    34 mins ago




    $begingroup$
    Amazing, this is exactly what I was looking for
    $endgroup$
    – user601297
    34 mins ago












    $begingroup$
    @user601297 you are very welcome :)
    $endgroup$
    – clathratus
    32 mins ago




    $begingroup$
    @user601297 you are very welcome :)
    $endgroup$
    – clathratus
    32 mins ago











    0












    $begingroup$

    Just to give a slightly different approach,



    $$sum_{n=1}^infty{n^2over n!}=sum_{n=1}^infty{nover(n-1)!}=sum_{m=0}^infty{m+1over m!}=sum_{m=0}^infty{mover m!}+e=sum_{m=1}^infty{mover m!}+e=sum_{m=1}^infty{1over(m-1)!}+e=sum_{k=0}^infty{1over k!}+e=e+e$$



    The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Just to give a slightly different approach,



      $$sum_{n=1}^infty{n^2over n!}=sum_{n=1}^infty{nover(n-1)!}=sum_{m=0}^infty{m+1over m!}=sum_{m=0}^infty{mover m!}+e=sum_{m=1}^infty{mover m!}+e=sum_{m=1}^infty{1over(m-1)!}+e=sum_{k=0}^infty{1over k!}+e=e+e$$



      The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Just to give a slightly different approach,



        $$sum_{n=1}^infty{n^2over n!}=sum_{n=1}^infty{nover(n-1)!}=sum_{m=0}^infty{m+1over m!}=sum_{m=0}^infty{mover m!}+e=sum_{m=1}^infty{mover m!}+e=sum_{m=1}^infty{1over(m-1)!}+e=sum_{k=0}^infty{1over k!}+e=e+e$$



        The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.






        share|cite|improve this answer









        $endgroup$



        Just to give a slightly different approach,



        $$sum_{n=1}^infty{n^2over n!}=sum_{n=1}^infty{nover(n-1)!}=sum_{m=0}^infty{m+1over m!}=sum_{m=0}^infty{mover m!}+e=sum_{m=1}^infty{mover m!}+e=sum_{m=1}^infty{1over(m-1)!}+e=sum_{k=0}^infty{1over k!}+e=e+e$$



        The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 22 mins ago









        Barry CipraBarry Cipra

        59.4k653125




        59.4k653125






























            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%2f3078955%2ffinding-sum-to-infinity%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

            404 Error Contact Form 7 ajax form submitting

            Image
            0 The contact form does not work, and affects loading after one try. The chrome console shows the error message: POST http://example.com/wp-json/contact-form-7/v1/contact-forms/50/feedback 404 (Not Found) send @ jquery.js?ver=1.12.4:4 ajax @ jquery.js?ver=1.12.4:4 wpcf7.submit @ scripts.js?ver=5.0.3:346 (anonymous) @ scripts.js?ver=5.0.3:53 dispatch @ jquery.js?ver=1.12.4:3 r.handle @ jquery.js?ver=1.12.4:3 How to solve this issue? thanks in advance javascript wordpress contact-form-7 share | improve this question edited Jul 17 '18 at 5:39 Kiran Shahi 4,745 3 16 43
            Read more

            How to know if a Active Directory user can login interactively

            Image
            1 I would like to know if and how is it possible to know if a AD user can login interactively (on a server) in a domain. I need to know if I can find it out using a LDAP search. Thanks. windows active-directory login user-permissions user-profile share | improve this question edited 1 hour ago yagmoth555 ♦ 11.6k 3 17 42 asked 1 hour ago Luigi Luigi 6 1 New contributor
            Read more

            TypeError: fit_transform() missing 1 required positional argument: 'X'

            Image
            0 I am trying to do Feature Scaling in a dataset, but I get an error and have no idea how to proceed: > Traceback (most recent call last): > > File "<ipython-input-10-71bea414b4d0>", line 22, in <module> > x_train = sc_X.fit_transform(x_train) > > TypeError: fit_transform() missing 1 required positional argument: 'X' and here is my code: import pandas as pd # Importing the dataset dataset = pd.read_csv('Data.csv') X = dataset.iloc[:, :-1].values y = dataset.iloc[:, 3].values # Taking care of missing data from sklearn.preprocessing import Imputer imputer = Imputer(missing_values="NaN", strategy="mean", axis=0) imputer = Imputer.fit(imputer,X[:,1:3]) X[:, 1:3] = Imputer.transform(imputer,X[
            Read more