Probability of 5 people choosing a unique person randomly












0














There are 5 people in a circle and on the count of 3 they will all point at someone randomly and simultaneously.They cannot point to themselves.



What is the probability of them all pointing at someone different?





I appreciate this is probably quite a straightforward question for those who know probability.



I can see the total variations is $4^5$.
What I don't know how to work out is how many of these variations give an answer to the problem.










share|cite|improve this question



























    0














    There are 5 people in a circle and on the count of 3 they will all point at someone randomly and simultaneously.They cannot point to themselves.



    What is the probability of them all pointing at someone different?





    I appreciate this is probably quite a straightforward question for those who know probability.



    I can see the total variations is $4^5$.
    What I don't know how to work out is how many of these variations give an answer to the problem.










    share|cite|improve this question

























      0












      0








      0


      1





      There are 5 people in a circle and on the count of 3 they will all point at someone randomly and simultaneously.They cannot point to themselves.



      What is the probability of them all pointing at someone different?





      I appreciate this is probably quite a straightforward question for those who know probability.



      I can see the total variations is $4^5$.
      What I don't know how to work out is how many of these variations give an answer to the problem.










      share|cite|improve this question













      There are 5 people in a circle and on the count of 3 they will all point at someone randomly and simultaneously.They cannot point to themselves.



      What is the probability of them all pointing at someone different?





      I appreciate this is probably quite a straightforward question for those who know probability.



      I can see the total variations is $4^5$.
      What I don't know how to work out is how many of these variations give an answer to the problem.







      probability






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 4 '18 at 9:51









      Ben FranksBen Franks

      261110




      261110






















          2 Answers
          2






          active

          oldest

          votes


















          2














          $D_n$, Derangment is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place.



          What we are looking for would be



          $$frac{D_5}{4^5}=frac{44}{4^5}=frac{11}{4^4}.$$






          share|cite|improve this answer



















          • 1




            It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
            – MoKo19
            Dec 4 '18 at 10:06










          • oops, thanks. i made a mistake.
            – Siong Thye Goh
            Dec 4 '18 at 10:07










          • I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
            – Ben Franks
            Dec 4 '18 at 10:10










          • they cannot point to themselves right?
            – Siong Thye Goh
            Dec 4 '18 at 10:11










          • no, I meant A to B to C etc.
            – Ben Franks
            Dec 4 '18 at 10:20



















          3














          Let us label the people A through E, and let $(A,B)$ mean that A pointed to B.



          In order for everyone to point and be pointed to, we require that the 5 people be divided up into closed loops, for instance $(A,B)(B,C)(C,D)(DA)$ would be a closed loop of 4 members. In a closed loop of $n$ members, there are $(n-1)!$ possible orderings of the loop.



          One possibility is for everyone to be in a 5 member loop. In a 5 member loop, there are $4!=24$ possible ways to divide the people into ordered pairs.



          It is impossible to have a 4 member loop, as that would force the fifth person to be in a loop by himself.



          It is possible to have a 3 member loop and a 2 member loop. There are $frac{5!}{3!2!}=10$ ways of dividing the people into those loops, and for each of those 10 ways, there are 2 ways of ordering the 3 person loop, for a total of 20 possibilities of a 3 member loop and a 2 member loop.



          If we have a 2 member loop, we could either divide the 3 remaining people into a 3 member loop or into at least 2 loops. We already considered the possibility of a 3 and 2 member loop, and dividing 3 people into 2 or more loops would result in having a 1 person loop. Therefore this adds no new possibilities.



          It is impossible to have a 1 member loop.



          Therefore, we found a total of 44 scenarios where each person points to someone else. The probability is $frac{44}{4^5}=frac{11}{256}$






          share|cite|improve this answer























          • +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
            – Ben Franks
            Dec 4 '18 at 10:22











          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%2f3025364%2fprobability-of-5-people-choosing-a-unique-person-randomly%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














          $D_n$, Derangment is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place.



          What we are looking for would be



          $$frac{D_5}{4^5}=frac{44}{4^5}=frac{11}{4^4}.$$






          share|cite|improve this answer



















          • 1




            It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
            – MoKo19
            Dec 4 '18 at 10:06










          • oops, thanks. i made a mistake.
            – Siong Thye Goh
            Dec 4 '18 at 10:07










          • I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
            – Ben Franks
            Dec 4 '18 at 10:10










          • they cannot point to themselves right?
            – Siong Thye Goh
            Dec 4 '18 at 10:11










          • no, I meant A to B to C etc.
            – Ben Franks
            Dec 4 '18 at 10:20
















          2














          $D_n$, Derangment is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place.



          What we are looking for would be



          $$frac{D_5}{4^5}=frac{44}{4^5}=frac{11}{4^4}.$$






          share|cite|improve this answer



















          • 1




            It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
            – MoKo19
            Dec 4 '18 at 10:06










          • oops, thanks. i made a mistake.
            – Siong Thye Goh
            Dec 4 '18 at 10:07










          • I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
            – Ben Franks
            Dec 4 '18 at 10:10










          • they cannot point to themselves right?
            – Siong Thye Goh
            Dec 4 '18 at 10:11










          • no, I meant A to B to C etc.
            – Ben Franks
            Dec 4 '18 at 10:20














          2












          2








          2






          $D_n$, Derangment is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place.



          What we are looking for would be



          $$frac{D_5}{4^5}=frac{44}{4^5}=frac{11}{4^4}.$$






          share|cite|improve this answer














          $D_n$, Derangment is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place.



          What we are looking for would be



          $$frac{D_5}{4^5}=frac{44}{4^5}=frac{11}{4^4}.$$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 4 '18 at 10:07

























          answered Dec 4 '18 at 9:56









          Siong Thye GohSiong Thye Goh

          100k1465117




          100k1465117








          • 1




            It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
            – MoKo19
            Dec 4 '18 at 10:06










          • oops, thanks. i made a mistake.
            – Siong Thye Goh
            Dec 4 '18 at 10:07










          • I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
            – Ben Franks
            Dec 4 '18 at 10:10










          • they cannot point to themselves right?
            – Siong Thye Goh
            Dec 4 '18 at 10:11










          • no, I meant A to B to C etc.
            – Ben Franks
            Dec 4 '18 at 10:20














          • 1




            It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
            – MoKo19
            Dec 4 '18 at 10:06










          • oops, thanks. i made a mistake.
            – Siong Thye Goh
            Dec 4 '18 at 10:07










          • I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
            – Ben Franks
            Dec 4 '18 at 10:10










          • they cannot point to themselves right?
            – Siong Thye Goh
            Dec 4 '18 at 10:11










          • no, I meant A to B to C etc.
            – Ben Franks
            Dec 4 '18 at 10:20








          1




          1




          It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
          – MoKo19
          Dec 4 '18 at 10:06




          It should be $frac{11}{4^4}$, not $frac{11}{4^6}$
          – MoKo19
          Dec 4 '18 at 10:06












          oops, thanks. i made a mistake.
          – Siong Thye Goh
          Dec 4 '18 at 10:07




          oops, thanks. i made a mistake.
          – Siong Thye Goh
          Dec 4 '18 at 10:07












          I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
          – Ben Franks
          Dec 4 '18 at 10:10




          I have been trying to wrap my head around this derangement and how it applies to this problem. My issue is that the order is allowed to be natural though. ABCDE is a possible answer.
          – Ben Franks
          Dec 4 '18 at 10:10












          they cannot point to themselves right?
          – Siong Thye Goh
          Dec 4 '18 at 10:11




          they cannot point to themselves right?
          – Siong Thye Goh
          Dec 4 '18 at 10:11












          no, I meant A to B to C etc.
          – Ben Franks
          Dec 4 '18 at 10:20




          no, I meant A to B to C etc.
          – Ben Franks
          Dec 4 '18 at 10:20











          3














          Let us label the people A through E, and let $(A,B)$ mean that A pointed to B.



          In order for everyone to point and be pointed to, we require that the 5 people be divided up into closed loops, for instance $(A,B)(B,C)(C,D)(DA)$ would be a closed loop of 4 members. In a closed loop of $n$ members, there are $(n-1)!$ possible orderings of the loop.



          One possibility is for everyone to be in a 5 member loop. In a 5 member loop, there are $4!=24$ possible ways to divide the people into ordered pairs.



          It is impossible to have a 4 member loop, as that would force the fifth person to be in a loop by himself.



          It is possible to have a 3 member loop and a 2 member loop. There are $frac{5!}{3!2!}=10$ ways of dividing the people into those loops, and for each of those 10 ways, there are 2 ways of ordering the 3 person loop, for a total of 20 possibilities of a 3 member loop and a 2 member loop.



          If we have a 2 member loop, we could either divide the 3 remaining people into a 3 member loop or into at least 2 loops. We already considered the possibility of a 3 and 2 member loop, and dividing 3 people into 2 or more loops would result in having a 1 person loop. Therefore this adds no new possibilities.



          It is impossible to have a 1 member loop.



          Therefore, we found a total of 44 scenarios where each person points to someone else. The probability is $frac{44}{4^5}=frac{11}{256}$






          share|cite|improve this answer























          • +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
            – Ben Franks
            Dec 4 '18 at 10:22
















          3














          Let us label the people A through E, and let $(A,B)$ mean that A pointed to B.



          In order for everyone to point and be pointed to, we require that the 5 people be divided up into closed loops, for instance $(A,B)(B,C)(C,D)(DA)$ would be a closed loop of 4 members. In a closed loop of $n$ members, there are $(n-1)!$ possible orderings of the loop.



          One possibility is for everyone to be in a 5 member loop. In a 5 member loop, there are $4!=24$ possible ways to divide the people into ordered pairs.



          It is impossible to have a 4 member loop, as that would force the fifth person to be in a loop by himself.



          It is possible to have a 3 member loop and a 2 member loop. There are $frac{5!}{3!2!}=10$ ways of dividing the people into those loops, and for each of those 10 ways, there are 2 ways of ordering the 3 person loop, for a total of 20 possibilities of a 3 member loop and a 2 member loop.



          If we have a 2 member loop, we could either divide the 3 remaining people into a 3 member loop or into at least 2 loops. We already considered the possibility of a 3 and 2 member loop, and dividing 3 people into 2 or more loops would result in having a 1 person loop. Therefore this adds no new possibilities.



          It is impossible to have a 1 member loop.



          Therefore, we found a total of 44 scenarios where each person points to someone else. The probability is $frac{44}{4^5}=frac{11}{256}$






          share|cite|improve this answer























          • +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
            – Ben Franks
            Dec 4 '18 at 10:22














          3












          3








          3






          Let us label the people A through E, and let $(A,B)$ mean that A pointed to B.



          In order for everyone to point and be pointed to, we require that the 5 people be divided up into closed loops, for instance $(A,B)(B,C)(C,D)(DA)$ would be a closed loop of 4 members. In a closed loop of $n$ members, there are $(n-1)!$ possible orderings of the loop.



          One possibility is for everyone to be in a 5 member loop. In a 5 member loop, there are $4!=24$ possible ways to divide the people into ordered pairs.



          It is impossible to have a 4 member loop, as that would force the fifth person to be in a loop by himself.



          It is possible to have a 3 member loop and a 2 member loop. There are $frac{5!}{3!2!}=10$ ways of dividing the people into those loops, and for each of those 10 ways, there are 2 ways of ordering the 3 person loop, for a total of 20 possibilities of a 3 member loop and a 2 member loop.



          If we have a 2 member loop, we could either divide the 3 remaining people into a 3 member loop or into at least 2 loops. We already considered the possibility of a 3 and 2 member loop, and dividing 3 people into 2 or more loops would result in having a 1 person loop. Therefore this adds no new possibilities.



          It is impossible to have a 1 member loop.



          Therefore, we found a total of 44 scenarios where each person points to someone else. The probability is $frac{44}{4^5}=frac{11}{256}$






          share|cite|improve this answer














          Let us label the people A through E, and let $(A,B)$ mean that A pointed to B.



          In order for everyone to point and be pointed to, we require that the 5 people be divided up into closed loops, for instance $(A,B)(B,C)(C,D)(DA)$ would be a closed loop of 4 members. In a closed loop of $n$ members, there are $(n-1)!$ possible orderings of the loop.



          One possibility is for everyone to be in a 5 member loop. In a 5 member loop, there are $4!=24$ possible ways to divide the people into ordered pairs.



          It is impossible to have a 4 member loop, as that would force the fifth person to be in a loop by himself.



          It is possible to have a 3 member loop and a 2 member loop. There are $frac{5!}{3!2!}=10$ ways of dividing the people into those loops, and for each of those 10 ways, there are 2 ways of ordering the 3 person loop, for a total of 20 possibilities of a 3 member loop and a 2 member loop.



          If we have a 2 member loop, we could either divide the 3 remaining people into a 3 member loop or into at least 2 loops. We already considered the possibility of a 3 and 2 member loop, and dividing 3 people into 2 or more loops would result in having a 1 person loop. Therefore this adds no new possibilities.



          It is impossible to have a 1 member loop.



          Therefore, we found a total of 44 scenarios where each person points to someone else. The probability is $frac{44}{4^5}=frac{11}{256}$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 4 '18 at 10:20

























          answered Dec 4 '18 at 10:04









          MoKo19MoKo19

          1914




          1914












          • +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
            – Ben Franks
            Dec 4 '18 at 10:22


















          • +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
            – Ben Franks
            Dec 4 '18 at 10:22
















          +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
          – Ben Franks
          Dec 4 '18 at 10:22




          +1 thanks for the answer. Given answer to Siong Thye Goh as he answered first.
          – Ben Franks
          Dec 4 '18 at 10:22


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025364%2fprobability-of-5-people-choosing-a-unique-person-randomly%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