What is the probability of having a pair of doubles when throwing dice?Dice probability for Yahtzee large straightEstimating the number of times each of four pairs of dice was thrownprobability of a pair in cardsHow to check if people think 3 is a lucky number while we throw with 2 diceProof of Algebraic Formula for the Sum of Two-Dice Toss as a ConvolutionHow do we know that the probability of rolling 1 and 2 is 1/18?Probability of throwing n different numbers in m throws of a dicebasic probability questions with respect to dice, potential textbook error, or is it over my head?How to calculate probability distribution of rolling n dice? (with a twist!)Probability of 3 dice with rethrown

Biblical Basis for 400 years of silence between old and new testament

Is it possible to kill all life on Earth?

Rotated Position of Integers

Could IPv6 make NAT / port numbers redundant?

Socratic Paradox

How to properly maintain eye contact with people that have distinctive facial features?

Can you move on your turn, and then use the Ready Action to move again on another creature's turn?

The deliberate use of misleading terminology

Select row of data if next row contains zero

What is game ban VS VAC ban in steam?

How does one "dump" or deplete propellant without changing spacecraft attitude or trajectory?

What is the 中 in ダウンロード中?

Can a rogue effectively triple their speed by combining Dash and Ready?

Is floating in space similar to falling under gravity?

Did airlines fly their aircraft slower in response to oil prices in the 1970s?

Beginner's snake game using PyGame

Term for checking piece whose opponent daren't capture it

Does `declare -a A` create an empty array `A` in Bash?

How did early x86 BIOS programmers manage to program full blown TUIs given very few bytes of ROM/EPROM?

When a current flow in an inductor is interrupted, what limits the voltage rise?

What are the slash markings on Gatwick's 08R/26L?

Where did the “vikings wear helmets with horn” stereotype come from and why?

Why would Lupin kill Pettigrew?

When was the expression "Indian file" first used in English?



What is the probability of having a pair of doubles when throwing dice?


Dice probability for Yahtzee large straightEstimating the number of times each of four pairs of dice was thrownprobability of a pair in cardsHow to check if people think 3 is a lucky number while we throw with 2 diceProof of Algebraic Formula for the Sum of Two-Dice Toss as a ConvolutionHow do we know that the probability of rolling 1 and 2 is 1/18?Probability of throwing n different numbers in m throws of a dicebasic probability questions with respect to dice, potential textbook error, or is it over my head?How to calculate probability distribution of rolling n dice? (with a twist!)Probability of 3 dice with rethrown






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








4












$begingroup$


What is the probability of having a double (two dice will show the same number)
when we throw 5 dice (all dice have 6 sides)?



My calculations are:



Combinations(5,2)*6 / 5^6


When I try to find the probability of having a pair of doubles (two dice will show the same number and another two dice will show the same number) when we throw 5 dice, my calculations are the following:



 Combinations(5,2)*6 / 5^6 * Combinations(3,2)*6 / 5^6 


Is that approach correct or I should try something else?










share|cite|improve this question











