Combinatorics problem Algebra











up vote
0
down vote

favorite
1












Four friends have four different balls and they decide to swap them so that everyone has a different ball. How many possible combinations are there?
I know they are $9$: $2, 1, 4, 3 - 2, 3, 4, 1 - 2, 4, 1, 3 - 3, 1, 4, 2 -
3, 4, 1, 2 - 3, 4, 2, 1 - 4, 1, 2, 3 - 4, 3, 1, 2 - 4, 3, 2, 1$
but how can i calculate them without writing them down?










share|cite|improve this question






















  • You mean noone has his own ball?
    – greedoid
    Nov 18 at 10:11










  • Yes, not the one that he had at the start
    – Sdwae
    Nov 18 at 10:13















up vote
0
down vote

favorite
1












Four friends have four different balls and they decide to swap them so that everyone has a different ball. How many possible combinations are there?
I know they are $9$: $2, 1, 4, 3 - 2, 3, 4, 1 - 2, 4, 1, 3 - 3, 1, 4, 2 -
3, 4, 1, 2 - 3, 4, 2, 1 - 4, 1, 2, 3 - 4, 3, 1, 2 - 4, 3, 2, 1$
but how can i calculate them without writing them down?










share|cite|improve this question






















  • You mean noone has his own ball?
    – greedoid
    Nov 18 at 10:11










  • Yes, not the one that he had at the start
    – Sdwae
    Nov 18 at 10:13













up vote
0
down vote

favorite
1









up vote
0
down vote

favorite
1






1





Four friends have four different balls and they decide to swap them so that everyone has a different ball. How many possible combinations are there?
I know they are $9$: $2, 1, 4, 3 - 2, 3, 4, 1 - 2, 4, 1, 3 - 3, 1, 4, 2 -
3, 4, 1, 2 - 3, 4, 2, 1 - 4, 1, 2, 3 - 4, 3, 1, 2 - 4, 3, 2, 1$
but how can i calculate them without writing them down?










share|cite|improve this question













Four friends have four different balls and they decide to swap them so that everyone has a different ball. How many possible combinations are there?
I know they are $9$: $2, 1, 4, 3 - 2, 3, 4, 1 - 2, 4, 1, 3 - 3, 1, 4, 2 -
3, 4, 1, 2 - 3, 4, 2, 1 - 4, 1, 2, 3 - 4, 3, 1, 2 - 4, 3, 2, 1$
but how can i calculate them without writing them down?







combinatorics






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 18 at 10:08









Sdwae

52




52












  • You mean noone has his own ball?
    – greedoid
    Nov 18 at 10:11










  • Yes, not the one that he had at the start
    – Sdwae
    Nov 18 at 10:13


















  • You mean noone has his own ball?
    – greedoid
    Nov 18 at 10:11










  • Yes, not the one that he had at the start
    – Sdwae
    Nov 18 at 10:13
















You mean noone has his own ball?
– greedoid
Nov 18 at 10:11




You mean noone has his own ball?
– greedoid
Nov 18 at 10:11












Yes, not the one that he had at the start
– Sdwae
Nov 18 at 10:13




Yes, not the one that he had at the start
– Sdwae
Nov 18 at 10:13










1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










These are called derangements and have been well studied. For any $n$ there are $$
n!Sigma_{i=0}^nfrac{(-1)^i}{i!}
$$






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',
    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%2f3003342%2fcombinatorics-problem-algebra%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








    up vote
    1
    down vote



    accepted










    These are called derangements and have been well studied. For any $n$ there are $$
    n!Sigma_{i=0}^nfrac{(-1)^i}{i!}
    $$






    share|cite|improve this answer

























      up vote
      1
      down vote



      accepted










      These are called derangements and have been well studied. For any $n$ there are $$
      n!Sigma_{i=0}^nfrac{(-1)^i}{i!}
      $$






      share|cite|improve this answer























        up vote
        1
        down vote



        accepted







        up vote
        1
        down vote



        accepted






        These are called derangements and have been well studied. For any $n$ there are $$
        n!Sigma_{i=0}^nfrac{(-1)^i}{i!}
        $$






        share|cite|improve this answer












        These are called derangements and have been well studied. For any $n$ there are $$
        n!Sigma_{i=0}^nfrac{(-1)^i}{i!}
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 18 at 10:11









        Joey Kilpatrick

        1,163321




        1,163321






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003342%2fcombinatorics-problem-algebra%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

            Mont Emei

            Province de Neuquén

            Journaliste