Probability with a shrinking sample space











up vote
0
down vote

favorite












If I have a set that contains some lowercase and uppercase letters, for example $S = {a,b,c,d,e,f,g,h,V,W,X,Y,Z}$. Say I choose 4 letters from this set in a uniformly random way; however, each time I choose an element I remove it. I.e, each element may only be chosen once.



My sample space is initially $S$, after I choose 4 elements the size of my sample space would then be $|S| - 4$.



I'm not too sure about how I would go about calculating the probabilities of various things, for example consider the event $B=text{"The 4th letter chosen is uppercase"}$, how would I calculate $Pr(B)$?



If there's anything I can do to improve my question I'm happy to get feedback :)










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    If I have a set that contains some lowercase and uppercase letters, for example $S = {a,b,c,d,e,f,g,h,V,W,X,Y,Z}$. Say I choose 4 letters from this set in a uniformly random way; however, each time I choose an element I remove it. I.e, each element may only be chosen once.



    My sample space is initially $S$, after I choose 4 elements the size of my sample space would then be $|S| - 4$.



    I'm not too sure about how I would go about calculating the probabilities of various things, for example consider the event $B=text{"The 4th letter chosen is uppercase"}$, how would I calculate $Pr(B)$?



    If there's anything I can do to improve my question I'm happy to get feedback :)










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      If I have a set that contains some lowercase and uppercase letters, for example $S = {a,b,c,d,e,f,g,h,V,W,X,Y,Z}$. Say I choose 4 letters from this set in a uniformly random way; however, each time I choose an element I remove it. I.e, each element may only be chosen once.



      My sample space is initially $S$, after I choose 4 elements the size of my sample space would then be $|S| - 4$.



      I'm not too sure about how I would go about calculating the probabilities of various things, for example consider the event $B=text{"The 4th letter chosen is uppercase"}$, how would I calculate $Pr(B)$?



      If there's anything I can do to improve my question I'm happy to get feedback :)










      share|cite|improve this question













      If I have a set that contains some lowercase and uppercase letters, for example $S = {a,b,c,d,e,f,g,h,V,W,X,Y,Z}$. Say I choose 4 letters from this set in a uniformly random way; however, each time I choose an element I remove it. I.e, each element may only be chosen once.



      My sample space is initially $S$, after I choose 4 elements the size of my sample space would then be $|S| - 4$.



      I'm not too sure about how I would go about calculating the probabilities of various things, for example consider the event $B=text{"The 4th letter chosen is uppercase"}$, how would I calculate $Pr(B)$?



      If there's anything I can do to improve my question I'm happy to get feedback :)







      probability statistics random-variables






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 15 at 23:58









      Netwinder

      52




      52






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote



          accepted










          It can be treated as a permutation counting problem where:



          $$Pr(B) = frac{text{permutations with $4$th letter UC}}{text{permutations of 4 from 13}}$$



          $$Pr(B) = frac{5cdotfrac{12!}{9!}}{frac{13!}{9!}} = frac{5}{13}$$






          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%2f3000517%2fprobability-with-a-shrinking-sample-space%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
            0
            down vote



            accepted










            It can be treated as a permutation counting problem where:



            $$Pr(B) = frac{text{permutations with $4$th letter UC}}{text{permutations of 4 from 13}}$$



            $$Pr(B) = frac{5cdotfrac{12!}{9!}}{frac{13!}{9!}} = frac{5}{13}$$






            share|cite|improve this answer

























              up vote
              0
              down vote



              accepted










              It can be treated as a permutation counting problem where:



              $$Pr(B) = frac{text{permutations with $4$th letter UC}}{text{permutations of 4 from 13}}$$



              $$Pr(B) = frac{5cdotfrac{12!}{9!}}{frac{13!}{9!}} = frac{5}{13}$$






              share|cite|improve this answer























                up vote
                0
                down vote



                accepted







                up vote
                0
                down vote



                accepted






                It can be treated as a permutation counting problem where:



                $$Pr(B) = frac{text{permutations with $4$th letter UC}}{text{permutations of 4 from 13}}$$



                $$Pr(B) = frac{5cdotfrac{12!}{9!}}{frac{13!}{9!}} = frac{5}{13}$$






                share|cite|improve this answer












                It can be treated as a permutation counting problem where:



                $$Pr(B) = frac{text{permutations with $4$th letter UC}}{text{permutations of 4 from 13}}$$



                $$Pr(B) = frac{5cdotfrac{12!}{9!}}{frac{13!}{9!}} = frac{5}{13}$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 16 at 2:35









                Phil H

                3,8782312




                3,8782312






























                     

                    draft saved


                    draft discarded



















































                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000517%2fprobability-with-a-shrinking-sample-space%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

                    What is the Guru Parampara of Kashmiri Shaivism?

                    Герой Советского Союза

                    AnyDesk - Fatal Program Failure