Find $mathrm E (X), mathrm Var (X)$.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite














A sample of size $n$ is drawn from $1,2, cdots , N $ with replacement. Let $X$ denote the minimum of the numbers drawn. Calculate



$(a)$ the PMF of $X,$



$(b)$ $mathrm E (X),$



$(c)$ $mathrm Var (X),$



$(d)$ If $Y$ denotes the maximum of the numbers drawn$,$ calculate the joint PMF of $X$ and $Y$.





I have found



$$P(X=k)= frac (N-k+1)^n - (N-k)^n N^n.$$



But this isn't much helpful in calculating the expectation and variance of the random variable $X$. So how should I proceed in this regard? Please help me.



Thank you very much.



I have found the joint probability of the random variables $X$ and $Y$ as follows $:$



$$P(X=i,Y=j) = frac (j-i+1)^n - 2(j-i)^n+(j-i-1)^n N^n.$$ for $i=1,2,cdots,N$ and $j=1,2,,cdots,N$.



Is it correct? Please verify it.







share|cite|improve this question

























    up vote
    2
    down vote

    favorite














    A sample of size $n$ is drawn from $1,2, cdots , N $ with replacement. Let $X$ denote the minimum of the numbers drawn. Calculate



    $(a)$ the PMF of $X,$



    $(b)$ $mathrm E (X),$



    $(c)$ $mathrm Var (X),$



    $(d)$ If $Y$ denotes the maximum of the numbers drawn$,$ calculate the joint PMF of $X$ and $Y$.





    I have found



    $$P(X=k)= frac (N-k+1)^n - (N-k)^n N^n.$$



    But this isn't much helpful in calculating the expectation and variance of the random variable $X$. So how should I proceed in this regard? Please help me.



    Thank you very much.



    I have found the joint probability of the random variables $X$ and $Y$ as follows $:$



    $$P(X=i,Y=j) = frac (j-i+1)^n - 2(j-i)^n+(j-i-1)^n N^n.$$ for $i=1,2,cdots,N$ and $j=1,2,,cdots,N$.



    Is it correct? Please verify it.







    share|cite|improve this question























      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite













      A sample of size $n$ is drawn from $1,2, cdots , N $ with replacement. Let $X$ denote the minimum of the numbers drawn. Calculate



      $(a)$ the PMF of $X,$



      $(b)$ $mathrm E (X),$



      $(c)$ $mathrm Var (X),$



      $(d)$ If $Y$ denotes the maximum of the numbers drawn$,$ calculate the joint PMF of $X$ and $Y$.





      I have found



      $$P(X=k)= frac (N-k+1)^n - (N-k)^n N^n.$$



      But this isn't much helpful in calculating the expectation and variance of the random variable $X$. So how should I proceed in this regard? Please help me.



      Thank you very much.



      I have found the joint probability of the random variables $X$ and $Y$ as follows $:$



      $$P(X=i,Y=j) = frac (j-i+1)^n - 2(j-i)^n+(j-i-1)^n N^n.$$ for $i=1,2,cdots,N$ and $j=1,2,,cdots,N$.



      Is it correct? Please verify it.







      share|cite|improve this question















      A sample of size $n$ is drawn from $1,2, cdots , N $ with replacement. Let $X$ denote the minimum of the numbers drawn. Calculate



      $(a)$ the PMF of $X,$



      $(b)$ $mathrm E (X),$



      $(c)$ $mathrm Var (X),$



      $(d)$ If $Y$ denotes the maximum of the numbers drawn$,$ calculate the joint PMF of $X$ and $Y$.





      I have found



      $$P(X=k)= frac (N-k+1)^n - (N-k)^n N^n.$$



      But this isn't much helpful in calculating the expectation and variance of the random variable $X$. So how should I proceed in this regard? Please help me.



      Thank you very much.



      I have found the joint probability of the random variables $X$ and $Y$ as follows $:$



      $$P(X=i,Y=j) = frac (j-i+1)^n - 2(j-i)^n+(j-i-1)^n N^n.$$ for $i=1,2,cdots,N$ and $j=1,2,,cdots,N$.



      Is it correct? Please verify it.









      share|cite|improve this question












      share|cite|improve this question




      share|cite|improve this question








      edited yesterday
























      asked yesterday









      Debabrata Chattopadhyay.

      8311




      8311




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          1
          down vote













          Your answer for part (a) is correct.



          For part (b), write your result from part (a) as



          $$mathsf P(Xgt k)=frac(N-k)^nN^n$$



          and calculate



          $$
          mathsf E(X)=sum_k=0^N-1mathsf P(Xgt k)=sum_k=1^Nfrack^nN^n;,
          $$



          which can be evaluated using Faulhaber's formula. Approximating the sum by an integral for large $N$ yields the approximation $E(X)approxfrac Nn+1$.



          For part (c), use the fact that the variance of the minimum is the variance of the maximum to transform to $j=N-k+1$, which leads to $j^n-(j-1)^n$ in the numerator; then use $j=(j-1)+1$ as appropriate to write the expectation of $j^2$ in terms of sums of powers of $j$.



          Your answer for part (d) is correct; it was recently asked about in
          Calculating probability of High+Low = T on N dice with S sides.






          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: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            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%2f2872736%2ffind-mathrm-e-x-mathrm-var-x%23new-answer', 'question_page');

            );

            Post as a guest






























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            1
            down vote













            Your answer for part (a) is correct.



            For part (b), write your result from part (a) as



            $$mathsf P(Xgt k)=frac(N-k)^nN^n$$



            and calculate



            $$
            mathsf E(X)=sum_k=0^N-1mathsf P(Xgt k)=sum_k=1^Nfrack^nN^n;,
            $$



            which can be evaluated using Faulhaber's formula. Approximating the sum by an integral for large $N$ yields the approximation $E(X)approxfrac Nn+1$.



            For part (c), use the fact that the variance of the minimum is the variance of the maximum to transform to $j=N-k+1$, which leads to $j^n-(j-1)^n$ in the numerator; then use $j=(j-1)+1$ as appropriate to write the expectation of $j^2$ in terms of sums of powers of $j$.



            Your answer for part (d) is correct; it was recently asked about in
            Calculating probability of High+Low = T on N dice with S sides.






            share|cite|improve this answer

























              up vote
              1
              down vote













              Your answer for part (a) is correct.



              For part (b), write your result from part (a) as



              $$mathsf P(Xgt k)=frac(N-k)^nN^n$$



              and calculate



              $$
              mathsf E(X)=sum_k=0^N-1mathsf P(Xgt k)=sum_k=1^Nfrack^nN^n;,
              $$



              which can be evaluated using Faulhaber's formula. Approximating the sum by an integral for large $N$ yields the approximation $E(X)approxfrac Nn+1$.



              For part (c), use the fact that the variance of the minimum is the variance of the maximum to transform to $j=N-k+1$, which leads to $j^n-(j-1)^n$ in the numerator; then use $j=(j-1)+1$ as appropriate to write the expectation of $j^2$ in terms of sums of powers of $j$.



              Your answer for part (d) is correct; it was recently asked about in
              Calculating probability of High+Low = T on N dice with S sides.






              share|cite|improve this answer























                up vote
                1
                down vote










                up vote
                1
                down vote









                Your answer for part (a) is correct.



                For part (b), write your result from part (a) as



                $$mathsf P(Xgt k)=frac(N-k)^nN^n$$



                and calculate



                $$
                mathsf E(X)=sum_k=0^N-1mathsf P(Xgt k)=sum_k=1^Nfrack^nN^n;,
                $$



                which can be evaluated using Faulhaber's formula. Approximating the sum by an integral for large $N$ yields the approximation $E(X)approxfrac Nn+1$.



                For part (c), use the fact that the variance of the minimum is the variance of the maximum to transform to $j=N-k+1$, which leads to $j^n-(j-1)^n$ in the numerator; then use $j=(j-1)+1$ as appropriate to write the expectation of $j^2$ in terms of sums of powers of $j$.



                Your answer for part (d) is correct; it was recently asked about in
                Calculating probability of High+Low = T on N dice with S sides.






                share|cite|improve this answer













                Your answer for part (a) is correct.



                For part (b), write your result from part (a) as



                $$mathsf P(Xgt k)=frac(N-k)^nN^n$$



                and calculate



                $$
                mathsf E(X)=sum_k=0^N-1mathsf P(Xgt k)=sum_k=1^Nfrack^nN^n;,
                $$



                which can be evaluated using Faulhaber's formula. Approximating the sum by an integral for large $N$ yields the approximation $E(X)approxfrac Nn+1$.



                For part (c), use the fact that the variance of the minimum is the variance of the maximum to transform to $j=N-k+1$, which leads to $j^n-(j-1)^n$ in the numerator; then use $j=(j-1)+1$ as appropriate to write the expectation of $j^2$ in terms of sums of powers of $j$.



                Your answer for part (d) is correct; it was recently asked about in
                Calculating probability of High+Low = T on N dice with S sides.







                share|cite|improve this answer













                share|cite|improve this answer



                share|cite|improve this answer











                answered yesterday









                joriki

                164k10179328




                164k10179328






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2872736%2ffind-mathrm-e-x-mathrm-var-x%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    Comments

                    Popular posts from this blog

                    What is the equation of a 3D cone with generalised tilt?

                    Color the edges and diagonals of a regular polygon

                    Relationship between determinant of matrix and determinant of adjoint?