Probability Question - A large number, $N$ , people go to a convention at a hotel. Each person is assigned...












3












$begingroup$


A large number, $N$, people go to a convention at a hotel. Each person is assigned one of $N$ hotel rooms. The go to a party, but before they had their key to a doorman. On the way out of the party, the doorman hands the keys back at random, what is the probability that at least one person is given his/her original key.



The general equation I have worked out should be



$$P(X>=1) = 1 - P(X=0)$$



$$P(X=0) = (1-(1/N))^N$$



Adding up all the probabilities that one person gets the right key. I have checked with the answer key and this is a solution. However, it does not work for the case where $N = 2$.



The probability that at least one person gets the right key should be $50% $ ,but this equation returns $75%$ . Can anyone explain what logical error I am making?










share|cite|improve this question











$endgroup$








  • 7




    $begingroup$
    Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
    $endgroup$
    – lulu
    Jan 3 at 16:11












  • $begingroup$
    @lulu Please turn your comment into an answer.
    $endgroup$
    – leonbloy
    Jan 4 at 3:34
















3












$begingroup$


A large number, $N$, people go to a convention at a hotel. Each person is assigned one of $N$ hotel rooms. The go to a party, but before they had their key to a doorman. On the way out of the party, the doorman hands the keys back at random, what is the probability that at least one person is given his/her original key.



The general equation I have worked out should be



$$P(X>=1) = 1 - P(X=0)$$



$$P(X=0) = (1-(1/N))^N$$



Adding up all the probabilities that one person gets the right key. I have checked with the answer key and this is a solution. However, it does not work for the case where $N = 2$.



The probability that at least one person gets the right key should be $50% $ ,but this equation returns $75%$ . Can anyone explain what logical error I am making?










share|cite|improve this question











$endgroup$








  • 7




    $begingroup$
    Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
    $endgroup$
    – lulu
    Jan 3 at 16:11












  • $begingroup$
    @lulu Please turn your comment into an answer.
    $endgroup$
    – leonbloy
    Jan 4 at 3:34














3












3








3





$begingroup$


A large number, $N$, people go to a convention at a hotel. Each person is assigned one of $N$ hotel rooms. The go to a party, but before they had their key to a doorman. On the way out of the party, the doorman hands the keys back at random, what is the probability that at least one person is given his/her original key.



The general equation I have worked out should be



$$P(X>=1) = 1 - P(X=0)$$



$$P(X=0) = (1-(1/N))^N$$



Adding up all the probabilities that one person gets the right key. I have checked with the answer key and this is a solution. However, it does not work for the case where $N = 2$.



The probability that at least one person gets the right key should be $50% $ ,but this equation returns $75%$ . Can anyone explain what logical error I am making?










share|cite|improve this question











$endgroup$




A large number, $N$, people go to a convention at a hotel. Each person is assigned one of $N$ hotel rooms. The go to a party, but before they had their key to a doorman. On the way out of the party, the doorman hands the keys back at random, what is the probability that at least one person is given his/her original key.



The general equation I have worked out should be



$$P(X>=1) = 1 - P(X=0)$$



$$P(X=0) = (1-(1/N))^N$$



Adding up all the probabilities that one person gets the right key. I have checked with the answer key and this is a solution. However, it does not work for the case where $N = 2$.



The probability that at least one person gets the right key should be $50% $ ,but this equation returns $75%$ . Can anyone explain what logical error I am making?







probability discrete-mathematics contest-math






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 3 at 17:11









dmtri

1,4522521




1,4522521










asked Jan 3 at 16:08









BlankQQBlankQQ

211




211








  • 7




    $begingroup$
    Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
    $endgroup$
    – lulu
    Jan 3 at 16:11












  • $begingroup$
    @lulu Please turn your comment into an answer.
    $endgroup$
    – leonbloy
    Jan 4 at 3:34














  • 7




    $begingroup$
    Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
    $endgroup$
    – lulu
    Jan 3 at 16:11












  • $begingroup$
    @lulu Please turn your comment into an answer.
    $endgroup$
    – leonbloy
    Jan 4 at 3:34








7




7




$begingroup$
Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
$endgroup$
– lulu
Jan 3 at 16:11






$begingroup$
Your method is not correct as the events you consider are dependent. With two people, say, knowing that the first one got the wrong key implies the second one did as well. The relevant concept is Derangements.
$endgroup$
– lulu
Jan 3 at 16:11














$begingroup$
@lulu Please turn your comment into an answer.
$endgroup$
– leonbloy
Jan 4 at 3:34




$begingroup$
@lulu Please turn your comment into an answer.
$endgroup$
– leonbloy
Jan 4 at 3:34










1 Answer
1






active

oldest

votes


















0












$begingroup$

The error in your method lies in the fact that you treat "$A$ getting the wrong key " and "$B$ getting the wrong key" as independent events. They aren't. For instance, if you only have two people then knowing that the first one gets the wrong key makes it certain that the second also gets the wrong key.



To solve the problem, use Derangements. The keys people are given can be thought of as a permutation of the names, so your question becomes "what is the probability that a (uniformly) randomly chosen permutation is a derangement?" for which the answer is clearly $$frac {!n}{n!}$$



Note that for large $n$ this approaches $frac 1e$ so, again for large $n$, the numerical probability is about $36.79%$






share|cite|improve this answer









$endgroup$













    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%2f3060725%2fprobability-question-a-large-number-n-people-go-to-a-convention-at-a-hote%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    The error in your method lies in the fact that you treat "$A$ getting the wrong key " and "$B$ getting the wrong key" as independent events. They aren't. For instance, if you only have two people then knowing that the first one gets the wrong key makes it certain that the second also gets the wrong key.



    To solve the problem, use Derangements. The keys people are given can be thought of as a permutation of the names, so your question becomes "what is the probability that a (uniformly) randomly chosen permutation is a derangement?" for which the answer is clearly $$frac {!n}{n!}$$



    Note that for large $n$ this approaches $frac 1e$ so, again for large $n$, the numerical probability is about $36.79%$






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      The error in your method lies in the fact that you treat "$A$ getting the wrong key " and "$B$ getting the wrong key" as independent events. They aren't. For instance, if you only have two people then knowing that the first one gets the wrong key makes it certain that the second also gets the wrong key.



      To solve the problem, use Derangements. The keys people are given can be thought of as a permutation of the names, so your question becomes "what is the probability that a (uniformly) randomly chosen permutation is a derangement?" for which the answer is clearly $$frac {!n}{n!}$$



      Note that for large $n$ this approaches $frac 1e$ so, again for large $n$, the numerical probability is about $36.79%$






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        The error in your method lies in the fact that you treat "$A$ getting the wrong key " and "$B$ getting the wrong key" as independent events. They aren't. For instance, if you only have two people then knowing that the first one gets the wrong key makes it certain that the second also gets the wrong key.



        To solve the problem, use Derangements. The keys people are given can be thought of as a permutation of the names, so your question becomes "what is the probability that a (uniformly) randomly chosen permutation is a derangement?" for which the answer is clearly $$frac {!n}{n!}$$



        Note that for large $n$ this approaches $frac 1e$ so, again for large $n$, the numerical probability is about $36.79%$






        share|cite|improve this answer









        $endgroup$



        The error in your method lies in the fact that you treat "$A$ getting the wrong key " and "$B$ getting the wrong key" as independent events. They aren't. For instance, if you only have two people then knowing that the first one gets the wrong key makes it certain that the second also gets the wrong key.



        To solve the problem, use Derangements. The keys people are given can be thought of as a permutation of the names, so your question becomes "what is the probability that a (uniformly) randomly chosen permutation is a derangement?" for which the answer is clearly $$frac {!n}{n!}$$



        Note that for large $n$ this approaches $frac 1e$ so, again for large $n$, the numerical probability is about $36.79%$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 4 at 10:51









        lulululu

        39.7k24677




        39.7k24677






























            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%2f3060725%2fprobability-question-a-large-number-n-people-go-to-a-convention-at-a-hote%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

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

            A Topological Invariant for $pi_3(U(n))$