Probability of at least 6 out of 10












1












$begingroup$


i have the following question:
In an exam, 10 questions are chosen randomly from 100.
A student is prepared for 60 out 100 of these questions.
What's the probability that he'll solve at least 6 questions out of the chosen 10?
I'm a bit confused as to what the probability plain and the events are.
Do i say that $|Omega| = {100choose10} $, and the event $A=$"at least 6 of the 10 questions are among the students' 60 " ?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Yes, see this link on the hypergeometric distribution.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 10:42










  • $begingroup$
    I don't see the connection, sorry.
    $endgroup$
    – CodeHoarder
    Mar 31 '17 at 14:56






  • 1




    $begingroup$
    Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 15:20


















1












$begingroup$


i have the following question:
In an exam, 10 questions are chosen randomly from 100.
A student is prepared for 60 out 100 of these questions.
What's the probability that he'll solve at least 6 questions out of the chosen 10?
I'm a bit confused as to what the probability plain and the events are.
Do i say that $|Omega| = {100choose10} $, and the event $A=$"at least 6 of the 10 questions are among the students' 60 " ?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Yes, see this link on the hypergeometric distribution.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 10:42










  • $begingroup$
    I don't see the connection, sorry.
    $endgroup$
    – CodeHoarder
    Mar 31 '17 at 14:56






  • 1




    $begingroup$
    Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 15:20
















1












1








1


1



$begingroup$


i have the following question:
In an exam, 10 questions are chosen randomly from 100.
A student is prepared for 60 out 100 of these questions.
What's the probability that he'll solve at least 6 questions out of the chosen 10?
I'm a bit confused as to what the probability plain and the events are.
Do i say that $|Omega| = {100choose10} $, and the event $A=$"at least 6 of the 10 questions are among the students' 60 " ?










share|cite|improve this question









$endgroup$




i have the following question:
In an exam, 10 questions are chosen randomly from 100.
A student is prepared for 60 out 100 of these questions.
What's the probability that he'll solve at least 6 questions out of the chosen 10?
I'm a bit confused as to what the probability plain and the events are.
Do i say that $|Omega| = {100choose10} $, and the event $A=$"at least 6 of the 10 questions are among the students' 60 " ?







probability combinatorics probability-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 31 '17 at 9:48









CodeHoarderCodeHoarder

18610




18610








  • 1




    $begingroup$
    Yes, see this link on the hypergeometric distribution.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 10:42










  • $begingroup$
    I don't see the connection, sorry.
    $endgroup$
    – CodeHoarder
    Mar 31 '17 at 14:56






  • 1




    $begingroup$
    Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 15:20
















  • 1




    $begingroup$
    Yes, see this link on the hypergeometric distribution.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 10:42










  • $begingroup$
    I don't see the connection, sorry.
    $endgroup$
    – CodeHoarder
    Mar 31 '17 at 14:56






  • 1




    $begingroup$
    Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
    $endgroup$
    – N. Shales
    Mar 31 '17 at 15:20










1




1




$begingroup$
Yes, see this link on the hypergeometric distribution.
$endgroup$
– N. Shales
Mar 31 '17 at 10:42




$begingroup$
Yes, see this link on the hypergeometric distribution.
$endgroup$
– N. Shales
Mar 31 '17 at 10:42












$begingroup$
I don't see the connection, sorry.
$endgroup$
– CodeHoarder
Mar 31 '17 at 14:56




$begingroup$
I don't see the connection, sorry.
$endgroup$
– CodeHoarder
Mar 31 '17 at 14:56




1




1




$begingroup$
Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
$endgroup$
– N. Shales
Mar 31 '17 at 15:20






$begingroup$
Separate the $100$ questions into the $60$ the student's prepared for and the $40$ he hasn't, then there are $binom{100}{10}$ possible question sets. Out of these there are $binom{60}{6}binom{40}{4}$ ways that $6$ will be from the $60$ and $4$ will be from the $40$, thus the probability that the student will solve exactly $6$ questions is $$frac{binom{60}{6}binom{40}{4}}{binom{100}{10}}$$ assuming he solves every question he has prepared for. Similarly the probability that he has prepared for exactly $7$ questions is $$frac{binom{60}{7}binom{40}{3}}{binom{100}{10}} $$ and so on.
$endgroup$
– N. Shales
Mar 31 '17 at 15:20












