Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$
up vote
2
down vote
favorite
Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$.
It is suggested that I can transform it into
begin{align}
mathbb{E}[X(X-1)(X-2)(X-3)]
&=sum_{k=0}^n k(k-1)(k-2)mathbb{P}{X=k}\
&=sum_{k=3}^{n+3} (k-3)(k-4)(k-5)mathbb{P}{X=k-3}\
&=sum_{k=0}^n i(i-1)(i-2)mathbb{P}{X=i}
end{align}
But then I just have no idea about how can i do it. I suspect that it needs something similar to this post but the steps are quite different from this one.
Please help.
summation combinations binomial-distribution expected-value
add a comment |
up vote
2
down vote
favorite
Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$.
It is suggested that I can transform it into
begin{align}
mathbb{E}[X(X-1)(X-2)(X-3)]
&=sum_{k=0}^n k(k-1)(k-2)mathbb{P}{X=k}\
&=sum_{k=3}^{n+3} (k-3)(k-4)(k-5)mathbb{P}{X=k-3}\
&=sum_{k=0}^n i(i-1)(i-2)mathbb{P}{X=i}
end{align}
But then I just have no idea about how can i do it. I suspect that it needs something similar to this post but the steps are quite different from this one.
Please help.
summation combinations binomial-distribution expected-value
1
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$.
It is suggested that I can transform it into
begin{align}
mathbb{E}[X(X-1)(X-2)(X-3)]
&=sum_{k=0}^n k(k-1)(k-2)mathbb{P}{X=k}\
&=sum_{k=3}^{n+3} (k-3)(k-4)(k-5)mathbb{P}{X=k-3}\
&=sum_{k=0}^n i(i-1)(i-2)mathbb{P}{X=i}
end{align}
But then I just have no idea about how can i do it. I suspect that it needs something similar to this post but the steps are quite different from this one.
Please help.
summation combinations binomial-distribution expected-value
Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$.
It is suggested that I can transform it into
begin{align}
mathbb{E}[X(X-1)(X-2)(X-3)]
&=sum_{k=0}^n k(k-1)(k-2)mathbb{P}{X=k}\
&=sum_{k=3}^{n+3} (k-3)(k-4)(k-5)mathbb{P}{X=k-3}\
&=sum_{k=0}^n i(i-1)(i-2)mathbb{P}{X=i}
end{align}
But then I just have no idea about how can i do it. I suspect that it needs something similar to this post but the steps are quite different from this one.
Please help.
summation combinations binomial-distribution expected-value
summation combinations binomial-distribution expected-value
edited Nov 21 at 6:18
Clement C.
49k33785
49k33785
asked Nov 21 at 5:45
Michael Lee
385
385
1
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24
add a comment |
1
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24
1
1
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24
add a comment |
4 Answers
4
active
oldest
votes
up vote
0
down vote
accepted
Start as suggested, and write down what the probability mass function (pmf) of the Binomial actually is:
$$begin{align*}
mathbb{E}[X(X-1)(X-2)(X-3)]
&= sum_{k=0}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)binom{n}{k}p^k(1-p)^{n-k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)frac{n!}{k!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n!}{(k-4)!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n(n-1)(n-2)(n-3)(n-4)!}{(k-4)!((n-4)-(k-4))!}p^k(1-p)^{n-k}\
&= n(n-1)(n-2)(n-3)p^4sum_{k=4}^n binom{n-4}{k-4}p^{k-4}(1-p)^{(n-4)-(k-4)}\
&= n(n-1)(n-2)(n-3)p^4sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}\
&= boxed{n(n-1)(n-2)(n-3)p^4}
end{align*}$$
since $sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}=1$, recognizing the sum of probabilities for a Binomial with parameters $n-4$ and $p$.
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
add a comment |
up vote
2
down vote
One way is to use characteristic functions. The characteristic function of $B(n,p)$ is $phi (t)=(pe^{it}+(1-p))^{n}$. The moments of $X$ are given by $i^{n}EX^{n}=phi^{(n)}(0)$. You can compute the first 4 moments of $X$ using this and then use the expanded form of $X(X_1)(X-2)(X-3)$.
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
add a comment |
up vote
0
down vote
Hint: Probability Generating Function (see https://en.wikipedia.org/wiki/Probability-generating_function)
Look at the properties section, the part where it talks about the kth factorial moment.
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
add a comment |
up vote
0
down vote
Look at $f(s)= E [ s^X]$.
1) Observe that
$$f(s) = (sp + (1-p))^n=(1+ (s-1)p)^n =sum_{k=0}^n binom{n}{k}p^k (s-1)^k=sum_{k=0}^n frac{n!}{(n-k)!} frac{(s-1)^k}{k!},$$
the RHS identified as the Taylor series of $f$ about $s=1$.
2) Differentiating under the expectation (which is just a finite sum here), we obtain $$f'(s) = E[ X s^{X-1}] ,~f''(s) = E[X (X-1) s^{X-2}],dots.$$
You're looking for $f^{(4)}(1)$.
add a comment |
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
Start as suggested, and write down what the probability mass function (pmf) of the Binomial actually is:
$$begin{align*}
mathbb{E}[X(X-1)(X-2)(X-3)]
&= sum_{k=0}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)binom{n}{k}p^k(1-p)^{n-k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)frac{n!}{k!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n!}{(k-4)!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n(n-1)(n-2)(n-3)(n-4)!}{(k-4)!((n-4)-(k-4))!}p^k(1-p)^{n-k}\
&= n(n-1)(n-2)(n-3)p^4sum_{k=4}^n binom{n-4}{k-4}p^{k-4}(1-p)^{(n-4)-(k-4)}\
&= n(n-1)(n-2)(n-3)p^4sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}\
&= boxed{n(n-1)(n-2)(n-3)p^4}
end{align*}$$
since $sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}=1$, recognizing the sum of probabilities for a Binomial with parameters $n-4$ and $p$.
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
add a comment |
up vote
0
down vote
accepted
Start as suggested, and write down what the probability mass function (pmf) of the Binomial actually is:
$$begin{align*}
mathbb{E}[X(X-1)(X-2)(X-3)]
&= sum_{k=0}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)binom{n}{k}p^k(1-p)^{n-k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)frac{n!}{k!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n!}{(k-4)!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n(n-1)(n-2)(n-3)(n-4)!}{(k-4)!((n-4)-(k-4))!}p^k(1-p)^{n-k}\
&= n(n-1)(n-2)(n-3)p^4sum_{k=4}^n binom{n-4}{k-4}p^{k-4}(1-p)^{(n-4)-(k-4)}\
&= n(n-1)(n-2)(n-3)p^4sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}\
&= boxed{n(n-1)(n-2)(n-3)p^4}
end{align*}$$
since $sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}=1$, recognizing the sum of probabilities for a Binomial with parameters $n-4$ and $p$.
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Start as suggested, and write down what the probability mass function (pmf) of the Binomial actually is:
$$begin{align*}
mathbb{E}[X(X-1)(X-2)(X-3)]
&= sum_{k=0}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)binom{n}{k}p^k(1-p)^{n-k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)frac{n!}{k!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n!}{(k-4)!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n(n-1)(n-2)(n-3)(n-4)!}{(k-4)!((n-4)-(k-4))!}p^k(1-p)^{n-k}\
&= n(n-1)(n-2)(n-3)p^4sum_{k=4}^n binom{n-4}{k-4}p^{k-4}(1-p)^{(n-4)-(k-4)}\
&= n(n-1)(n-2)(n-3)p^4sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}\
&= boxed{n(n-1)(n-2)(n-3)p^4}
end{align*}$$
since $sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}=1$, recognizing the sum of probabilities for a Binomial with parameters $n-4$ and $p$.
Start as suggested, and write down what the probability mass function (pmf) of the Binomial actually is:
$$begin{align*}
mathbb{E}[X(X-1)(X-2)(X-3)]
&= sum_{k=0}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)mathbb{P}{X=k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)binom{n}{k}p^k(1-p)^{n-k}\
&= sum_{k=4}^n k(k-1)(k-2)(k-3)frac{n!}{k!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n!}{(k-4)!(n-k)!}p^k(1-p)^{n-k}\
&= sum_{k=4}^n frac{n(n-1)(n-2)(n-3)(n-4)!}{(k-4)!((n-4)-(k-4))!}p^k(1-p)^{n-k}\
&= n(n-1)(n-2)(n-3)p^4sum_{k=4}^n binom{n-4}{k-4}p^{k-4}(1-p)^{(n-4)-(k-4)}\
&= n(n-1)(n-2)(n-3)p^4sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}\
&= boxed{n(n-1)(n-2)(n-3)p^4}
end{align*}$$
since $sum_{ell=0}^n binom{n-4}{ell}p^{ell}(1-p)^{(n-4)-ell}=1$, recognizing the sum of probabilities for a Binomial with parameters $n-4$ and $p$.
answered Nov 21 at 6:06
Clement C.
49k33785
49k33785
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
add a comment |
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
Thank you for our help.
– Michael Lee
Nov 22 at 2:48
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
@MichaelLee You're welcome!
– Clement C.
Nov 22 at 2:56
add a comment |
up vote
2
down vote
One way is to use characteristic functions. The characteristic function of $B(n,p)$ is $phi (t)=(pe^{it}+(1-p))^{n}$. The moments of $X$ are given by $i^{n}EX^{n}=phi^{(n)}(0)$. You can compute the first 4 moments of $X$ using this and then use the expanded form of $X(X_1)(X-2)(X-3)$.
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
add a comment |
up vote
2
down vote
One way is to use characteristic functions. The characteristic function of $B(n,p)$ is $phi (t)=(pe^{it}+(1-p))^{n}$. The moments of $X$ are given by $i^{n}EX^{n}=phi^{(n)}(0)$. You can compute the first 4 moments of $X$ using this and then use the expanded form of $X(X_1)(X-2)(X-3)$.
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
add a comment |
up vote
2
down vote
up vote
2
down vote
One way is to use characteristic functions. The characteristic function of $B(n,p)$ is $phi (t)=(pe^{it}+(1-p))^{n}$. The moments of $X$ are given by $i^{n}EX^{n}=phi^{(n)}(0)$. You can compute the first 4 moments of $X$ using this and then use the expanded form of $X(X_1)(X-2)(X-3)$.
One way is to use characteristic functions. The characteristic function of $B(n,p)$ is $phi (t)=(pe^{it}+(1-p))^{n}$. The moments of $X$ are given by $i^{n}EX^{n}=phi^{(n)}(0)$. You can compute the first 4 moments of $X$ using this and then use the expanded form of $X(X_1)(X-2)(X-3)$.
answered Nov 21 at 5:51
Kavi Rama Murthy
44.8k31852
44.8k31852
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
add a comment |
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
– Clement C.
Nov 21 at 6:13
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
@ClementC. The other two answers here use moment generating function instead of characteristic function. I am not sure if characteristic function is much more advanced than moment generating function. If OP says he is not familiar with characteristic functions I will gladly delete my answer.
– Kavi Rama Murthy
Nov 21 at 7:46
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
No, your answer is worth having. Just feeling that all the characteristic functions/MGF approaches are a bit "not elementary" for this question.
– Clement C.
Nov 21 at 7:49
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
Hi guys I am OP, well this is indeed a year 1 engineering math course so I really have no idea about these things. I guess I will go study on the idea of your answer later.
– Michael Lee
Nov 22 at 2:47
add a comment |
up vote
0
down vote
Hint: Probability Generating Function (see https://en.wikipedia.org/wiki/Probability-generating_function)
Look at the properties section, the part where it talks about the kth factorial moment.
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
add a comment |
up vote
0
down vote
Hint: Probability Generating Function (see https://en.wikipedia.org/wiki/Probability-generating_function)
Look at the properties section, the part where it talks about the kth factorial moment.
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
add a comment |
up vote
0
down vote
up vote
0
down vote
Hint: Probability Generating Function (see https://en.wikipedia.org/wiki/Probability-generating_function)
Look at the properties section, the part where it talks about the kth factorial moment.
Hint: Probability Generating Function (see https://en.wikipedia.org/wiki/Probability-generating_function)
Look at the properties section, the part where it talks about the kth factorial moment.
answered Nov 21 at 5:51
KnowsNothing
355
355
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
add a comment |
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
proofwiki.org/wiki/…
– KnowsNothing
Nov 21 at 5:57
add a comment |
up vote
0
down vote
Look at $f(s)= E [ s^X]$.
1) Observe that
$$f(s) = (sp + (1-p))^n=(1+ (s-1)p)^n =sum_{k=0}^n binom{n}{k}p^k (s-1)^k=sum_{k=0}^n frac{n!}{(n-k)!} frac{(s-1)^k}{k!},$$
the RHS identified as the Taylor series of $f$ about $s=1$.
2) Differentiating under the expectation (which is just a finite sum here), we obtain $$f'(s) = E[ X s^{X-1}] ,~f''(s) = E[X (X-1) s^{X-2}],dots.$$
You're looking for $f^{(4)}(1)$.
add a comment |
up vote
0
down vote
Look at $f(s)= E [ s^X]$.
1) Observe that
$$f(s) = (sp + (1-p))^n=(1+ (s-1)p)^n =sum_{k=0}^n binom{n}{k}p^k (s-1)^k=sum_{k=0}^n frac{n!}{(n-k)!} frac{(s-1)^k}{k!},$$
the RHS identified as the Taylor series of $f$ about $s=1$.
2) Differentiating under the expectation (which is just a finite sum here), we obtain $$f'(s) = E[ X s^{X-1}] ,~f''(s) = E[X (X-1) s^{X-2}],dots.$$
You're looking for $f^{(4)}(1)$.
add a comment |
up vote
0
down vote
up vote
0
down vote
Look at $f(s)= E [ s^X]$.
1) Observe that
$$f(s) = (sp + (1-p))^n=(1+ (s-1)p)^n =sum_{k=0}^n binom{n}{k}p^k (s-1)^k=sum_{k=0}^n frac{n!}{(n-k)!} frac{(s-1)^k}{k!},$$
the RHS identified as the Taylor series of $f$ about $s=1$.
2) Differentiating under the expectation (which is just a finite sum here), we obtain $$f'(s) = E[ X s^{X-1}] ,~f''(s) = E[X (X-1) s^{X-2}],dots.$$
You're looking for $f^{(4)}(1)$.
Look at $f(s)= E [ s^X]$.
1) Observe that
$$f(s) = (sp + (1-p))^n=(1+ (s-1)p)^n =sum_{k=0}^n binom{n}{k}p^k (s-1)^k=sum_{k=0}^n frac{n!}{(n-k)!} frac{(s-1)^k}{k!},$$
the RHS identified as the Taylor series of $f$ about $s=1$.
2) Differentiating under the expectation (which is just a finite sum here), we obtain $$f'(s) = E[ X s^{X-1}] ,~f''(s) = E[X (X-1) s^{X-2}],dots.$$
You're looking for $f^{(4)}(1)$.
answered Nov 21 at 6:01
Fnacool
4,956511
4,956511
add a comment |
add a comment |
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.
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%2f3007315%2fgiven-that-x-sim-operatornamebinomialn-p-find-mathbbexx-1x-2x%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
1
Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 at 6:24