$endgroup$


















    4












    $begingroup$


    What is the probability of having a double (two dice will show the same number)
    when we throw 5 dice (all dice have 6 sides)?



    My calculations are:



    Combinations(5,2)*6 / 5^6


    When I try to find the probability of having a pair of doubles (two dice will show the same number and another two dice will show the same number) when we throw 5 dice, my calculations are the following:



     Combinations(5,2)*6 / 5^6 * Combinations(3,2)*6 / 5^6 


    Is that approach correct or I should try something else?










    share|cite|improve this question











    $endgroup$














      4












      4








      4





      $begingroup$


      What is the probability of having a double (two dice will show the same number)
      when we throw 5 dice (all dice have 6 sides)?



      My calculations are:



      Combinations(5,2)*6 / 5^6


      When I try to find the probability of having a pair of doubles (two dice will show the same number and another two dice will show the same number) when we throw 5 dice, my calculations are the following:



       Combinations(5,2)*6 / 5^6 * Combinations(3,2)*6 / 5^6 


      Is that approach correct or I should try something else?










      share|cite|improve this question











      $endgroup$




      What is the probability of having a double (two dice will show the same number)
      when we throw 5 dice (all dice have 6 sides)?



      My calculations are:



      Combinations(5,2)*6 / 5^6


      When I try to find the probability of having a pair of doubles (two dice will show the same number and another two dice will show the same number) when we throw 5 dice, my calculations are the following:



       Combinations(5,2)*6 / 5^6 * Combinations(3,2)*6 / 5^6 


      Is that approach correct or I should try something else?







      probability combinatorics






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 5 hours ago









      whuber

      209k34459835




      209k34459835










      asked 8 hours ago









      Liz HiLiz Hi

      212




      212




















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          I am not exactly sure about your approach, but here you have a simple one:



          After 1 di is rolled, no repeats are possible.
          After 2 dice are rolled, there is a $frac56$ chance of both dice showing a different number
          After 3, there is a $frac56 frac46$ (the $frac56$ we had before, times the chance ofthe third di being igual to either the first or the second (in case the other two are different)



          It is not hard see that the general ansewr for $k$ dice rolled is $frac6!(6-k)! cdot6^k$ (if you don't see why, put a $frac66$ into everything we said before. This works for $k leq 6$ as for higher values of $k$ the ansswer is obviously $0$ Note that for $k=6$, we get the answer $frac6!6^k$, which is the number of ways to sort 6 different dice divided by the total number of 6-dice roll results.



          NOTE: Unfortunatelly, I am not sure about how this way of reasoning can result in an easy formula for a two-pair, as there would be quite a few cases to consider






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
            $endgroup$
            – whuber
            6 hours ago










          • $begingroup$
            Thank you, @whuber for helping us get closer to the answer
            $endgroup$
            – David
            6 hours ago


















          1












          $begingroup$

          You can find the chance of getting a pair of doubles using combinations. Here's one way.



          First, recall that a "combination" of $n$ things taken $k$ at a time is just a $k$-element subset of those things. The number of distinct combinations is a binomial coefficient, written (and often computed) as



          $$binomnk = fracn!(n-k)!k!.$$



          The key to this approach is to create an economical notation to describe the events of interest. To this end, note that the outcomes of $5$ independent rolls of a six-sided die correspond to six-element vectors whose entries count the number of appearances of each side. Specifically, when side $i$ appears $n_i$ times among those five rolls, entry $i$ in the vector is $n_i.$ For instance, if two threes appear along with one each of 1, 4, and 5, the vector would be $(1,0,2,1,1,0).$



          Let the "pattern" of a vector be the counts of its entries. The pattern of the preceding vector is two zeros, three ones, and a two. We can write this pattern as a sequence of the counts $2, 3, 1, 0, 0, ldots.$ (It's unnecessary to write the terminal zeros.)



          Solve the problem in these steps.



          1. Identify all patterns with two doubles. This is straightforward: they would be $0,1,2$ and $0,0,1,1.$ (What characterizes them is that these are sequences of natural numbers $k_0, k_1, k_2, ldots$ for which $sum_i=0^infty i,k_i = 5$ and $sum_i=2^infty k_i ge 2.$ The first sum counts the dice while the second counts the outcomes appearing two or more times.)



          2. Identify the number of ways each pattern could appear in a six-vector.



            • The pattern $0,1,2$ picks out two outcomes having doubles and, among the remaining $6-2 = 4$ outcomes, it picks out one more possibility. There are $binom62=15$ in the first case and $binom6-21=4$ in the other for a total of $15times 4 = 60$ possibilities.


            • The pattern $0,0,1,1$ picks out one outcome with a double and another with a triple. There are $binom61=6$ ways for the first to occur and then $binom6-11=5$ more ways for the other to occur, for a total of $6times 5 = 30$ possibilities.



          3. Compute the chances of all these possible six-vectors $mathbf n.$ They are given by the multinomial coefficients $$binom5mathbf n = frac5!n_1!n_2!cdots n_6!,$$ each multiplied by the chance of any individual outcome; namely, $6^-5.$ Since these multinomial coefficients don't change when the elements of $mathbb n$ are reordered, they depend only on the patterns, so there are only two values to work out: $$binom5(2,2,1,0,0,0) = frac5!2!2!1! = 30$$ and $$binom5(3,2,0,0,0,0) = frac5!3!2!=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


          4. Add the chances. We obtain $$eqalignleft(binom5(2,2,1) binom62 binom6-21 + binom5(3,2) binom61binom6-11 right)6^-5 &= frac30(15)(4) + 10(6)(5)6^5 \&= frac21007776.$$



          I have written the formulas in a way that suggests how they generalize to different patterns for different numbers of rolls for arbitrary-sided dice. Step 1 is the hard part in general: the rest are just straightforward calculation. Solving step 1 amounts to finding partitions with certain properties. This is a rich combinatorial subject but its analysis requires more advanced mathematics.






          share|cite|improve this answer









          $endgroup$













            Your Answer








            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "65"
            ;
            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: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            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
            ,
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f410483%2fwhat-is-the-probability-of-having-a-pair-of-doubles-when-throwing-dice%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









            2












            $begingroup$

            I am not exactly sure about your approach, but here you have a simple one:



            After 1 di is rolled, no repeats are possible.
            After 2 dice are rolled, there is a $frac56$ chance of both dice showing a different number
            After 3, there is a $frac56 frac46$ (the $frac56$ we had before, times the chance ofthe third di being igual to either the first or the second (in case the other two are different)



            It is not hard see that the general ansewr for $k$ dice rolled is $frac6!(6-k)! cdot6^k$ (if you don't see why, put a $frac66$ into everything we said before. This works for $k leq 6$ as for higher values of $k$ the ansswer is obviously $0$ Note that for $k=6$, we get the answer $frac6!6^k$, which is the number of ways to sort 6 different dice divided by the total number of 6-dice roll results.



            NOTE: Unfortunatelly, I am not sure about how this way of reasoning can result in an easy formula for a two-pair, as there would be quite a few cases to consider






            share|cite|improve this answer











            $endgroup$












            • $begingroup$
              The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
              $endgroup$
              – whuber
              6 hours ago










            • $begingroup$
              Thank you, @whuber for helping us get closer to the answer
              $endgroup$
              – David
              6 hours ago















            2












            $begingroup$

            I am not exactly sure about your approach, but here you have a simple one:



            After 1 di is rolled, no repeats are possible.
            After 2 dice are rolled, there is a $frac56$ chance of both dice showing a different number
            After 3, there is a $frac56 frac46$ (the $frac56$ we had before, times the chance ofthe third di being igual to either the first or the second (in case the other two are different)



            It is not hard see that the general ansewr for $k$ dice rolled is $frac6!(6-k)! cdot6^k$ (if you don't see why, put a $frac66$ into everything we said before. This works for $k leq 6$ as for higher values of $k$ the ansswer is obviously $0$ Note that for $k=6$, we get the answer $frac6!6^k$, which is the number of ways to sort 6 different dice divided by the total number of 6-dice roll results.



            NOTE: Unfortunatelly, I am not sure about how this way of reasoning can result in an easy formula for a two-pair, as there would be quite a few cases to consider






            share|cite|improve this answer











            $endgroup$












            • $begingroup$
              The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
              $endgroup$
              – whuber
              6 hours ago










            • $begingroup$
              Thank you, @whuber for helping us get closer to the answer
              $endgroup$
              – David
              6 hours ago













            2












            2








            2





            $begingroup$

            I am not exactly sure about your approach, but here you have a simple one:



            After 1 di is rolled, no repeats are possible.
            After 2 dice are rolled, there is a $frac56$ chance of both dice showing a different number
            After 3, there is a $frac56 frac46$ (the $frac56$ we had before, times the chance ofthe third di being igual to either the first or the second (in case the other two are different)



            It is not hard see that the general ansewr for $k$ dice rolled is $frac6!(6-k)! cdot6^k$ (if you don't see why, put a $frac66$ into everything we said before. This works for $k leq 6$ as for higher values of $k$ the ansswer is obviously $0$ Note that for $k=6$, we get the answer $frac6!6^k$, which is the number of ways to sort 6 different dice divided by the total number of 6-dice roll results.



            NOTE: Unfortunatelly, I am not sure about how this way of reasoning can result in an easy formula for a two-pair, as there would be quite a few cases to consider






            share|cite|improve this answer











            $endgroup$



            I am not exactly sure about your approach, but here you have a simple one:



            After 1 di is rolled, no repeats are possible.
            After 2 dice are rolled, there is a $frac56$ chance of both dice showing a different number
            After 3, there is a $frac56 frac46$ (the $frac56$ we had before, times the chance ofthe third di being igual to either the first or the second (in case the other two are different)



            It is not hard see that the general ansewr for $k$ dice rolled is $frac6!(6-k)! cdot6^k$ (if you don't see why, put a $frac66$ into everything we said before. This works for $k leq 6$ as for higher values of $k$ the ansswer is obviously $0$ Note that for $k=6$, we get the answer $frac6!6^k$, which is the number of ways to sort 6 different dice divided by the total number of 6-dice roll results.



            NOTE: Unfortunatelly, I am not sure about how this way of reasoning can result in an easy formula for a two-pair, as there would be quite a few cases to consider







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 7 hours ago

























            answered 7 hours ago









            DavidDavid

            6626




            6626











            • $begingroup$
              The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
              $endgroup$
              – whuber
              6 hours ago










            • $begingroup$
              Thank you, @whuber for helping us get closer to the answer
              $endgroup$
              – David
              6 hours ago
















            • $begingroup$
              The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
              $endgroup$
              – whuber
              6 hours ago










            • $begingroup$
              Thank you, @whuber for helping us get closer to the answer
              $endgroup$
              – David
              6 hours ago















            $begingroup$
            The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
            $endgroup$
            – whuber
            6 hours ago




            $begingroup$
            The first question has been answered in many places elsewhere on this site: see stats.stackexchange.com/search?q=birthday+problem for some of them. Thus, the part that is on topic is the second question.
            $endgroup$
            – whuber
            6 hours ago












            $begingroup$
            Thank you, @whuber for helping us get closer to the answer
            $endgroup$
            – David
            6 hours ago




            $begingroup$
            Thank you, @whuber for helping us get closer to the answer
            $endgroup$
            – David
            6 hours ago













            1












            $begingroup$

            You can find the chance of getting a pair of doubles using combinations. Here's one way.



            First, recall that a "combination" of $n$ things taken $k$ at a time is just a $k$-element subset of those things. The number of distinct combinations is a binomial coefficient, written (and often computed) as



            $$binomnk = fracn!(n-k)!k!.$$



            The key to this approach is to create an economical notation to describe the events of interest. To this end, note that the outcomes of $5$ independent rolls of a six-sided die correspond to six-element vectors whose entries count the number of appearances of each side. Specifically, when side $i$ appears $n_i$ times among those five rolls, entry $i$ in the vector is $n_i.$ For instance, if two threes appear along with one each of 1, 4, and 5, the vector would be $(1,0,2,1,1,0).$



            Let the "pattern" of a vector be the counts of its entries. The pattern of the preceding vector is two zeros, three ones, and a two. We can write this pattern as a sequence of the counts $2, 3, 1, 0, 0, ldots.$ (It's unnecessary to write the terminal zeros.)



            Solve the problem in these steps.



            1. Identify all patterns with two doubles. This is straightforward: they would be $0,1,2$ and $0,0,1,1.$ (What characterizes them is that these are sequences of natural numbers $k_0, k_1, k_2, ldots$ for which $sum_i=0^infty i,k_i = 5$ and $sum_i=2^infty k_i ge 2.$ The first sum counts the dice while the second counts the outcomes appearing two or more times.)



            2. Identify the number of ways each pattern could appear in a six-vector.



              • The pattern $0,1,2$ picks out two outcomes having doubles and, among the remaining $6-2 = 4$ outcomes, it picks out one more possibility. There are $binom62=15$ in the first case and $binom6-21=4$ in the other for a total of $15times 4 = 60$ possibilities.


              • The pattern $0,0,1,1$ picks out one outcome with a double and another with a triple. There are $binom61=6$ ways for the first to occur and then $binom6-11=5$ more ways for the other to occur, for a total of $6times 5 = 30$ possibilities.



            3. Compute the chances of all these possible six-vectors $mathbf n.$ They are given by the multinomial coefficients $$binom5mathbf n = frac5!n_1!n_2!cdots n_6!,$$ each multiplied by the chance of any individual outcome; namely, $6^-5.$ Since these multinomial coefficients don't change when the elements of $mathbb n$ are reordered, they depend only on the patterns, so there are only two values to work out: $$binom5(2,2,1,0,0,0) = frac5!2!2!1! = 30$$ and $$binom5(3,2,0,0,0,0) = frac5!3!2!=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


            4. Add the chances. We obtain $$eqalignleft(binom5(2,2,1) binom62 binom6-21 + binom5(3,2) binom61binom6-11 right)6^-5 &= frac30(15)(4) + 10(6)(5)6^5 \&= frac21007776.$$



            I have written the formulas in a way that suggests how they generalize to different patterns for different numbers of rolls for arbitrary-sided dice. Step 1 is the hard part in general: the rest are just straightforward calculation. Solving step 1 amounts to finding partitions with certain properties. This is a rich combinatorial subject but its analysis requires more advanced mathematics.






            share|cite|improve this answer









            $endgroup$

















              1












              $begingroup$

              You can find the chance of getting a pair of doubles using combinations. Here's one way.



              First, recall that a "combination" of $n$ things taken $k$ at a time is just a $k$-element subset of those things. The number of distinct combinations is a binomial coefficient, written (and often computed) as



              $$binomnk = fracn!(n-k)!k!.$$



              The key to this approach is to create an economical notation to describe the events of interest. To this end, note that the outcomes of $5$ independent rolls of a six-sided die correspond to six-element vectors whose entries count the number of appearances of each side. Specifically, when side $i$ appears $n_i$ times among those five rolls, entry $i$ in the vector is $n_i.$ For instance, if two threes appear along with one each of 1, 4, and 5, the vector would be $(1,0,2,1,1,0).$



              Let the "pattern" of a vector be the counts of its entries. The pattern of the preceding vector is two zeros, three ones, and a two. We can write this pattern as a sequence of the counts $2, 3, 1, 0, 0, ldots.$ (It's unnecessary to write the terminal zeros.)



              Solve the problem in these steps.



              1. Identify all patterns with two doubles. This is straightforward: they would be $0,1,2$ and $0,0,1,1.$ (What characterizes them is that these are sequences of natural numbers $k_0, k_1, k_2, ldots$ for which $sum_i=0^infty i,k_i = 5$ and $sum_i=2^infty k_i ge 2.$ The first sum counts the dice while the second counts the outcomes appearing two or more times.)



              2. Identify the number of ways each pattern could appear in a six-vector.



                • The pattern $0,1,2$ picks out two outcomes having doubles and, among the remaining $6-2 = 4$ outcomes, it picks out one more possibility. There are $binom62=15$ in the first case and $binom6-21=4$ in the other for a total of $15times 4 = 60$ possibilities.


                • The pattern $0,0,1,1$ picks out one outcome with a double and another with a triple. There are $binom61=6$ ways for the first to occur and then $binom6-11=5$ more ways for the other to occur, for a total of $6times 5 = 30$ possibilities.



              3. Compute the chances of all these possible six-vectors $mathbf n.$ They are given by the multinomial coefficients $$binom5mathbf n = frac5!n_1!n_2!cdots n_6!,$$ each multiplied by the chance of any individual outcome; namely, $6^-5.$ Since these multinomial coefficients don't change when the elements of $mathbb n$ are reordered, they depend only on the patterns, so there are only two values to work out: $$binom5(2,2,1,0,0,0) = frac5!2!2!1! = 30$$ and $$binom5(3,2,0,0,0,0) = frac5!3!2!=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


              4. Add the chances. We obtain $$eqalignleft(binom5(2,2,1) binom62 binom6-21 + binom5(3,2) binom61binom6-11 right)6^-5 &= frac30(15)(4) + 10(6)(5)6^5 \&= frac21007776.$$



              I have written the formulas in a way that suggests how they generalize to different patterns for different numbers of rolls for arbitrary-sided dice. Step 1 is the hard part in general: the rest are just straightforward calculation. Solving step 1 amounts to finding partitions with certain properties. This is a rich combinatorial subject but its analysis requires more advanced mathematics.






              share|cite|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                You can find the chance of getting a pair of doubles using combinations. Here's one way.



                First, recall that a "combination" of $n$ things taken $k$ at a time is just a $k$-element subset of those things. The number of distinct combinations is a binomial coefficient, written (and often computed) as



                $$binomnk = fracn!(n-k)!k!.$$



                The key to this approach is to create an economical notation to describe the events of interest. To this end, note that the outcomes of $5$ independent rolls of a six-sided die correspond to six-element vectors whose entries count the number of appearances of each side. Specifically, when side $i$ appears $n_i$ times among those five rolls, entry $i$ in the vector is $n_i.$ For instance, if two threes appear along with one each of 1, 4, and 5, the vector would be $(1,0,2,1,1,0).$



                Let the "pattern" of a vector be the counts of its entries. The pattern of the preceding vector is two zeros, three ones, and a two. We can write this pattern as a sequence of the counts $2, 3, 1, 0, 0, ldots.$ (It's unnecessary to write the terminal zeros.)



                Solve the problem in these steps.



                1. Identify all patterns with two doubles. This is straightforward: they would be $0,1,2$ and $0,0,1,1.$ (What characterizes them is that these are sequences of natural numbers $k_0, k_1, k_2, ldots$ for which $sum_i=0^infty i,k_i = 5$ and $sum_i=2^infty k_i ge 2.$ The first sum counts the dice while the second counts the outcomes appearing two or more times.)



                2. Identify the number of ways each pattern could appear in a six-vector.



                  • The pattern $0,1,2$ picks out two outcomes having doubles and, among the remaining $6-2 = 4$ outcomes, it picks out one more possibility. There are $binom62=15$ in the first case and $binom6-21=4$ in the other for a total of $15times 4 = 60$ possibilities.


                  • The pattern $0,0,1,1$ picks out one outcome with a double and another with a triple. There are $binom61=6$ ways for the first to occur and then $binom6-11=5$ more ways for the other to occur, for a total of $6times 5 = 30$ possibilities.



                3. Compute the chances of all these possible six-vectors $mathbf n.$ They are given by the multinomial coefficients $$binom5mathbf n = frac5!n_1!n_2!cdots n_6!,$$ each multiplied by the chance of any individual outcome; namely, $6^-5.$ Since these multinomial coefficients don't change when the elements of $mathbb n$ are reordered, they depend only on the patterns, so there are only two values to work out: $$binom5(2,2,1,0,0,0) = frac5!2!2!1! = 30$$ and $$binom5(3,2,0,0,0,0) = frac5!3!2!=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


                4. Add the chances. We obtain $$eqalignleft(binom5(2,2,1) binom62 binom6-21 + binom5(3,2) binom61binom6-11 right)6^-5 &= frac30(15)(4) + 10(6)(5)6^5 \&= frac21007776.$$



                I have written the formulas in a way that suggests how they generalize to different patterns for different numbers of rolls for arbitrary-sided dice. Step 1 is the hard part in general: the rest are just straightforward calculation. Solving step 1 amounts to finding partitions with certain properties. This is a rich combinatorial subject but its analysis requires more advanced mathematics.






                share|cite|improve this answer









                $endgroup$



                You can find the chance of getting a pair of doubles using combinations. Here's one way.



                First, recall that a "combination" of $n$ things taken $k$ at a time is just a $k$-element subset of those things. The number of distinct combinations is a binomial coefficient, written (and often computed) as



                $$binomnk = fracn!(n-k)!k!.$$



                The key to this approach is to create an economical notation to describe the events of interest. To this end, note that the outcomes of $5$ independent rolls of a six-sided die correspond to six-element vectors whose entries count the number of appearances of each side. Specifically, when side $i$ appears $n_i$ times among those five rolls, entry $i$ in the vector is $n_i.$ For instance, if two threes appear along with one each of 1, 4, and 5, the vector would be $(1,0,2,1,1,0).$



                Let the "pattern" of a vector be the counts of its entries. The pattern of the preceding vector is two zeros, three ones, and a two. We can write this pattern as a sequence of the counts $2, 3, 1, 0, 0, ldots.$ (It's unnecessary to write the terminal zeros.)



                Solve the problem in these steps.



                1. Identify all patterns with two doubles. This is straightforward: they would be $0,1,2$ and $0,0,1,1.$ (What characterizes them is that these are sequences of natural numbers $k_0, k_1, k_2, ldots$ for which $sum_i=0^infty i,k_i = 5$ and $sum_i=2^infty k_i ge 2.$ The first sum counts the dice while the second counts the outcomes appearing two or more times.)



                2. Identify the number of ways each pattern could appear in a six-vector.



                  • The pattern $0,1,2$ picks out two outcomes having doubles and, among the remaining $6-2 = 4$ outcomes, it picks out one more possibility. There are $binom62=15$ in the first case and $binom6-21=4$ in the other for a total of $15times 4 = 60$ possibilities.


                  • The pattern $0,0,1,1$ picks out one outcome with a double and another with a triple. There are $binom61=6$ ways for the first to occur and then $binom6-11=5$ more ways for the other to occur, for a total of $6times 5 = 30$ possibilities.



                3. Compute the chances of all these possible six-vectors $mathbf n.$ They are given by the multinomial coefficients $$binom5mathbf n = frac5!n_1!n_2!cdots n_6!,$$ each multiplied by the chance of any individual outcome; namely, $6^-5.$ Since these multinomial coefficients don't change when the elements of $mathbb n$ are reordered, they depend only on the patterns, so there are only two values to work out: $$binom5(2,2,1,0,0,0) = frac5!2!2!1! = 30$$ and $$binom5(3,2,0,0,0,0) = frac5!3!2!=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


                4. Add the chances. We obtain $$eqalignleft(binom5(2,2,1) binom62 binom6-21 + binom5(3,2) binom61binom6-11 right)6^-5 &= frac30(15)(4) + 10(6)(5)6^5 \&= frac21007776.$$



                I have written the formulas in a way that suggests how they generalize to different patterns for different numbers of rolls for arbitrary-sided dice. Step 1 is the hard part in general: the rest are just straightforward calculation. Solving step 1 amounts to finding partitions with certain properties. This is a rich combinatorial subject but its analysis requires more advanced mathematics.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 5 hours ago









                whuberwhuber

                209k34459835




                209k34459835



























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Cross Validated!


                    • 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%2fstats.stackexchange.com%2fquestions%2f410483%2fwhat-is-the-probability-of-having-a-pair-of-doubles-when-throwing-dice%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

                    Sahara Skak | Bilen | Luke uk diar | NawigatsjuunCommonskategorii: SaharaWikivoyage raisfeerer: Sahara26° N, 13° O

                    The fall designs the understood secretary. Looking glass Science Shock Discovery Hot Everybody Loves Raymond Smile 곳 서비스 성실하다 Defas Kaloolon Definition: To combine or impregnate with sulphur or any of its compounds as to sulphurize caoutchouc in vulcanizing Flame colored Reason Useful Thin Help 갖다 유명하다 낙엽 장례식 Country Iron Definition: A fencer a gladiator one who exhibits his skill in the use of the sword Definition: The American black throated bunting Spiza Americana Nostalgic Needy Method to my madness 시키다 평가되다 전부 소설가 우아하다 Argument Tin Feeling Representative Gym Music Gaur Chicken 일쑤 코치 편 학생증 The harbor values the sugar. Vasagle Yammoe Enstatite Definition: Capable of being limited Road Neighborly Five Refer Built Kangaroo 비비다 Degree Release Bargain Horse 하루 형님 유교 석 동부 괴롭히다 경제력

                    19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу