Probability question about $n$ balls and $n$ boxes
$begingroup$
We have $n$ boxes (numbered from $1$ to $n$) and $n$ balls (also numbered from $1$ to $n$). We put the balls in the boxes randomly, so that each $n^n$ outcome is equally likely.
$(a)$ What is the probability that the first two boxes will be empty?
$(b)$ What is the probability that there will be an empty box?
$(c)$ What is the probability that the first two balls end up in the same box?
For part $(a),$ I computed that the probability is equal to $large left( frac{n-2}{n} right)^n$, since for the first ball we have a probability of the first two boxes ending up empty being equal to $large frac{n-2}{n},$ and the same for the second ball, and so on. So that to find the probability of the first two boxes ending up empty we have to multiply the above.
For part $(b)$, I have computed that the probability of there being an empty box is equal to $large left( frac{n-1}{n} right)^n,$ since the probability of a ball landing in any but one specific box is equal to $largefrac{n-1}{n}.$ And we multiply the above in order to find the desired probability.
For part $(c)$, I have no idea how to proceed. Could you provide a hint, and a hint only?
Is the above reasoning correct? If not, could you point me in the right direction? Thank you in advance.
probability combinatorics
$endgroup$
|
show 1 more comment
$begingroup$
We have $n$ boxes (numbered from $1$ to $n$) and $n$ balls (also numbered from $1$ to $n$). We put the balls in the boxes randomly, so that each $n^n$ outcome is equally likely.
$(a)$ What is the probability that the first two boxes will be empty?
$(b)$ What is the probability that there will be an empty box?
$(c)$ What is the probability that the first two balls end up in the same box?
For part $(a),$ I computed that the probability is equal to $large left( frac{n-2}{n} right)^n$, since for the first ball we have a probability of the first two boxes ending up empty being equal to $large frac{n-2}{n},$ and the same for the second ball, and so on. So that to find the probability of the first two boxes ending up empty we have to multiply the above.
For part $(b)$, I have computed that the probability of there being an empty box is equal to $large left( frac{n-1}{n} right)^n,$ since the probability of a ball landing in any but one specific box is equal to $largefrac{n-1}{n}.$ And we multiply the above in order to find the desired probability.
For part $(c)$, I have no idea how to proceed. Could you provide a hint, and a hint only?
Is the above reasoning correct? If not, could you point me in the right direction? Thank you in advance.
probability combinatorics
$endgroup$
2
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
1
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
1
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
1
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07
|
show 1 more comment
$begingroup$
We have $n$ boxes (numbered from $1$ to $n$) and $n$ balls (also numbered from $1$ to $n$). We put the balls in the boxes randomly, so that each $n^n$ outcome is equally likely.
$(a)$ What is the probability that the first two boxes will be empty?
$(b)$ What is the probability that there will be an empty box?
$(c)$ What is the probability that the first two balls end up in the same box?
For part $(a),$ I computed that the probability is equal to $large left( frac{n-2}{n} right)^n$, since for the first ball we have a probability of the first two boxes ending up empty being equal to $large frac{n-2}{n},$ and the same for the second ball, and so on. So that to find the probability of the first two boxes ending up empty we have to multiply the above.
For part $(b)$, I have computed that the probability of there being an empty box is equal to $large left( frac{n-1}{n} right)^n,$ since the probability of a ball landing in any but one specific box is equal to $largefrac{n-1}{n}.$ And we multiply the above in order to find the desired probability.
For part $(c)$, I have no idea how to proceed. Could you provide a hint, and a hint only?
Is the above reasoning correct? If not, could you point me in the right direction? Thank you in advance.
probability combinatorics
$endgroup$
We have $n$ boxes (numbered from $1$ to $n$) and $n$ balls (also numbered from $1$ to $n$). We put the balls in the boxes randomly, so that each $n^n$ outcome is equally likely.
$(a)$ What is the probability that the first two boxes will be empty?
$(b)$ What is the probability that there will be an empty box?
$(c)$ What is the probability that the first two balls end up in the same box?
For part $(a),$ I computed that the probability is equal to $large left( frac{n-2}{n} right)^n$, since for the first ball we have a probability of the first two boxes ending up empty being equal to $large frac{n-2}{n},$ and the same for the second ball, and so on. So that to find the probability of the first two boxes ending up empty we have to multiply the above.
For part $(b)$, I have computed that the probability of there being an empty box is equal to $large left( frac{n-1}{n} right)^n,$ since the probability of a ball landing in any but one specific box is equal to $largefrac{n-1}{n}.$ And we multiply the above in order to find the desired probability.
For part $(c)$, I have no idea how to proceed. Could you provide a hint, and a hint only?
Is the above reasoning correct? If not, could you point me in the right direction? Thank you in advance.
probability combinatorics
probability combinatorics
edited Feb 9 at 23:01
Gaby Alfonso
asked Jan 31 at 23:24
Gaby AlfonsoGaby Alfonso
1,2001418
1,2001418
2
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
1
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
1
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
1
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07
|
show 1 more comment
2
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
1
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
1
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
1
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07
2
2
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
1
1
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
1
1
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
1
1
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07
|
show 1 more comment
1 Answer
1
active
oldest
votes
$begingroup$
Part (a) looks good.
But (b) does not. Look at the complementary event, that there are no empty boxes. How many ways can that happen?
$endgroup$
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
add a comment |
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%2f3095622%2fprobability-question-about-n-balls-and-n-boxes%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
$begingroup$
Part (a) looks good.
But (b) does not. Look at the complementary event, that there are no empty boxes. How many ways can that happen?
$endgroup$
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
add a comment |
$begingroup$
Part (a) looks good.
But (b) does not. Look at the complementary event, that there are no empty boxes. How many ways can that happen?
$endgroup$
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
add a comment |
$begingroup$
Part (a) looks good.
But (b) does not. Look at the complementary event, that there are no empty boxes. How many ways can that happen?
$endgroup$
Part (a) looks good.
But (b) does not. Look at the complementary event, that there are no empty boxes. How many ways can that happen?
answered Jan 31 at 23:30
kimchi loverkimchi lover
11.7k31229
11.7k31229
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
add a comment |
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
$begingroup$
The probability that there are no empty boxes is $frac{n!}{n^n},$ so that the probability that there is at least one empty box is $1-frac{n!}{n^n},$ right?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:37
1
1
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
$begingroup$
@GabyAlfonso yes, that is now correct.
$endgroup$
– JMoravitz
Jan 31 at 23:47
add a comment |
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%2f3095622%2fprobability-question-about-n-balls-and-n-boxes%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
2
$begingroup$
Would this rephrasing of question c) help you ? "once I put my first ball somewhere what is the pobability that the second one ends up in the same box"
$endgroup$
– Robin Nicole
Jan 31 at 23:36
1
$begingroup$
I will point out that you have your choice as to what to treat your sample space as for different parts of the same problem. Although it is convenient for the first or second parts to treat our sample space as size $n^n$ (the $n$-tuple corresponding to the boxes in which each respective ball is in), it may be much easier to treat the sample space for part (c) as simply $n^2$ (or with careful wording, just $n$) being the ordered pair describing the box in which the first and second ball are in respectively (or even just the distance to right from the first ball to the second modulo $n$)
$endgroup$
– JMoravitz
Jan 31 at 23:50
$begingroup$
@JMoravitz That would reduce the problem to computing the probability of the pair having equal coordinates where the coordinates range from $1$ to $n$, correct?
$endgroup$
– Gaby Alfonso
Jan 31 at 23:58
1
$begingroup$
Effectively, yes.
$endgroup$
– JMoravitz
Feb 1 at 0:01
1
$begingroup$
If you insist on looking at this indirectly, yes that is correct. I find it easier to do it directly however and just say it is $frac{1}{n}$ (which is of course equal to the answer in your comment)
$endgroup$
– JMoravitz
Feb 1 at 0:07