How many red balls in jar (Negative Hypergeometric Distribution)
We have 100 balls in a jar. We take samples without replacement. How many of them have to be red so that we will have found one red ball after at most 16 tries with a probability of P>0.5 for k repeating experiments?
I have been advised to use the negative hypergeometric distribution. I can understand how it works but i am stuck at some point.
For the Negative hypergeometric distribution there is:
N=100
K=C, Population of successes- red balls
F=100-C, Population of Failures
How can we calculate this? The result can be decimal.
probability-distributions
asked Dec 3 '18 at 8:39
ritgeo
12
add a comment |
We have 100 balls in a jar. We take samples without replacement. How many of them have to be red so that we will have found one red ball after at most 16 tries with a probability of P>0.5 for k repeating experiments?
I have been advised to use the negative hypergeometric distribution. I can understand how it works but i am stuck at some point.
For the Negative hypergeometric distribution there is:
N=100
K=C, Population of successes- red balls
F=100-C, Population of Failures
How can we calculate this? The result can be decimal.
probability-distributions
asked Dec 3 '18 at 8:39
ritgeo
12
add a comment |
We have 100 balls in a jar. We take samples without replacement. How many of them have to be red so that we will have found one red ball after at most 16 tries with a probability of P>0.5 for k repeating experiments?
I have been advised to use the negative hypergeometric distribution. I can understand how it works but i am stuck at some point.
For the Negative hypergeometric distribution there is:
N=100
K=C, Population of successes- red balls
F=100-C, Population of Failures
How can we calculate this? The result can be decimal.
probability-distributions
asked Dec 3 '18 at 8:39
ritgeo
12
We have 100 balls in a jar. We take samples without replacement. How many of them have to be red so that we will have found one red ball after at most 16 tries with a probability of P>0.5 for k repeating experiments?
I have been advised to use the negative hypergeometric distribution. I can understand how it works but i am stuck at some point.
For the Negative hypergeometric distribution there is:
N=100
K=C, Population of successes- red balls
F=100-C, Population of Failures
How can we calculate this? The result can be decimal.
probability-distributions
probability-distributions
asked Dec 3 '18 at 8:39
ritgeo
12
asked Dec 3 '18 at 8:39
ritgeo
12
edited Dec 3 '18 at 8:54
asked Dec 3 '18 at 8:39
ritgeo
12
asked Dec 3 '18 at 8:39
ritgeo
12
asked Dec 3 '18 at 8:39
ritgeo
12
12
add a comment |
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%2f3023793%2fhow-many-red-balls-in-jar-negative-hypergeometric-distribution%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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3023793%2fhow-many-red-balls-in-jar-negative-hypergeometric-distribution%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
