Mixing
How many draws should one make?
Say you have a jar full of $N$ balls numbered from $1,2, cdots, N.$ And you are allowed to draw as many balls as you like with replacement. Note that $N$ is unknown. How many draws should you make in order know the value of $N?$
I am not sure how to approach this problem. I want to apply probabilistic reasoning, but $N$ is unknown and I can't set up the probability space. Any hints will be much appreciated.
probability statistics
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
add a comment |
Say you have a jar full of $N$ balls numbered from $1,2, cdots, N.$ And you are allowed to draw as many balls as you like with replacement. Note that $N$ is unknown. How many draws should you make in order know the value of $N?$
I am not sure how to approach this problem. I want to apply probabilistic reasoning, but $N$ is unknown and I can't set up the probability space. Any hints will be much appreciated.
probability statistics
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54
add a comment |
Say you have a jar full of $N$ balls numbered from $1,2, cdots, N.$ And you are allowed to draw as many balls as you like with replacement. Note that $N$ is unknown. How many draws should you make in order know the value of $N?$
I am not sure how to approach this problem. I want to apply probabilistic reasoning, but $N$ is unknown and I can't set up the probability space. Any hints will be much appreciated.
probability statistics
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
Say you have a jar full of $N$ balls numbered from $1,2, cdots, N.$ And you are allowed to draw as many balls as you like with replacement. Note that $N$ is unknown. How many draws should you make in order know the value of $N?$
I am not sure how to approach this problem. I want to apply probabilistic reasoning, but $N$ is unknown and I can't set up the probability space. Any hints will be much appreciated.
probability statistics
probability statistics
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
edited Nov 25 '18 at 23:04
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
asked Nov 19 '18 at 23:36
Hello_World
3,82021630
3,82021630
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54
add a comment |
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54
add a comment |
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%2f3005694%2fhow-many-draws-should-one-make%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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%2f3005694%2fhow-many-draws-should-one-make%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
By the way, the authors are Borwein and Lewis, in case anyone else like me was curious to know which book this is.
– littleO
Nov 19 '18 at 23:40
Do you have any suggestions for proving this fact?
– Hello_World
Nov 19 '18 at 23:41
Just a wild guess: I would think that you need a separation theorem for proving the second inclusion.
– gerw
Nov 22 '18 at 7:54