Given that $X sim operatorname{Binomial}(n,p)$, Find $mathbb{E}[X(X-1)(X-2)(X-3)]$












2















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







share|cite|improve this question




















  • 1




    Related: math.stackexchange.com/questions/1476676/…
    – heropup
    Nov 21 '18 at 6:24
















2















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







share|cite|improve this question




















  • 1




    Related: math.stackexchange.com/questions/1476676/…
    – heropup
    Nov 21 '18 at 6:24














2












2








2








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







share|cite|improve this question
















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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 21 '18 at 6:18









Clement C.

49.7k33886




49.7k33886










asked Nov 21 '18 at 5:45









Michael Lee

385




385








  • 1




    Related: math.stackexchange.com/questions/1476676/…
    – heropup
    Nov 21 '18 at 6:24














  • 1




    Related: math.stackexchange.com/questions/1476676/…
    – heropup
    Nov 21 '18 at 6:24








1




1




Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 '18 at 6:24




Related: math.stackexchange.com/questions/1476676/…
– heropup
Nov 21 '18 at 6:24










4 Answers
4






active

oldest

votes


















0














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$.






share|cite|improve this answer





















  • Thank you for our help.
    – Michael Lee
    Nov 22 '18 at 2:48










  • @MichaelLee You're welcome!
    – Clement C.
    Nov 22 '18 at 2:56



















2














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)$.






share|cite|improve this answer





















  • This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
    – Clement C.
    Nov 21 '18 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 '18 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 '18 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 '18 at 2:47



















0














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.






share|cite|improve this answer





















  • proofwiki.org/wiki/…
    – KnowsNothing
    Nov 21 '18 at 5:57



















0














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)$.






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',
    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%2f3007315%2fgiven-that-x-sim-operatornamebinomialn-p-find-mathbbexx-1x-2x%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    4 Answers
    4






    active

    oldest

    votes








    4 Answers
    4






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    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$.






    share|cite|improve this answer





















    • Thank you for our help.
      – Michael Lee
      Nov 22 '18 at 2:48










    • @MichaelLee You're welcome!
      – Clement C.
      Nov 22 '18 at 2:56
















    0














    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$.






    share|cite|improve this answer





















    • Thank you for our help.
      – Michael Lee
      Nov 22 '18 at 2:48










    • @MichaelLee You're welcome!
      – Clement C.
      Nov 22 '18 at 2:56














    0












    0








    0






    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$.






    share|cite|improve this answer












    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$.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 21 '18 at 6:06









    Clement C.

    49.7k33886




    49.7k33886












    • Thank you for our help.
      – Michael Lee
      Nov 22 '18 at 2:48










    • @MichaelLee You're welcome!
      – Clement C.
      Nov 22 '18 at 2:56


















    • Thank you for our help.
      – Michael Lee
      Nov 22 '18 at 2:48










    • @MichaelLee You're welcome!
      – Clement C.
      Nov 22 '18 at 2:56
















    Thank you for our help.
    – Michael Lee
    Nov 22 '18 at 2:48




    Thank you for our help.
    – Michael Lee
    Nov 22 '18 at 2:48












    @MichaelLee You're welcome!
    – Clement C.
    Nov 22 '18 at 2:56




    @MichaelLee You're welcome!
    – Clement C.
    Nov 22 '18 at 2:56











    2














    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)$.






    share|cite|improve this answer





















    • This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
      – Clement C.
      Nov 21 '18 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 '18 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 '18 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 '18 at 2:47
















    2














    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)$.






    share|cite|improve this answer





















    • This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
      – Clement C.
      Nov 21 '18 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 '18 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 '18 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 '18 at 2:47














    2












    2








    2






    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)$.






    share|cite|improve this answer












    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)$.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 21 '18 at 5:51









    Kavi Rama Murthy

    50.4k31854




    50.4k31854












    • This is somewhat overkill (assumes somewhat more advanced knowledge), and does not really follow the suggestion/hint at all, however.
      – Clement C.
      Nov 21 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 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 '18 at 2:47











    0














    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.






    share|cite|improve this answer





















    • proofwiki.org/wiki/…
      – KnowsNothing
      Nov 21 '18 at 5:57
















    0














    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.






    share|cite|improve this answer





















    • proofwiki.org/wiki/…
      – KnowsNothing
      Nov 21 '18 at 5:57














    0












    0








    0






    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.






    share|cite|improve this answer












    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.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 21 '18 at 5:51









    KnowsNothing

    355




    355












    • proofwiki.org/wiki/…
      – KnowsNothing
      Nov 21 '18 at 5:57


















    • proofwiki.org/wiki/…
      – KnowsNothing
      Nov 21 '18 at 5:57
















    proofwiki.org/wiki/…
    – KnowsNothing
    Nov 21 '18 at 5:57




    proofwiki.org/wiki/…
    – KnowsNothing
    Nov 21 '18 at 5:57











    0














    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)$.






    share|cite|improve this answer


























      0














      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)$.






      share|cite|improve this answer
























        0












        0








        0






        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)$.






        share|cite|improve this answer












        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)$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 21 '18 at 6:01









        Fnacool

        4,976511




        4,976511






























            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.





            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.




            draft saved


            draft discarded














            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





















































            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 to change which sound is reproduced for terminal bell?

            Image
            3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
            Read more

            Can I use Tabulator js library in my java Spring + Thymeleaf project?

            Image
            0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
            Read more

            Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

            Image
            up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
            Read more