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





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








5














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






















    5














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


















      5












      5








      5





      $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 May 28 at 18:45









      whuber

      219k35 gold badges481 silver badges877 bronze badges




      219k35 gold badges481 silver badges877 bronze badges










      asked May 28 at 15:43









      Liz HiLiz Hi

      283 bronze badges




      283 bronze badges

























          2 Answers
          2






          active

          oldest

          votes


















          2
















          $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



          $$binom{n}{k} = frac{n!}{(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 $binom{6}{2}=15$ in the first case and $binom{6-2}{1}=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 $binom{6}{1}=6$ ways for the first to occur and then $binom{6-1}{1}=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 $$binom{5}{mathbf n} = frac{5!}{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: $$binom{5}{(2,2,1,0,0,0)} = frac{5!}{2!2!1!} = 30$$ and $$binom{5}{(3,2,0,0,0,0)} = frac{5!}{3!2!}=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


          4. Add the chances. We obtain $$eqalign{left(binom{5}{(2,2,1)} binom{6}{2} binom{6-2}{1} + binom{5}{(3,2)} binom{6}{1}binom{6-1}{1} right)6^{-5} &= frac{30(15)(4) + 10(6)(5)}{6^5} \&= frac{2100}{7776}.}$$





          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$























            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 $frac{5}{6}$ chance of both dice showing a different number
            After 3, there is a $frac{5}{6} frac{4}{6}$ (the $frac{5}{6}$ 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 $frac{6!}{(6-k)! cdot6^k}$ (if you don't see why, put a $frac{6}{6}$ 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 $frac{6!}{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
              May 28 at 17:04










            • $begingroup$
              Thank you, @whuber for helping us get closer to the answer
              $endgroup$
              – David
              May 28 at 17:43













            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/4.0/"u003ecc by-sa 4.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$

            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



            $$binom{n}{k} = frac{n!}{(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 $binom{6}{2}=15$ in the first case and $binom{6-2}{1}=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 $binom{6}{1}=6$ ways for the first to occur and then $binom{6-1}{1}=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 $$binom{5}{mathbf n} = frac{5!}{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: $$binom{5}{(2,2,1,0,0,0)} = frac{5!}{2!2!1!} = 30$$ and $$binom{5}{(3,2,0,0,0,0)} = frac{5!}{3!2!}=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


            4. Add the chances. We obtain $$eqalign{left(binom{5}{(2,2,1)} binom{6}{2} binom{6-2}{1} + binom{5}{(3,2)} binom{6}{1}binom{6-1}{1} right)6^{-5} &= frac{30(15)(4) + 10(6)(5)}{6^5} \&= frac{2100}{7776}.}$$





            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$




















              2
















              $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



              $$binom{n}{k} = frac{n!}{(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 $binom{6}{2}=15$ in the first case and $binom{6-2}{1}=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 $binom{6}{1}=6$ ways for the first to occur and then $binom{6-1}{1}=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 $$binom{5}{mathbf n} = frac{5!}{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: $$binom{5}{(2,2,1,0,0,0)} = frac{5!}{2!2!1!} = 30$$ and $$binom{5}{(3,2,0,0,0,0)} = frac{5!}{3!2!}=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


              4. Add the chances. We obtain $$eqalign{left(binom{5}{(2,2,1)} binom{6}{2} binom{6-2}{1} + binom{5}{(3,2)} binom{6}{1}binom{6-1}{1} right)6^{-5} &= frac{30(15)(4) + 10(6)(5)}{6^5} \&= frac{2100}{7776}.}$$





              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$


















                2














                2










                2







                $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



                $$binom{n}{k} = frac{n!}{(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 $binom{6}{2}=15$ in the first case and $binom{6-2}{1}=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 $binom{6}{1}=6$ ways for the first to occur and then $binom{6-1}{1}=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 $$binom{5}{mathbf n} = frac{5!}{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: $$binom{5}{(2,2,1,0,0,0)} = frac{5!}{2!2!1!} = 30$$ and $$binom{5}{(3,2,0,0,0,0)} = frac{5!}{3!2!}=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


                4. Add the chances. We obtain $$eqalign{left(binom{5}{(2,2,1)} binom{6}{2} binom{6-2}{1} + binom{5}{(3,2)} binom{6}{1}binom{6-1}{1} right)6^{-5} &= frac{30(15)(4) + 10(6)(5)}{6^5} \&= frac{2100}{7776}.}$$





                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



                $$binom{n}{k} = frac{n!}{(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 $binom{6}{2}=15$ in the first case and $binom{6-2}{1}=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 $binom{6}{1}=6$ ways for the first to occur and then $binom{6-1}{1}=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 $$binom{5}{mathbf n} = frac{5!}{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: $$binom{5}{(2,2,1,0,0,0)} = frac{5!}{2!2!1!} = 30$$ and $$binom{5}{(3,2,0,0,0,0)} = frac{5!}{3!2!}=10.$$ (For convenience we usually don't write the zeros in the multinomial notation.)


                4. Add the chances. We obtain $$eqalign{left(binom{5}{(2,2,1)} binom{6}{2} binom{6-2}{1} + binom{5}{(3,2)} binom{6}{1}binom{6-1}{1} right)6^{-5} &= frac{30(15)(4) + 10(6)(5)}{6^5} \&= frac{2100}{7776}.}$$





                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 May 28 at 18:43









                whuberwhuber

                219k35 gold badges481 silver badges877 bronze badges




                219k35 gold badges481 silver badges877 bronze badges




























                    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 $frac{5}{6}$ chance of both dice showing a different number
                    After 3, there is a $frac{5}{6} frac{4}{6}$ (the $frac{5}{6}$ 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 $frac{6!}{(6-k)! cdot6^k}$ (if you don't see why, put a $frac{6}{6}$ 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 $frac{6!}{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
                      May 28 at 17:04










                    • $begingroup$
                      Thank you, @whuber for helping us get closer to the answer
                      $endgroup$
                      – David
                      May 28 at 17:43
















                    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 $frac{5}{6}$ chance of both dice showing a different number
                    After 3, there is a $frac{5}{6} frac{4}{6}$ (the $frac{5}{6}$ 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 $frac{6!}{(6-k)! cdot6^k}$ (if you don't see why, put a $frac{6}{6}$ 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 $frac{6!}{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
                      May 28 at 17:04










                    • $begingroup$
                      Thank you, @whuber for helping us get closer to the answer
                      $endgroup$
                      – David
                      May 28 at 17:43














                    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 $frac{5}{6}$ chance of both dice showing a different number
                    After 3, there is a $frac{5}{6} frac{4}{6}$ (the $frac{5}{6}$ 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 $frac{6!}{(6-k)! cdot6^k}$ (if you don't see why, put a $frac{6}{6}$ 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 $frac{6!}{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 $frac{5}{6}$ chance of both dice showing a different number
                    After 3, there is a $frac{5}{6} frac{4}{6}$ (the $frac{5}{6}$ 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 $frac{6!}{(6-k)! cdot6^k}$ (if you don't see why, put a $frac{6}{6}$ 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 $frac{6!}{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 May 28 at 16:08

























                    answered May 28 at 15:57









                    DavidDavid

                    1,6781 gold badge1 silver badge12 bronze badges




                    1,6781 gold badge1 silver badge12 bronze badges















                    • $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
                      May 28 at 17:04










                    • $begingroup$
                      Thank you, @whuber for helping us get closer to the answer
                      $endgroup$
                      – David
                      May 28 at 17:43


















                    • $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
                      May 28 at 17:04










                    • $begingroup$
                      Thank you, @whuber for helping us get closer to the answer
                      $endgroup$
                      – David
                      May 28 at 17:43
















                    $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
                    May 28 at 17:04




                    $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
                    May 28 at 17:04












                    $begingroup$
                    Thank you, @whuber for helping us get closer to the answer
                    $endgroup$
                    – David
                    May 28 at 17:43




                    $begingroup$
                    Thank you, @whuber for helping us get closer to the answer
                    $endgroup$
                    – David
                    May 28 at 17:43



















                    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

                    He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

                    Bunad

                    Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum