how many time , we can send $n$ object in not correct places
$begingroup$
for example , we have 2 object and 2 place
object A and correct place for A is a
object B and correct place for B is b
we can 1 way to place objects in not correct places .
A in b and B in a . so .
for 3 object and 3 place , we have only 2 way .
for 4 object , we have 9 way .
for n object how many way its be ?
( sorry for my english writting )
combinatorics
edited Jan 17 at 0:03
Key Flex
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
$endgroup$
add a comment |
$begingroup$
for example , we have 2 object and 2 place
object A and correct place for A is a
object B and correct place for B is b
we can 1 way to place objects in not correct places .
A in b and B in a . so .
for 3 object and 3 place , we have only 2 way .
for 4 object , we have 9 way .
for n object how many way its be ?
( sorry for my english writting )
combinatorics
edited Jan 17 at 0:03
Key Flex
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
$endgroup$
3
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43
add a comment |
$begingroup$
for example , we have 2 object and 2 place
object A and correct place for A is a
object B and correct place for B is b
we can 1 way to place objects in not correct places .
A in b and B in a . so .
for 3 object and 3 place , we have only 2 way .
for 4 object , we have 9 way .
for n object how many way its be ?
( sorry for my english writting )
combinatorics
edited Jan 17 at 0:03
Key Flex
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
$endgroup$
for example , we have 2 object and 2 place
object A and correct place for A is a
object B and correct place for B is b
we can 1 way to place objects in not correct places .
A in b and B in a . so .
for 3 object and 3 place , we have only 2 way .
for 4 object , we have 9 way .
for n object how many way its be ?
( sorry for my english writting )
combinatorics
combinatorics
edited Jan 17 at 0:03
Key Flex
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
edited Jan 17 at 0:03
Key Flex
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
edited Jan 17 at 0:03
Key Flex
8,58171233
edited Jan 17 at 0:03
Key Flex
8,58171233
edited Jan 17 at 0:03
Key Flex
8,58171233
8,58171233
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
asked Jan 16 at 23:37
Amin PouladiAmin Pouladi
11
11
3
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43
add a comment |
3
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43
3
3
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43
add a comment |
0
active
oldest
votes
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076431%2fhow-many-time-we-can-send-n-object-in-not-correct-places%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076431%2fhow-many-time-we-can-send-n-object-in-not-correct-places%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
3
$begingroup$
For 4 objects, surely you mean nine ways, not six ways. It sounds to me as though you are referring to derangements. There are $!n$ ways to arrange $n$ objects such that no object is in its "correct" place.
$endgroup$
– JMoravitz
Jan 16 at 23:43