Equating the coefficients in $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!}...












2












$begingroup$


$$sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}$$



In the above equation is it possible to equate the coefficients of $frac{t^k}{k!}$? Or do we need to consider $(frac{t^k}{k!})^2$? Could you please give me an idea for this?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
    $endgroup$
    – user
    Jan 15 at 16:30










  • $begingroup$
    @user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
    $endgroup$
    – Soma Wick
    Jan 15 at 17:46


















2












$begingroup$


$$sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}$$



In the above equation is it possible to equate the coefficients of $frac{t^k}{k!}$? Or do we need to consider $(frac{t^k}{k!})^2$? Could you please give me an idea for this?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
    $endgroup$
    – user
    Jan 15 at 16:30










  • $begingroup$
    @user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
    $endgroup$
    – Soma Wick
    Jan 15 at 17:46
















2












2








2





$begingroup$


$$sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}$$



In the above equation is it possible to equate the coefficients of $frac{t^k}{k!}$? Or do we need to consider $(frac{t^k}{k!})^2$? Could you please give me an idea for this?










share|cite|improve this question











$endgroup$




$$sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}$$



In the above equation is it possible to equate the coefficients of $frac{t^k}{k!}$? Or do we need to consider $(frac{t^k}{k!})^2$? Could you please give me an idea for this?







sequences-and-series number-theory power-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 15 at 19:41









user

4,52011029




4,52011029










asked Jan 14 at 21:52









Soma WickSoma Wick

305




305












  • $begingroup$
    Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
    $endgroup$
    – user
    Jan 15 at 16:30










  • $begingroup$
    @user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
    $endgroup$
    – Soma Wick
    Jan 15 at 17:46




















  • $begingroup$
    Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
    $endgroup$
    – user
    Jan 15 at 16:30










  • $begingroup$
    @user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
    $endgroup$
    – Soma Wick
    Jan 15 at 17:46


















$begingroup$
Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
$endgroup$
– user
Jan 15 at 16:30




$begingroup$
Please do not change the text of the question after you have received an answer. I would propose to rollback to the version 2.
$endgroup$
– user
Jan 15 at 16:30












$begingroup$
@user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
$endgroup$
– Soma Wick
Jan 15 at 17:46






$begingroup$
@user I understand. My main question remains the same. I couldn`t write this in the comment box. That was why I wrote the steps for you to show how I did this.
$endgroup$
– Soma Wick
Jan 15 at 17:46












2 Answers
2






active

oldest

votes


















4












$begingroup$

Equating the coefficients at equal powers of $t$ on both sides one obtains:



$$C_{n-1}=sum_{k=0}^nfrac{n!}{k!(n-k)!}C_k.$$



The equating process goes as follows:



$$sum_{k=0}^infty C_k frac{t^k}{k!} sum_{m=0}^infty frac{t^m}{m!}
=sum_{k=0}^infty C_kfrac1{k!}sum_{m=0}^infty frac{t^{k+m}}{m!}\
stackrel{n=k+m}=sum_{k=0}^infty C_kfrac1{k!} sum_{n=k}^{infty} frac{t^{n}}{(n-k)!}
=sum_{n=0}^infty t^nsum_{k=0}^n C_k frac{1}{k!(n-k)!}\
=sum_{n=0}^inftyfrac{t^n}{n!}sum_{k=0}^n C_k frac{n!}{k!(n-k)!}.$$



The reason for the possibility of the exchange of the summation order in the second line is that both double sums run over the same set of indices: $0le kle n<infty$. It can be seen also from the fact that the summation in both $sum_{n=k}^{infty}$ and $sum_{k=0}^n$ formally can run from $0$ to infinity due to $(n-k)!$ term.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Thank you for the help!
    $endgroup$
    – Soma Wick
    Jan 14 at 22:15






  • 1




    $begingroup$
    You're welcome.
    $endgroup$
    – user
    Jan 14 at 22:16






  • 1




    $begingroup$
    If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
    $endgroup$
    – Soma Wick
    Jan 15 at 0:28






  • 2




    $begingroup$
    @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
    $endgroup$
    – user
    Jan 15 at 1:20






  • 1




    $begingroup$
    Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
    $endgroup$
    – Soma Wick
    Jan 15 at 2:21



















4












$begingroup$

$sum_{n=1}^infty C_{n-1} frac{t^n}{n!}
=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
$



Here's how you get
the binomial coefficients.



Note:
These are called exponential generating functions
because of their similarity to
$e^t
=sum_{m=0}^infty frac{t^m}{m!}
$
.



$begin{array}\
sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
&=sum_{n=0}^inftysum_{m=0}^infty C_n frac{t^{n+m}}{n!m!}\
&=sum_{k=0}^inftysum_{n=0}^k C_n frac{t^{k}}{n!(k-n)!}
qquad n+m = k, m = k-n\
&=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n frac{k!}{n!(k-n)!}\
&=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n binom{k}{n}\
end{array}
$






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%2f3073801%2fequating-the-coefficients-in-sum-n-1-infty-c-n-1-fractnn-sum-n-0%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    4












    $begingroup$

    Equating the coefficients at equal powers of $t$ on both sides one obtains:



    $$C_{n-1}=sum_{k=0}^nfrac{n!}{k!(n-k)!}C_k.$$



    The equating process goes as follows:



    $$sum_{k=0}^infty C_k frac{t^k}{k!} sum_{m=0}^infty frac{t^m}{m!}
    =sum_{k=0}^infty C_kfrac1{k!}sum_{m=0}^infty frac{t^{k+m}}{m!}\
    stackrel{n=k+m}=sum_{k=0}^infty C_kfrac1{k!} sum_{n=k}^{infty} frac{t^{n}}{(n-k)!}
    =sum_{n=0}^infty t^nsum_{k=0}^n C_k frac{1}{k!(n-k)!}\
    =sum_{n=0}^inftyfrac{t^n}{n!}sum_{k=0}^n C_k frac{n!}{k!(n-k)!}.$$



    The reason for the possibility of the exchange of the summation order in the second line is that both double sums run over the same set of indices: $0le kle n<infty$. It can be seen also from the fact that the summation in both $sum_{n=k}^{infty}$ and $sum_{k=0}^n$ formally can run from $0$ to infinity due to $(n-k)!$ term.






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Thank you for the help!
      $endgroup$
      – Soma Wick
      Jan 14 at 22:15






    • 1




      $begingroup$
      You're welcome.
      $endgroup$
      – user
      Jan 14 at 22:16






    • 1




      $begingroup$
      If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
      $endgroup$
      – Soma Wick
      Jan 15 at 0:28






    • 2




      $begingroup$
      @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
      $endgroup$
      – user
      Jan 15 at 1:20






    • 1




      $begingroup$
      Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
      $endgroup$
      – Soma Wick
      Jan 15 at 2:21
















    4












    $begingroup$

    Equating the coefficients at equal powers of $t$ on both sides one obtains:



    $$C_{n-1}=sum_{k=0}^nfrac{n!}{k!(n-k)!}C_k.$$



    The equating process goes as follows:



    $$sum_{k=0}^infty C_k frac{t^k}{k!} sum_{m=0}^infty frac{t^m}{m!}
    =sum_{k=0}^infty C_kfrac1{k!}sum_{m=0}^infty frac{t^{k+m}}{m!}\
    stackrel{n=k+m}=sum_{k=0}^infty C_kfrac1{k!} sum_{n=k}^{infty} frac{t^{n}}{(n-k)!}
    =sum_{n=0}^infty t^nsum_{k=0}^n C_k frac{1}{k!(n-k)!}\
    =sum_{n=0}^inftyfrac{t^n}{n!}sum_{k=0}^n C_k frac{n!}{k!(n-k)!}.$$



    The reason for the possibility of the exchange of the summation order in the second line is that both double sums run over the same set of indices: $0le kle n<infty$. It can be seen also from the fact that the summation in both $sum_{n=k}^{infty}$ and $sum_{k=0}^n$ formally can run from $0$ to infinity due to $(n-k)!$ term.






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Thank you for the help!
      $endgroup$
      – Soma Wick
      Jan 14 at 22:15






    • 1




      $begingroup$
      You're welcome.
      $endgroup$
      – user
      Jan 14 at 22:16






    • 1




      $begingroup$
      If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
      $endgroup$
      – Soma Wick
      Jan 15 at 0:28






    • 2




      $begingroup$
      @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
      $endgroup$
      – user
      Jan 15 at 1:20






    • 1




      $begingroup$
      Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
      $endgroup$
      – Soma Wick
      Jan 15 at 2:21














    4












    4








    4





    $begingroup$

    Equating the coefficients at equal powers of $t$ on both sides one obtains:



    $$C_{n-1}=sum_{k=0}^nfrac{n!}{k!(n-k)!}C_k.$$



    The equating process goes as follows:



    $$sum_{k=0}^infty C_k frac{t^k}{k!} sum_{m=0}^infty frac{t^m}{m!}
    =sum_{k=0}^infty C_kfrac1{k!}sum_{m=0}^infty frac{t^{k+m}}{m!}\
    stackrel{n=k+m}=sum_{k=0}^infty C_kfrac1{k!} sum_{n=k}^{infty} frac{t^{n}}{(n-k)!}
    =sum_{n=0}^infty t^nsum_{k=0}^n C_k frac{1}{k!(n-k)!}\
    =sum_{n=0}^inftyfrac{t^n}{n!}sum_{k=0}^n C_k frac{n!}{k!(n-k)!}.$$



    The reason for the possibility of the exchange of the summation order in the second line is that both double sums run over the same set of indices: $0le kle n<infty$. It can be seen also from the fact that the summation in both $sum_{n=k}^{infty}$ and $sum_{k=0}^n$ formally can run from $0$ to infinity due to $(n-k)!$ term.






    share|cite|improve this answer











    $endgroup$



    Equating the coefficients at equal powers of $t$ on both sides one obtains:



    $$C_{n-1}=sum_{k=0}^nfrac{n!}{k!(n-k)!}C_k.$$



    The equating process goes as follows:



    $$sum_{k=0}^infty C_k frac{t^k}{k!} sum_{m=0}^infty frac{t^m}{m!}
    =sum_{k=0}^infty C_kfrac1{k!}sum_{m=0}^infty frac{t^{k+m}}{m!}\
    stackrel{n=k+m}=sum_{k=0}^infty C_kfrac1{k!} sum_{n=k}^{infty} frac{t^{n}}{(n-k)!}
    =sum_{n=0}^infty t^nsum_{k=0}^n C_k frac{1}{k!(n-k)!}\
    =sum_{n=0}^inftyfrac{t^n}{n!}sum_{k=0}^n C_k frac{n!}{k!(n-k)!}.$$



    The reason for the possibility of the exchange of the summation order in the second line is that both double sums run over the same set of indices: $0le kle n<infty$. It can be seen also from the fact that the summation in both $sum_{n=k}^{infty}$ and $sum_{k=0}^n$ formally can run from $0$ to infinity due to $(n-k)!$ term.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Jan 15 at 16:03

























    answered Jan 14 at 22:02









    useruser

    4,52011029




    4,52011029








    • 1




      $begingroup$
      Thank you for the help!
      $endgroup$
      – Soma Wick
      Jan 14 at 22:15






    • 1




      $begingroup$
      You're welcome.
      $endgroup$
      – user
      Jan 14 at 22:16






    • 1




      $begingroup$
      If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
      $endgroup$
      – Soma Wick
      Jan 15 at 0:28






    • 2




      $begingroup$
      @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
      $endgroup$
      – user
      Jan 15 at 1:20






    • 1




      $begingroup$
      Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
      $endgroup$
      – Soma Wick
      Jan 15 at 2:21














    • 1




      $begingroup$
      Thank you for the help!
      $endgroup$
      – Soma Wick
      Jan 14 at 22:15






    • 1




      $begingroup$
      You're welcome.
      $endgroup$
      – user
      Jan 14 at 22:16






    • 1




      $begingroup$
      If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
      $endgroup$
      – Soma Wick
      Jan 15 at 0:28






    • 2




      $begingroup$
      @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
      $endgroup$
      – user
      Jan 15 at 1:20






    • 1




      $begingroup$
      Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
      $endgroup$
      – Soma Wick
      Jan 15 at 2:21








    1




    1




    $begingroup$
    Thank you for the help!
    $endgroup$
    – Soma Wick
    Jan 14 at 22:15




    $begingroup$
    Thank you for the help!
    $endgroup$
    – Soma Wick
    Jan 14 at 22:15




    1




    1




    $begingroup$
    You're welcome.
    $endgroup$
    – user
    Jan 14 at 22:16




    $begingroup$
    You're welcome.
    $endgroup$
    – user
    Jan 14 at 22:16




    1




    1




    $begingroup$
    If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
    $endgroup$
    – Soma Wick
    Jan 15 at 0:28




    $begingroup$
    If we change the equation as $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}=sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^{2m+1}}{(2m+1)!}$, will the result be the same?
    $endgroup$
    – Soma Wick
    Jan 15 at 0:28




    2




    2




    $begingroup$
    @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
    $endgroup$
    – user
    Jan 15 at 1:20




    $begingroup$
    @SomaWick The result will be similar. The sum will be only over $k$ with parity different from that of $n$.
    $endgroup$
    – user
    Jan 15 at 1:20




    1




    1




    $begingroup$
    Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
    $endgroup$
    – Soma Wick
    Jan 15 at 2:21




    $begingroup$
    Thank you. But I don`t understand how to get the binomial coefficient part. Could you please help me to understand it?
    $endgroup$
    – Soma Wick
    Jan 15 at 2:21











    4












    $begingroup$

    $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}
    =sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
    $



    Here's how you get
    the binomial coefficients.



    Note:
    These are called exponential generating functions
    because of their similarity to
    $e^t
    =sum_{m=0}^infty frac{t^m}{m!}
    $
    .



    $begin{array}\
    sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
    &=sum_{n=0}^inftysum_{m=0}^infty C_n frac{t^{n+m}}{n!m!}\
    &=sum_{k=0}^inftysum_{n=0}^k C_n frac{t^{k}}{n!(k-n)!}
    qquad n+m = k, m = k-n\
    &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n frac{k!}{n!(k-n)!}\
    &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n binom{k}{n}\
    end{array}
    $






    share|cite|improve this answer









    $endgroup$


















      4












      $begingroup$

      $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}
      =sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
      $



      Here's how you get
      the binomial coefficients.



      Note:
      These are called exponential generating functions
      because of their similarity to
      $e^t
      =sum_{m=0}^infty frac{t^m}{m!}
      $
      .



      $begin{array}\
      sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
      &=sum_{n=0}^inftysum_{m=0}^infty C_n frac{t^{n+m}}{n!m!}\
      &=sum_{k=0}^inftysum_{n=0}^k C_n frac{t^{k}}{n!(k-n)!}
      qquad n+m = k, m = k-n\
      &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n frac{k!}{n!(k-n)!}\
      &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n binom{k}{n}\
      end{array}
      $






      share|cite|improve this answer









      $endgroup$
















        4












        4








        4





        $begingroup$

        $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}
        =sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
        $



        Here's how you get
        the binomial coefficients.



        Note:
        These are called exponential generating functions
        because of their similarity to
        $e^t
        =sum_{m=0}^infty frac{t^m}{m!}
        $
        .



        $begin{array}\
        sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
        &=sum_{n=0}^inftysum_{m=0}^infty C_n frac{t^{n+m}}{n!m!}\
        &=sum_{k=0}^inftysum_{n=0}^k C_n frac{t^{k}}{n!(k-n)!}
        qquad n+m = k, m = k-n\
        &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n frac{k!}{n!(k-n)!}\
        &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n binom{k}{n}\
        end{array}
        $






        share|cite|improve this answer









        $endgroup$



        $sum_{n=1}^infty C_{n-1} frac{t^n}{n!}
        =sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
        $



        Here's how you get
        the binomial coefficients.



        Note:
        These are called exponential generating functions
        because of their similarity to
        $e^t
        =sum_{m=0}^infty frac{t^m}{m!}
        $
        .



        $begin{array}\
        sum_{n=0}^infty C_n frac{t^n}{n!} sum_{m=0}^infty frac{t^m}{m!}
        &=sum_{n=0}^inftysum_{m=0}^infty C_n frac{t^{n+m}}{n!m!}\
        &=sum_{k=0}^inftysum_{n=0}^k C_n frac{t^{k}}{n!(k-n)!}
        qquad n+m = k, m = k-n\
        &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n frac{k!}{n!(k-n)!}\
        &=sum_{k=0}^inftyfrac{t^k}{k!}sum_{n=0}^k C_n binom{k}{n}\
        end{array}
        $







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 15 at 2:46









        marty cohenmarty cohen

        73.7k549128




        73.7k549128






























            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%2f3073801%2fequating-the-coefficients-in-sum-n-1-infty-c-n-1-fractnn-sum-n-0%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

            MongoDB - Not Authorized To Execute Command

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

            How to fix TextFormField cause rebuild widget in Flutter