2 Answers
2






active

oldest

votes


















0












$begingroup$

A lot of probability problems can be solved by reframing the question in the context of balls and urns. In this case, the hypergeometric distribution is pertinent as the following excerpt from Blitzstein shows:




Consider an urn with $w$ white balls and $b$ black balls. We draw $n$ balls out of the urn at random without replacement, such that all ${w+b choose n}$ samples are equally likely. Let $X$ be the number of white balls in the sample. Then $X$ is said to have the Hypergeometric distribution with parameters $w$, $b$, and $n$; we denote this by $X sim text{HGeom}(w,b,n)$.




For your problem, $n$ is the number of questions are chosen randomly, $w$ is the number of questions that the student is prepared for, $b$ is the number of questions he is not prepared for,
and $X$ is the number of correct answers on the student's exam.



Now that you have properly modeled the problem, all you have to do is calculate



$$P(text{at least 6 out of 10}) = P(X geq 6), $$
with the appropriate pmf.






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    A permutational approach - Equivalence of permutation and combination formula



    Define event A to be there are at least 6 successes out of n = 10
    trials. Let's also use symbols: "s" for success, "f" for failure, "t"
    for trial" "Pr" for probability, "P" for permutation and "C" for
    combination,
    "P(n, r)" for selecting r out of n objects in permutation and C(n, r)
    for select r out of n objects in combination.



    Exactly 6 s out of 10 t, assume first 6 are s, last 4 are f "in that order".



    Pr($A_6$, po) = 60/100 * 59/99 * 58/98 * .../55/95 * 40/94 * 39/93 * ..* 37/91
    = P (60, 6)* P(40, 4)/ P(100, 10)



    But there are C (10, 6) = P(10, 6)/ 6! = I such possibilities.



    So exactly 6 s out of 10 t "in any order" is



    Pr ($A_6$) = $sum_{ i =1}^I$Pr ($A_6$, po) = I * Pr($A_6$, po)
    = C(10, 6) * P(60, 6) * P(40, 4) / P(100, 10)
    = C(10, 6) * (6!* 4! /10!) *C(60, 6) * C(40, 4) / C(100,10)
    = C(10, 6)/C(10,6) * C(60, 6) * C(40, 4) / C(100,10)
    = C(60, 6) * C(40, 4) / C(100,10),
    which is exactly the results using combination approach!



    The probability of solving at least 6 s out of 10 t is
    Pr(A) = $sum_{i=6}^{10}$ Pr($A_i$).






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
      $endgroup$
      – paw88789
      Mar 31 '17 at 12:24










    • $begingroup$
      Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
      $endgroup$
      – cdeamaze
      Mar 31 '17 at 13:36










    • $begingroup$
      Sorry, this is unclear to me.
      $endgroup$
      – CodeHoarder
      Mar 31 '17 at 14:54










    • $begingroup$
      I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
      $endgroup$
      – cdeamaze
      Mar 31 '17 at 22:32










    • $begingroup$
      I am still not allowed to post.
      $endgroup$
      – cdeamaze
      Apr 3 '17 at 3:56











    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%2f2211517%2fprobability-of-at-least-6-out-of-10%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    A lot of probability problems can be solved by reframing the question in the context of balls and urns. In this case, the hypergeometric distribution is pertinent as the following excerpt from Blitzstein shows:




    Consider an urn with $w$ white balls and $b$ black balls. We draw $n$ balls out of the urn at random without replacement, such that all ${w+b choose n}$ samples are equally likely. Let $X$ be the number of white balls in the sample. Then $X$ is said to have the Hypergeometric distribution with parameters $w$, $b$, and $n$; we denote this by $X sim text{HGeom}(w,b,n)$.




    For your problem, $n$ is the number of questions are chosen randomly, $w$ is the number of questions that the student is prepared for, $b$ is the number of questions he is not prepared for,
    and $X$ is the number of correct answers on the student's exam.



    Now that you have properly modeled the problem, all you have to do is calculate



    $$P(text{at least 6 out of 10}) = P(X geq 6), $$
    with the appropriate pmf.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      A lot of probability problems can be solved by reframing the question in the context of balls and urns. In this case, the hypergeometric distribution is pertinent as the following excerpt from Blitzstein shows:




      Consider an urn with $w$ white balls and $b$ black balls. We draw $n$ balls out of the urn at random without replacement, such that all ${w+b choose n}$ samples are equally likely. Let $X$ be the number of white balls in the sample. Then $X$ is said to have the Hypergeometric distribution with parameters $w$, $b$, and $n$; we denote this by $X sim text{HGeom}(w,b,n)$.




      For your problem, $n$ is the number of questions are chosen randomly, $w$ is the number of questions that the student is prepared for, $b$ is the number of questions he is not prepared for,
      and $X$ is the number of correct answers on the student's exam.



      Now that you have properly modeled the problem, all you have to do is calculate



      $$P(text{at least 6 out of 10}) = P(X geq 6), $$
      with the appropriate pmf.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        A lot of probability problems can be solved by reframing the question in the context of balls and urns. In this case, the hypergeometric distribution is pertinent as the following excerpt from Blitzstein shows:




        Consider an urn with $w$ white balls and $b$ black balls. We draw $n$ balls out of the urn at random without replacement, such that all ${w+b choose n}$ samples are equally likely. Let $X$ be the number of white balls in the sample. Then $X$ is said to have the Hypergeometric distribution with parameters $w$, $b$, and $n$; we denote this by $X sim text{HGeom}(w,b,n)$.




        For your problem, $n$ is the number of questions are chosen randomly, $w$ is the number of questions that the student is prepared for, $b$ is the number of questions he is not prepared for,
        and $X$ is the number of correct answers on the student's exam.



        Now that you have properly modeled the problem, all you have to do is calculate



        $$P(text{at least 6 out of 10}) = P(X geq 6), $$
        with the appropriate pmf.






        share|cite|improve this answer









        $endgroup$



        A lot of probability problems can be solved by reframing the question in the context of balls and urns. In this case, the hypergeometric distribution is pertinent as the following excerpt from Blitzstein shows:




        Consider an urn with $w$ white balls and $b$ black balls. We draw $n$ balls out of the urn at random without replacement, such that all ${w+b choose n}$ samples are equally likely. Let $X$ be the number of white balls in the sample. Then $X$ is said to have the Hypergeometric distribution with parameters $w$, $b$, and $n$; we denote this by $X sim text{HGeom}(w,b,n)$.




        For your problem, $n$ is the number of questions are chosen randomly, $w$ is the number of questions that the student is prepared for, $b$ is the number of questions he is not prepared for,
        and $X$ is the number of correct answers on the student's exam.



        Now that you have properly modeled the problem, all you have to do is calculate



        $$P(text{at least 6 out of 10}) = P(X geq 6), $$
        with the appropriate pmf.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Apr 4 '17 at 19:56









        AlainAlain

        6151513




        6151513























            0












            $begingroup$

            A permutational approach - Equivalence of permutation and combination formula



            Define event A to be there are at least 6 successes out of n = 10
            trials. Let's also use symbols: "s" for success, "f" for failure, "t"
            for trial" "Pr" for probability, "P" for permutation and "C" for
            combination,
            "P(n, r)" for selecting r out of n objects in permutation and C(n, r)
            for select r out of n objects in combination.



            Exactly 6 s out of 10 t, assume first 6 are s, last 4 are f "in that order".



            Pr($A_6$, po) = 60/100 * 59/99 * 58/98 * .../55/95 * 40/94 * 39/93 * ..* 37/91
            = P (60, 6)* P(40, 4)/ P(100, 10)



            But there are C (10, 6) = P(10, 6)/ 6! = I such possibilities.



            So exactly 6 s out of 10 t "in any order" is



            Pr ($A_6$) = $sum_{ i =1}^I$Pr ($A_6$, po) = I * Pr($A_6$, po)
            = C(10, 6) * P(60, 6) * P(40, 4) / P(100, 10)
            = C(10, 6) * (6!* 4! /10!) *C(60, 6) * C(40, 4) / C(100,10)
            = C(10, 6)/C(10,6) * C(60, 6) * C(40, 4) / C(100,10)
            = C(60, 6) * C(40, 4) / C(100,10),
            which is exactly the results using combination approach!



            The probability of solving at least 6 s out of 10 t is
            Pr(A) = $sum_{i=6}^{10}$ Pr($A_i$).






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
              $endgroup$
              – paw88789
              Mar 31 '17 at 12:24










            • $begingroup$
              Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 13:36










            • $begingroup$
              Sorry, this is unclear to me.
              $endgroup$
              – CodeHoarder
              Mar 31 '17 at 14:54










            • $begingroup$
              I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 22:32










            • $begingroup$
              I am still not allowed to post.
              $endgroup$
              – cdeamaze
              Apr 3 '17 at 3:56
















            0












            $begingroup$

            A permutational approach - Equivalence of permutation and combination formula



            Define event A to be there are at least 6 successes out of n = 10
            trials. Let's also use symbols: "s" for success, "f" for failure, "t"
            for trial" "Pr" for probability, "P" for permutation and "C" for
            combination,
            "P(n, r)" for selecting r out of n objects in permutation and C(n, r)
            for select r out of n objects in combination.



            Exactly 6 s out of 10 t, assume first 6 are s, last 4 are f "in that order".



            Pr($A_6$, po) = 60/100 * 59/99 * 58/98 * .../55/95 * 40/94 * 39/93 * ..* 37/91
            = P (60, 6)* P(40, 4)/ P(100, 10)



            But there are C (10, 6) = P(10, 6)/ 6! = I such possibilities.



            So exactly 6 s out of 10 t "in any order" is



            Pr ($A_6$) = $sum_{ i =1}^I$Pr ($A_6$, po) = I * Pr($A_6$, po)
            = C(10, 6) * P(60, 6) * P(40, 4) / P(100, 10)
            = C(10, 6) * (6!* 4! /10!) *C(60, 6) * C(40, 4) / C(100,10)
            = C(10, 6)/C(10,6) * C(60, 6) * C(40, 4) / C(100,10)
            = C(60, 6) * C(40, 4) / C(100,10),
            which is exactly the results using combination approach!



            The probability of solving at least 6 s out of 10 t is
            Pr(A) = $sum_{i=6}^{10}$ Pr($A_i$).






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
              $endgroup$
              – paw88789
              Mar 31 '17 at 12:24










            • $begingroup$
              Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 13:36










            • $begingroup$
              Sorry, this is unclear to me.
              $endgroup$
              – CodeHoarder
              Mar 31 '17 at 14:54










            • $begingroup$
              I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 22:32










            • $begingroup$
              I am still not allowed to post.
              $endgroup$
              – cdeamaze
              Apr 3 '17 at 3:56














            0












            0








            0





            $begingroup$

            A permutational approach - Equivalence of permutation and combination formula



            Define event A to be there are at least 6 successes out of n = 10
            trials. Let's also use symbols: "s" for success, "f" for failure, "t"
            for trial" "Pr" for probability, "P" for permutation and "C" for
            combination,
            "P(n, r)" for selecting r out of n objects in permutation and C(n, r)
            for select r out of n objects in combination.



            Exactly 6 s out of 10 t, assume first 6 are s, last 4 are f "in that order".



            Pr($A_6$, po) = 60/100 * 59/99 * 58/98 * .../55/95 * 40/94 * 39/93 * ..* 37/91
            = P (60, 6)* P(40, 4)/ P(100, 10)



            But there are C (10, 6) = P(10, 6)/ 6! = I such possibilities.



            So exactly 6 s out of 10 t "in any order" is



            Pr ($A_6$) = $sum_{ i =1}^I$Pr ($A_6$, po) = I * Pr($A_6$, po)
            = C(10, 6) * P(60, 6) * P(40, 4) / P(100, 10)
            = C(10, 6) * (6!* 4! /10!) *C(60, 6) * C(40, 4) / C(100,10)
            = C(10, 6)/C(10,6) * C(60, 6) * C(40, 4) / C(100,10)
            = C(60, 6) * C(40, 4) / C(100,10),
            which is exactly the results using combination approach!



            The probability of solving at least 6 s out of 10 t is
            Pr(A) = $sum_{i=6}^{10}$ Pr($A_i$).






            share|cite|improve this answer











            $endgroup$



            A permutational approach - Equivalence of permutation and combination formula



            Define event A to be there are at least 6 successes out of n = 10
            trials. Let's also use symbols: "s" for success, "f" for failure, "t"
            for trial" "Pr" for probability, "P" for permutation and "C" for
            combination,
            "P(n, r)" for selecting r out of n objects in permutation and C(n, r)
            for select r out of n objects in combination.



            Exactly 6 s out of 10 t, assume first 6 are s, last 4 are f "in that order".



            Pr($A_6$, po) = 60/100 * 59/99 * 58/98 * .../55/95 * 40/94 * 39/93 * ..* 37/91
            = P (60, 6)* P(40, 4)/ P(100, 10)



            But there are C (10, 6) = P(10, 6)/ 6! = I such possibilities.



            So exactly 6 s out of 10 t "in any order" is



            Pr ($A_6$) = $sum_{ i =1}^I$Pr ($A_6$, po) = I * Pr($A_6$, po)
            = C(10, 6) * P(60, 6) * P(40, 4) / P(100, 10)
            = C(10, 6) * (6!* 4! /10!) *C(60, 6) * C(40, 4) / C(100,10)
            = C(10, 6)/C(10,6) * C(60, 6) * C(40, 4) / C(100,10)
            = C(60, 6) * C(40, 4) / C(100,10),
            which is exactly the results using combination approach!



            The probability of solving at least 6 s out of 10 t is
            Pr(A) = $sum_{i=6}^{10}$ Pr($A_i$).







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Apr 5 '17 at 23:02

























            answered Mar 31 '17 at 12:16









            cdeamazecdeamaze

            114




            114












            • $begingroup$
              This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
              $endgroup$
              – paw88789
              Mar 31 '17 at 12:24










            • $begingroup$
              Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 13:36










            • $begingroup$
              Sorry, this is unclear to me.
              $endgroup$
              – CodeHoarder
              Mar 31 '17 at 14:54










            • $begingroup$
              I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 22:32










            • $begingroup$
              I am still not allowed to post.
              $endgroup$
              – cdeamaze
              Apr 3 '17 at 3:56


















            • $begingroup$
              This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
              $endgroup$
              – paw88789
              Mar 31 '17 at 12:24










            • $begingroup$
              Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 13:36










            • $begingroup$
              Sorry, this is unclear to me.
              $endgroup$
              – CodeHoarder
              Mar 31 '17 at 14:54










            • $begingroup$
              I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
              $endgroup$
              – cdeamaze
              Mar 31 '17 at 22:32










            • $begingroup$
              I am still not allowed to post.
              $endgroup$
              – cdeamaze
              Apr 3 '17 at 3:56
















            $begingroup$
            This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
            $endgroup$
            – paw88789
            Mar 31 '17 at 12:24




            $begingroup$
            This solution assumes independence of selection. But as (presumably) a given question won't be selected more than once, we wouldn't have independence.
            $endgroup$
            – paw88789
            Mar 31 '17 at 12:24












            $begingroup$
            Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
            $endgroup$
            – cdeamaze
            Mar 31 '17 at 13:36




            $begingroup$
            Thanks, you have a very good point! Instead of p^ k, do I need p1= P- i 1)/(N-I+))
            $endgroup$
            – cdeamaze
            Mar 31 '17 at 13:36












            $begingroup$
            Sorry, this is unclear to me.
            $endgroup$
            – CodeHoarder
            Mar 31 '17 at 14:54




            $begingroup$
            Sorry, this is unclear to me.
            $endgroup$
            – CodeHoarder
            Mar 31 '17 at 14:54












            $begingroup$
            I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
            $endgroup$
            – cdeamaze
            Mar 31 '17 at 22:32




            $begingroup$
            I will have to come back at a later time to post an update. Sorry, my post was incomplete as I hit a return button by mistake. When I tried to correct it, I was told to wait until at least tomorrow as I have used my daily quota which is one post a day. I am a newbie, so some restrictions applied. Stay tuned.
            $endgroup$
            – cdeamaze
            Mar 31 '17 at 22:32












            $begingroup$
            I am still not allowed to post.
            $endgroup$
            – cdeamaze
            Apr 3 '17 at 3:56




            $begingroup$
            I am still not allowed to post.
            $endgroup$
            – cdeamaze
            Apr 3 '17 at 3:56


















            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2211517%2fprobability-of-at-least-6-out-of-10%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

            MongoDB - Not Authorized To Execute Command

            How to fix TextFormField cause rebuild widget in Flutter

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith