Probability of Increasing Sequence of Die Rolls Remaining Increasing












0














Context



I was talking with a friend about this simple problem and we couldn't figure it out easily. I spent a little while with paper and pen and googled a bit and checked previous questions but have not been successful finding a solution. I think I am missing some language/terms.



Problem



Let $D_i$ be the $i$th outcome of a 20-sided die event. That is, $D_iin[1,20]$. What is the probability that $D_1<D_2<D_3$ for three sequential die events?



Scratch Work



My pen & paper work thus far (I feel like I am abusing notation):



$P(D_1)=1$. $P(D_2>D_1)=frac{20-D_1}{20}$. $P(D_3>D_2)=frac{20-D_2}{20}$.



$P(D_1<D_2<D_3)=P(D_1)P(D_2>D_1)P(D_3>D_2)=(1)(frac{20-D_1}{20})(frac{20-D_2}{20})=1-frac{D_1+D_2}{20}+frac{D_1D_2}{400}$.



$D_1+D_2in[2,40]$; $D_1D_2stackrel{?}{in}[1,400]$.



Closing



I know that I am doing something gravely wrong and I want to know what it is. All help appreciated, especially generalizations.










share|cite|improve this question






















  • You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
    – platty
    Nov 28 at 3:09
















0














Context



I was talking with a friend about this simple problem and we couldn't figure it out easily. I spent a little while with paper and pen and googled a bit and checked previous questions but have not been successful finding a solution. I think I am missing some language/terms.



Problem



Let $D_i$ be the $i$th outcome of a 20-sided die event. That is, $D_iin[1,20]$. What is the probability that $D_1<D_2<D_3$ for three sequential die events?



Scratch Work



My pen & paper work thus far (I feel like I am abusing notation):



$P(D_1)=1$. $P(D_2>D_1)=frac{20-D_1}{20}$. $P(D_3>D_2)=frac{20-D_2}{20}$.



$P(D_1<D_2<D_3)=P(D_1)P(D_2>D_1)P(D_3>D_2)=(1)(frac{20-D_1}{20})(frac{20-D_2}{20})=1-frac{D_1+D_2}{20}+frac{D_1D_2}{400}$.



$D_1+D_2in[2,40]$; $D_1D_2stackrel{?}{in}[1,400]$.



Closing



I know that I am doing something gravely wrong and I want to know what it is. All help appreciated, especially generalizations.










share|cite|improve this question






















  • You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
    – platty
    Nov 28 at 3:09














0












0








0







Context



I was talking with a friend about this simple problem and we couldn't figure it out easily. I spent a little while with paper and pen and googled a bit and checked previous questions but have not been successful finding a solution. I think I am missing some language/terms.



Problem



Let $D_i$ be the $i$th outcome of a 20-sided die event. That is, $D_iin[1,20]$. What is the probability that $D_1<D_2<D_3$ for three sequential die events?



Scratch Work



My pen & paper work thus far (I feel like I am abusing notation):



$P(D_1)=1$. $P(D_2>D_1)=frac{20-D_1}{20}$. $P(D_3>D_2)=frac{20-D_2}{20}$.



$P(D_1<D_2<D_3)=P(D_1)P(D_2>D_1)P(D_3>D_2)=(1)(frac{20-D_1}{20})(frac{20-D_2}{20})=1-frac{D_1+D_2}{20}+frac{D_1D_2}{400}$.



$D_1+D_2in[2,40]$; $D_1D_2stackrel{?}{in}[1,400]$.



Closing



I know that I am doing something gravely wrong and I want to know what it is. All help appreciated, especially generalizations.










share|cite|improve this question













Context



I was talking with a friend about this simple problem and we couldn't figure it out easily. I spent a little while with paper and pen and googled a bit and checked previous questions but have not been successful finding a solution. I think I am missing some language/terms.



Problem



Let $D_i$ be the $i$th outcome of a 20-sided die event. That is, $D_iin[1,20]$. What is the probability that $D_1<D_2<D_3$ for three sequential die events?



Scratch Work



My pen & paper work thus far (I feel like I am abusing notation):



$P(D_1)=1$. $P(D_2>D_1)=frac{20-D_1}{20}$. $P(D_3>D_2)=frac{20-D_2}{20}$.



$P(D_1<D_2<D_3)=P(D_1)P(D_2>D_1)P(D_3>D_2)=(1)(frac{20-D_1}{20})(frac{20-D_2}{20})=1-frac{D_1+D_2}{20}+frac{D_1D_2}{400}$.



$D_1+D_2in[2,40]$; $D_1D_2stackrel{?}{in}[1,400]$.



Closing



I know that I am doing something gravely wrong and I want to know what it is. All help appreciated, especially generalizations.







probability conditional-probability






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 28 at 3:02









Dohleman

309110




309110












  • You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
    – platty
    Nov 28 at 3:09


















  • You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
    – platty
    Nov 28 at 3:09
















You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
– platty
Nov 28 at 3:09




You need to sum over all valid pairs of $D_1,D_2$, but otherwise I think this approach works.
– platty
Nov 28 at 3:09










3 Answers
3






active

oldest

votes


















2














Hint: Partition over the middle value:
$$begin{align}mathsf P(D_1<D_2<D_3)&=sum_{t=2}^{19}mathsf P(D_1<t)mathsf P(D_2=t)mathsf P(D_3>t)\[1ex]&=sum_{t=2}^{19}dfrac{(t-1)(20-t)}{20^3}end{align}$$






share|cite|improve this answer





















  • this is the style of solution i was looking for, thank you
    – Dohleman
    Nov 28 at 3:16



















2














Note that, if all three rolls are distinct, there is a $frac{1}{3!}$ chance they come in increasing order (if they are not distinct, there is no chance). The probability of at least two of them matching is $3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3}$ (splitting into cases where exactly 2 match and all 3 match). The desired probability is then $dfrac{1}{6} times left( 1 - left( 3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3} right) right) = boxed{dfrac{57}{400}}$.






share|cite|improve this answer





















  • this is a clever solution that I also appreciate
    – Dohleman
    Nov 28 at 3:16



















2














$$ P(mbox{Increasing}) = P(mbox{Increasing}|mbox{All distinct})P(mbox{All distinct})$$



$$P(mbox{All distinct})=frac{20*19*18}{20*20*20}= frac{19*9}{200}.$$



As argued above,
$$ P(mbox{Increasing}|mbox{All distinct}) = frac{1}{3!}.$$



Therefore, the answer is $$ frac{19*9}{200} times frac{1}{6} = frac{57}{400}.$$






share|cite|improve this answer





















    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    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%2f3016642%2fprobability-of-increasing-sequence-of-die-rolls-remaining-increasing%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2














    Hint: Partition over the middle value:
    $$begin{align}mathsf P(D_1<D_2<D_3)&=sum_{t=2}^{19}mathsf P(D_1<t)mathsf P(D_2=t)mathsf P(D_3>t)\[1ex]&=sum_{t=2}^{19}dfrac{(t-1)(20-t)}{20^3}end{align}$$






    share|cite|improve this answer





















    • this is the style of solution i was looking for, thank you
      – Dohleman
      Nov 28 at 3:16
















    2














    Hint: Partition over the middle value:
    $$begin{align}mathsf P(D_1<D_2<D_3)&=sum_{t=2}^{19}mathsf P(D_1<t)mathsf P(D_2=t)mathsf P(D_3>t)\[1ex]&=sum_{t=2}^{19}dfrac{(t-1)(20-t)}{20^3}end{align}$$






    share|cite|improve this answer





















    • this is the style of solution i was looking for, thank you
      – Dohleman
      Nov 28 at 3:16














    2












    2








    2






    Hint: Partition over the middle value:
    $$begin{align}mathsf P(D_1<D_2<D_3)&=sum_{t=2}^{19}mathsf P(D_1<t)mathsf P(D_2=t)mathsf P(D_3>t)\[1ex]&=sum_{t=2}^{19}dfrac{(t-1)(20-t)}{20^3}end{align}$$






    share|cite|improve this answer












    Hint: Partition over the middle value:
    $$begin{align}mathsf P(D_1<D_2<D_3)&=sum_{t=2}^{19}mathsf P(D_1<t)mathsf P(D_2=t)mathsf P(D_3>t)\[1ex]&=sum_{t=2}^{19}dfrac{(t-1)(20-t)}{20^3}end{align}$$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 28 at 3:13









    Graham Kemp

    84.7k43378




    84.7k43378












    • this is the style of solution i was looking for, thank you
      – Dohleman
      Nov 28 at 3:16


















    • this is the style of solution i was looking for, thank you
      – Dohleman
      Nov 28 at 3:16
















    this is the style of solution i was looking for, thank you
    – Dohleman
    Nov 28 at 3:16




    this is the style of solution i was looking for, thank you
    – Dohleman
    Nov 28 at 3:16











    2














    Note that, if all three rolls are distinct, there is a $frac{1}{3!}$ chance they come in increasing order (if they are not distinct, there is no chance). The probability of at least two of them matching is $3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3}$ (splitting into cases where exactly 2 match and all 3 match). The desired probability is then $dfrac{1}{6} times left( 1 - left( 3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3} right) right) = boxed{dfrac{57}{400}}$.






    share|cite|improve this answer





















    • this is a clever solution that I also appreciate
      – Dohleman
      Nov 28 at 3:16
















    2














    Note that, if all three rolls are distinct, there is a $frac{1}{3!}$ chance they come in increasing order (if they are not distinct, there is no chance). The probability of at least two of them matching is $3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3}$ (splitting into cases where exactly 2 match and all 3 match). The desired probability is then $dfrac{1}{6} times left( 1 - left( 3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3} right) right) = boxed{dfrac{57}{400}}$.






    share|cite|improve this answer





















    • this is a clever solution that I also appreciate
      – Dohleman
      Nov 28 at 3:16














    2












    2








    2






    Note that, if all three rolls are distinct, there is a $frac{1}{3!}$ chance they come in increasing order (if they are not distinct, there is no chance). The probability of at least two of them matching is $3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3}$ (splitting into cases where exactly 2 match and all 3 match). The desired probability is then $dfrac{1}{6} times left( 1 - left( 3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3} right) right) = boxed{dfrac{57}{400}}$.






    share|cite|improve this answer












    Note that, if all three rolls are distinct, there is a $frac{1}{3!}$ chance they come in increasing order (if they are not distinct, there is no chance). The probability of at least two of them matching is $3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3}$ (splitting into cases where exactly 2 match and all 3 match). The desired probability is then $dfrac{1}{6} times left( 1 - left( 3 times dfrac{1}{20} times dfrac{19}{20} + 20 times dfrac{1}{20^3} right) right) = boxed{dfrac{57}{400}}$.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 28 at 3:13









    platty

    3,360320




    3,360320












    • this is a clever solution that I also appreciate
      – Dohleman
      Nov 28 at 3:16


















    • this is a clever solution that I also appreciate
      – Dohleman
      Nov 28 at 3:16
















    this is a clever solution that I also appreciate
    – Dohleman
    Nov 28 at 3:16




    this is a clever solution that I also appreciate
    – Dohleman
    Nov 28 at 3:16











    2














    $$ P(mbox{Increasing}) = P(mbox{Increasing}|mbox{All distinct})P(mbox{All distinct})$$



    $$P(mbox{All distinct})=frac{20*19*18}{20*20*20}= frac{19*9}{200}.$$



    As argued above,
    $$ P(mbox{Increasing}|mbox{All distinct}) = frac{1}{3!}.$$



    Therefore, the answer is $$ frac{19*9}{200} times frac{1}{6} = frac{57}{400}.$$






    share|cite|improve this answer


























      2














      $$ P(mbox{Increasing}) = P(mbox{Increasing}|mbox{All distinct})P(mbox{All distinct})$$



      $$P(mbox{All distinct})=frac{20*19*18}{20*20*20}= frac{19*9}{200}.$$



      As argued above,
      $$ P(mbox{Increasing}|mbox{All distinct}) = frac{1}{3!}.$$



      Therefore, the answer is $$ frac{19*9}{200} times frac{1}{6} = frac{57}{400}.$$






      share|cite|improve this answer
























        2












        2








        2






        $$ P(mbox{Increasing}) = P(mbox{Increasing}|mbox{All distinct})P(mbox{All distinct})$$



        $$P(mbox{All distinct})=frac{20*19*18}{20*20*20}= frac{19*9}{200}.$$



        As argued above,
        $$ P(mbox{Increasing}|mbox{All distinct}) = frac{1}{3!}.$$



        Therefore, the answer is $$ frac{19*9}{200} times frac{1}{6} = frac{57}{400}.$$






        share|cite|improve this answer












        $$ P(mbox{Increasing}) = P(mbox{Increasing}|mbox{All distinct})P(mbox{All distinct})$$



        $$P(mbox{All distinct})=frac{20*19*18}{20*20*20}= frac{19*9}{200}.$$



        As argued above,
        $$ P(mbox{Increasing}|mbox{All distinct}) = frac{1}{3!}.$$



        Therefore, the answer is $$ frac{19*9}{200} times frac{1}{6} = frac{57}{400}.$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 28 at 3:54









        Fnacool

        4,966511




        4,966511






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3016642%2fprobability-of-increasing-sequence-of-die-rolls-remaining-increasing%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

            Wiesbaden

            Marschland

            Dieringhausen