Proof that for infinite sum: $sum_{mgeq n}^infty frac{(lambda (1-p)t)^m}{(m-n)!}=((1-p)lambda t)^n...











up vote
0
down vote

favorite












How can I prove that:



$$sum_{mgeq n}^infty frac{(lambda (1-p)t)^m}{(m-n)!}=((1-p)lambda t)^n e^{(1-p)lambda t}$$










share|cite|improve this question
























  • The left side not even defined.
    – Kavi Rama Murthy
    2 days ago










  • @KaviRamaMurthy Better now?
    – Dole
    2 days ago










  • Perhaps the denominator is $(m - n)!$.
    – Awe Kumar Jha
    2 days ago










  • Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
    – Kevin
    2 days ago

















up vote
0
down vote

favorite












How can I prove that:



$$sum_{mgeq n}^infty frac{(lambda (1-p)t)^m}{(m-n)!}=((1-p)lambda t)^n e^{(1-p)lambda t}$$










share|cite|improve this question
























  • The left side not even defined.
    – Kavi Rama Murthy
    2 days ago










  • @KaviRamaMurthy Better now?
    – Dole
    2 days ago










  • Perhaps the denominator is $(m - n)!$.
    – Awe Kumar Jha
    2 days ago










  • Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
    – Kevin
    2 days ago















up vote
0
down vote

favorite









up vote
0
down vote

favorite











How can I prove that:



$$sum_{mgeq n}^infty frac{(lambda (1-p)t)^m}{(m-n)!}=((1-p)lambda t)^n e^{(1-p)lambda t}$$










share|cite|improve this question















How can I prove that:



$$sum_{mgeq n}^infty frac{(lambda (1-p)t)^m}{(m-n)!}=((1-p)lambda t)^n e^{(1-p)lambda t}$$







sequences-and-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago

























asked 2 days ago









Dole

865514




865514












  • The left side not even defined.
    – Kavi Rama Murthy
    2 days ago










  • @KaviRamaMurthy Better now?
    – Dole
    2 days ago










  • Perhaps the denominator is $(m - n)!$.
    – Awe Kumar Jha
    2 days ago










  • Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
    – Kevin
    2 days ago




















  • The left side not even defined.
    – Kavi Rama Murthy
    2 days ago










  • @KaviRamaMurthy Better now?
    – Dole
    2 days ago










  • Perhaps the denominator is $(m - n)!$.
    – Awe Kumar Jha
    2 days ago










  • Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
    – Kevin
    2 days ago


















The left side not even defined.
– Kavi Rama Murthy
2 days ago




The left side not even defined.
– Kavi Rama Murthy
2 days ago












@KaviRamaMurthy Better now?
– Dole
2 days ago




@KaviRamaMurthy Better now?
– Dole
2 days ago












Perhaps the denominator is $(m - n)!$.
– Awe Kumar Jha
2 days ago




Perhaps the denominator is $(m - n)!$.
– Awe Kumar Jha
2 days ago












Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
– Kevin
2 days ago






Is $n$ a free choice, or should you be considering $sum_n sum_{m geq n} ldots$?
– Kevin
2 days ago












1 Answer
1






active

oldest

votes

















up vote
5
down vote



accepted










I am interpreting $m-n!$ as $(m-n)!$. Just change the variable from $m$ to $j=m-n$. Let $x=lambda (1-p)t$. You will get $sum_{j=1}^{infty} frac {x^{j+n}} {j!}$. Pull out $x^{n}$ and use the series for $e^{x}$.






share|cite|improve this answer





















    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














     

    draft saved


    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996505%2fproof-that-for-infinite-sum-sum-m-geq-n-infty-frac-lambda-1-ptmm%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    5
    down vote



    accepted










    I am interpreting $m-n!$ as $(m-n)!$. Just change the variable from $m$ to $j=m-n$. Let $x=lambda (1-p)t$. You will get $sum_{j=1}^{infty} frac {x^{j+n}} {j!}$. Pull out $x^{n}$ and use the series for $e^{x}$.






    share|cite|improve this answer

























      up vote
      5
      down vote



      accepted










      I am interpreting $m-n!$ as $(m-n)!$. Just change the variable from $m$ to $j=m-n$. Let $x=lambda (1-p)t$. You will get $sum_{j=1}^{infty} frac {x^{j+n}} {j!}$. Pull out $x^{n}$ and use the series for $e^{x}$.






      share|cite|improve this answer























        up vote
        5
        down vote



        accepted







        up vote
        5
        down vote



        accepted






        I am interpreting $m-n!$ as $(m-n)!$. Just change the variable from $m$ to $j=m-n$. Let $x=lambda (1-p)t$. You will get $sum_{j=1}^{infty} frac {x^{j+n}} {j!}$. Pull out $x^{n}$ and use the series for $e^{x}$.






        share|cite|improve this answer












        I am interpreting $m-n!$ as $(m-n)!$. Just change the variable from $m$ to $j=m-n$. Let $x=lambda (1-p)t$. You will get $sum_{j=1}^{infty} frac {x^{j+n}} {j!}$. Pull out $x^{n}$ and use the series for $e^{x}$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 2 days ago









        Kavi Rama Murthy

        39.1k31748




        39.1k31748






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996505%2fproof-that-for-infinite-sum-sum-m-geq-n-infty-frac-lambda-1-ptmm%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

            How do I know what Microsoft account the skydrive app is syncing to?

            When does type information flow backwards in C++?

            Grease: Live!