There is a bag of 8 candies, and 3 are chocolates. You eat candy until the chocolates are gone. What is the...
$begingroup$
You buy a bag of $8$ candies, of which $3$ are chocolates, but all candies look alike. You eat candies from the bag until you have eaten all three chocolates. What is the probability you will have eaten exactly $7$ of the candies in the bag?
probability statistics
New contributor
$endgroup$
add a comment |
$begingroup$
You buy a bag of $8$ candies, of which $3$ are chocolates, but all candies look alike. You eat candies from the bag until you have eaten all three chocolates. What is the probability you will have eaten exactly $7$ of the candies in the bag?
probability statistics
New contributor
$endgroup$
1
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago
add a comment |
$begingroup$
You buy a bag of $8$ candies, of which $3$ are chocolates, but all candies look alike. You eat candies from the bag until you have eaten all three chocolates. What is the probability you will have eaten exactly $7$ of the candies in the bag?
probability statistics
New contributor
$endgroup$
You buy a bag of $8$ candies, of which $3$ are chocolates, but all candies look alike. You eat candies from the bag until you have eaten all three chocolates. What is the probability you will have eaten exactly $7$ of the candies in the bag?
probability statistics
probability statistics
New contributor
New contributor
edited 3 hours ago
dantopa
6,53942244
6,53942244
New contributor
asked 3 hours ago
The RangsterThe Rangster
111
111
New contributor
New contributor
1
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago
add a comment |
1
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago
1
1
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
A particular sequence of picks is just as likely as the same sequence in reverse. But now the question becomes:
What is the probability that the first pick is not a chocolate, and the second pick is?
So the answer is obviously $dfrac{5}{8}timesdfrac{3}{7}$.
$endgroup$
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
add a comment |
$begingroup$
As D.R. pointed out, there must be $2$ chocolates among the first $6$ candies. Choose these $2$ positions in $binom{6}{2}$ ways. The $7^{th}$ position must be a chocolate, so in total, the positions of the chocolates can be chosen in $binom{6}{2}$ ways. Hence, your required probability is $binom{6}{2}/binom{8}{3} = 0.2679$.
$endgroup$
add a comment |
$begingroup$
HINT: if the person stops after the 7th candy, then that one must have been the third chocolate. The other two can be anywhere in the first 6.
If the question is asking “at least 7 candies”, consider the case where the 8th candy is the third chocolate, and sum the two answers together.
$endgroup$
add a comment |
$begingroup$
As others have pointed out, we must select $2$ chocolates and $4$ non-chocolates in the first $6$ selections. The probability that this occurs is
$$frac{{3choose2} {5choose4}}{8choose6}$$
This comes from the hypergeometric distribution. Then there is one chocolate and one non-chocolate remaining so we then select the third chocolate with probability $frac{1}{2}$. Hence the desired probability is
$$frac{{3choose2} {5choose4}}{8choose6}cdotfrac{1}{2}approx0.268$$
$endgroup$
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
});
}
});
The Rangster is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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%2f3126856%2fthere-is-a-bag-of-8-candies-and-3-are-chocolates-you-eat-candy-until-the-choco%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
A particular sequence of picks is just as likely as the same sequence in reverse. But now the question becomes:
What is the probability that the first pick is not a chocolate, and the second pick is?
So the answer is obviously $dfrac{5}{8}timesdfrac{3}{7}$.
$endgroup$
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
add a comment |
$begingroup$
A particular sequence of picks is just as likely as the same sequence in reverse. But now the question becomes:
What is the probability that the first pick is not a chocolate, and the second pick is?
So the answer is obviously $dfrac{5}{8}timesdfrac{3}{7}$.
$endgroup$
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
add a comment |
$begingroup$
A particular sequence of picks is just as likely as the same sequence in reverse. But now the question becomes:
What is the probability that the first pick is not a chocolate, and the second pick is?
So the answer is obviously $dfrac{5}{8}timesdfrac{3}{7}$.
$endgroup$
A particular sequence of picks is just as likely as the same sequence in reverse. But now the question becomes:
What is the probability that the first pick is not a chocolate, and the second pick is?
So the answer is obviously $dfrac{5}{8}timesdfrac{3}{7}$.
answered 2 hours ago
TonyKTonyK
42.8k355134
42.8k355134
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
add a comment |
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
$begingroup$
This is a clever way of approaching this!
$endgroup$
– Remy
1 hour ago
add a comment |
$begingroup$
As D.R. pointed out, there must be $2$ chocolates among the first $6$ candies. Choose these $2$ positions in $binom{6}{2}$ ways. The $7^{th}$ position must be a chocolate, so in total, the positions of the chocolates can be chosen in $binom{6}{2}$ ways. Hence, your required probability is $binom{6}{2}/binom{8}{3} = 0.2679$.
$endgroup$
add a comment |
$begingroup$
As D.R. pointed out, there must be $2$ chocolates among the first $6$ candies. Choose these $2$ positions in $binom{6}{2}$ ways. The $7^{th}$ position must be a chocolate, so in total, the positions of the chocolates can be chosen in $binom{6}{2}$ ways. Hence, your required probability is $binom{6}{2}/binom{8}{3} = 0.2679$.
$endgroup$
add a comment |
$begingroup$
As D.R. pointed out, there must be $2$ chocolates among the first $6$ candies. Choose these $2$ positions in $binom{6}{2}$ ways. The $7^{th}$ position must be a chocolate, so in total, the positions of the chocolates can be chosen in $binom{6}{2}$ ways. Hence, your required probability is $binom{6}{2}/binom{8}{3} = 0.2679$.
$endgroup$
As D.R. pointed out, there must be $2$ chocolates among the first $6$ candies. Choose these $2$ positions in $binom{6}{2}$ ways. The $7^{th}$ position must be a chocolate, so in total, the positions of the chocolates can be chosen in $binom{6}{2}$ ways. Hence, your required probability is $binom{6}{2}/binom{8}{3} = 0.2679$.
answered 3 hours ago
abcdabcd
1188
1188
add a comment |
add a comment |
$begingroup$
HINT: if the person stops after the 7th candy, then that one must have been the third chocolate. The other two can be anywhere in the first 6.
If the question is asking “at least 7 candies”, consider the case where the 8th candy is the third chocolate, and sum the two answers together.
$endgroup$
add a comment |
$begingroup$
HINT: if the person stops after the 7th candy, then that one must have been the third chocolate. The other two can be anywhere in the first 6.
If the question is asking “at least 7 candies”, consider the case where the 8th candy is the third chocolate, and sum the two answers together.
$endgroup$
add a comment |
$begingroup$
HINT: if the person stops after the 7th candy, then that one must have been the third chocolate. The other two can be anywhere in the first 6.
If the question is asking “at least 7 candies”, consider the case where the 8th candy is the third chocolate, and sum the two answers together.
$endgroup$
HINT: if the person stops after the 7th candy, then that one must have been the third chocolate. The other two can be anywhere in the first 6.
If the question is asking “at least 7 candies”, consider the case where the 8th candy is the third chocolate, and sum the two answers together.
answered 3 hours ago
D.R.D.R.
1,514722
1,514722
add a comment |
add a comment |
$begingroup$
As others have pointed out, we must select $2$ chocolates and $4$ non-chocolates in the first $6$ selections. The probability that this occurs is
$$frac{{3choose2} {5choose4}}{8choose6}$$
This comes from the hypergeometric distribution. Then there is one chocolate and one non-chocolate remaining so we then select the third chocolate with probability $frac{1}{2}$. Hence the desired probability is
$$frac{{3choose2} {5choose4}}{8choose6}cdotfrac{1}{2}approx0.268$$
$endgroup$
add a comment |
$begingroup$
As others have pointed out, we must select $2$ chocolates and $4$ non-chocolates in the first $6$ selections. The probability that this occurs is
$$frac{{3choose2} {5choose4}}{8choose6}$$
This comes from the hypergeometric distribution. Then there is one chocolate and one non-chocolate remaining so we then select the third chocolate with probability $frac{1}{2}$. Hence the desired probability is
$$frac{{3choose2} {5choose4}}{8choose6}cdotfrac{1}{2}approx0.268$$
$endgroup$
add a comment |
$begingroup$
As others have pointed out, we must select $2$ chocolates and $4$ non-chocolates in the first $6$ selections. The probability that this occurs is
$$frac{{3choose2} {5choose4}}{8choose6}$$
This comes from the hypergeometric distribution. Then there is one chocolate and one non-chocolate remaining so we then select the third chocolate with probability $frac{1}{2}$. Hence the desired probability is
$$frac{{3choose2} {5choose4}}{8choose6}cdotfrac{1}{2}approx0.268$$
$endgroup$
As others have pointed out, we must select $2$ chocolates and $4$ non-chocolates in the first $6$ selections. The probability that this occurs is
$$frac{{3choose2} {5choose4}}{8choose6}$$
This comes from the hypergeometric distribution. Then there is one chocolate and one non-chocolate remaining so we then select the third chocolate with probability $frac{1}{2}$. Hence the desired probability is
$$frac{{3choose2} {5choose4}}{8choose6}cdotfrac{1}{2}approx0.268$$
answered 1 hour ago
RemyRemy
6,504822
6,504822
add a comment |
add a comment |
The Rangster is a new contributor. Be nice, and check out our Code of Conduct.
The Rangster is a new contributor. Be nice, and check out our Code of Conduct.
The Rangster is a new contributor. Be nice, and check out our Code of Conduct.
The Rangster is a new contributor. Be nice, and check out our Code of Conduct.
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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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%2f3126856%2fthere-is-a-bag-of-8-candies-and-3-are-chocolates-you-eat-candy-until-the-choco%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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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
1
$begingroup$
Welcome to Mathematics Stack Exchange! A quick tour will enhance your experience. This post explains how to write a good question. For equations, please use MathJax.
$endgroup$
– dantopa
3 hours ago
$begingroup$
100%. I'd purposely save a chocolate for last.
$endgroup$
– fleablood
3 hours ago
$begingroup$
@fleablood: So $0%$ then. (And they all look alike, so you have to sniff them all.)
$endgroup$
– TonyK
2 hours ago
$begingroup$
Oh, yes... there are 8 candies. Yes, $0%$. (This is a joke, of course. The question assumes we are eating them randomly. I am making a joke that the question should have stated that.)
$endgroup$
– fleablood
2 hours ago