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}$$
sequences-and-series
add a comment |
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}$$
sequences-and-series
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
add a comment |
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}$$
sequences-and-series
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
sequences-and-series
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
add a comment |
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
add a comment |
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}$.
add a comment |
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}$.
add a comment |
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}$.
add a comment |
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}$.
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}$.
answered 2 days ago
Kavi Rama Murthy
39.1k31748
39.1k31748
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
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