Birthday problem variation with balls and bins












3












$begingroup$



Balls are thrown randomly and uniformly into $n$ bins up until one bin has 3 balls.
Let there be $T=T(n)$ be the number of throws we made until the
occasion occurs. I am to assume $n$ is large and requested to find
$f(n)$ so that the probability:



$$ P(T > 0.1f(n))$$ Is close to 1 (for example bigger than 0.9999)
and the probability: $$ P(T > 10f(n))$$ Is close to 0 (for example
smaller than 0.001)



Our hint was to investigate the random variable, when throwing $m$
balls $X(m)$ is the number of triplets $[i,j,k] subset [1,2,...,m]$
so that the $i,j,k$ balls thrown fall in the same bin.




I have tried doing something similar to the birthday problem by defining a uniform random variable $X_i$ over $i in [1,...,n]$ so its basically if there is a ball in the $i$ bin. then I made another variable $$Y_i,_j,_k =begin{cases} 1, & text{$X_i = X_j = X_k$} \0, & text{otherwise}end{cases}$$
And then went on to calculate the expected value.
Overall I received the result ${m choose 3}*frac{1}{n^2}$ but the results don't match the definition of $X(m)$.



I am really kind of lost as this was the main way I felt might work, where am I wrong in this, whether its my way of thought or just my math, all help would be appreciated.



p.s. this is a homework question but the due date already passed










share|cite|improve this question











$endgroup$












  • $begingroup$
    "one bin > has $3$ balls" looks like a typo.
    $endgroup$
    – saulspatz
    Dec 21 '18 at 16:29










  • $begingroup$
    Hey, thanks i edited
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 16:43
















3












$begingroup$



Balls are thrown randomly and uniformly into $n$ bins up until one bin has 3 balls.
Let there be $T=T(n)$ be the number of throws we made until the
occasion occurs. I am to assume $n$ is large and requested to find
$f(n)$ so that the probability:



$$ P(T > 0.1f(n))$$ Is close to 1 (for example bigger than 0.9999)
and the probability: $$ P(T > 10f(n))$$ Is close to 0 (for example
smaller than 0.001)



Our hint was to investigate the random variable, when throwing $m$
balls $X(m)$ is the number of triplets $[i,j,k] subset [1,2,...,m]$
so that the $i,j,k$ balls thrown fall in the same bin.




I have tried doing something similar to the birthday problem by defining a uniform random variable $X_i$ over $i in [1,...,n]$ so its basically if there is a ball in the $i$ bin. then I made another variable $$Y_i,_j,_k =begin{cases} 1, & text{$X_i = X_j = X_k$} \0, & text{otherwise}end{cases}$$
And then went on to calculate the expected value.
Overall I received the result ${m choose 3}*frac{1}{n^2}$ but the results don't match the definition of $X(m)$.



I am really kind of lost as this was the main way I felt might work, where am I wrong in this, whether its my way of thought or just my math, all help would be appreciated.



p.s. this is a homework question but the due date already passed










share|cite|improve this question











$endgroup$












  • $begingroup$
    "one bin > has $3$ balls" looks like a typo.
    $endgroup$
    – saulspatz
    Dec 21 '18 at 16:29










  • $begingroup$
    Hey, thanks i edited
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 16:43














3












3








3


1



$begingroup$



Balls are thrown randomly and uniformly into $n$ bins up until one bin has 3 balls.
Let there be $T=T(n)$ be the number of throws we made until the
occasion occurs. I am to assume $n$ is large and requested to find
$f(n)$ so that the probability:



$$ P(T > 0.1f(n))$$ Is close to 1 (for example bigger than 0.9999)
and the probability: $$ P(T > 10f(n))$$ Is close to 0 (for example
smaller than 0.001)



Our hint was to investigate the random variable, when throwing $m$
balls $X(m)$ is the number of triplets $[i,j,k] subset [1,2,...,m]$
so that the $i,j,k$ balls thrown fall in the same bin.




I have tried doing something similar to the birthday problem by defining a uniform random variable $X_i$ over $i in [1,...,n]$ so its basically if there is a ball in the $i$ bin. then I made another variable $$Y_i,_j,_k =begin{cases} 1, & text{$X_i = X_j = X_k$} \0, & text{otherwise}end{cases}$$
And then went on to calculate the expected value.
Overall I received the result ${m choose 3}*frac{1}{n^2}$ but the results don't match the definition of $X(m)$.



I am really kind of lost as this was the main way I felt might work, where am I wrong in this, whether its my way of thought or just my math, all help would be appreciated.



p.s. this is a homework question but the due date already passed










share|cite|improve this question











$endgroup$





Balls are thrown randomly and uniformly into $n$ bins up until one bin has 3 balls.
Let there be $T=T(n)$ be the number of throws we made until the
occasion occurs. I am to assume $n$ is large and requested to find
$f(n)$ so that the probability:



$$ P(T > 0.1f(n))$$ Is close to 1 (for example bigger than 0.9999)
and the probability: $$ P(T > 10f(n))$$ Is close to 0 (for example
smaller than 0.001)



Our hint was to investigate the random variable, when throwing $m$
balls $X(m)$ is the number of triplets $[i,j,k] subset [1,2,...,m]$
so that the $i,j,k$ balls thrown fall in the same bin.




I have tried doing something similar to the birthday problem by defining a uniform random variable $X_i$ over $i in [1,...,n]$ so its basically if there is a ball in the $i$ bin. then I made another variable $$Y_i,_j,_k =begin{cases} 1, & text{$X_i = X_j = X_k$} \0, & text{otherwise}end{cases}$$
And then went on to calculate the expected value.
Overall I received the result ${m choose 3}*frac{1}{n^2}$ but the results don't match the definition of $X(m)$.



I am really kind of lost as this was the main way I felt might work, where am I wrong in this, whether its my way of thought or just my math, all help would be appreciated.



p.s. this is a homework question but the due date already passed







probability balls-in-bins






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 21 '18 at 16:43







LonelyStudent

















asked Dec 21 '18 at 16:27









LonelyStudentLonelyStudent

523




523












  • $begingroup$
    "one bin > has $3$ balls" looks like a typo.
    $endgroup$
    – saulspatz
    Dec 21 '18 at 16:29










  • $begingroup$
    Hey, thanks i edited
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 16:43


















  • $begingroup$
    "one bin > has $3$ balls" looks like a typo.
    $endgroup$
    – saulspatz
    Dec 21 '18 at 16:29










  • $begingroup$
    Hey, thanks i edited
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 16:43
















$begingroup$
"one bin > has $3$ balls" looks like a typo.
$endgroup$
– saulspatz
Dec 21 '18 at 16:29




$begingroup$
"one bin > has $3$ balls" looks like a typo.
$endgroup$
– saulspatz
Dec 21 '18 at 16:29












$begingroup$
Hey, thanks i edited
$endgroup$
– LonelyStudent
Dec 21 '18 at 16:43




$begingroup$
Hey, thanks i edited
$endgroup$
– LonelyStudent
Dec 21 '18 at 16:43










1 Answer
1






active

oldest

votes


















3












$begingroup$

You are asked to get the number of balls right within a factor of $10$ so we can be rather rough. If $n$ is fairly large you will have a Poisson distribution of the number of balls in each bin. If we throw $k$ balls the parameter in the Poisson distribution is $lambda=frac kn$. We want to choose this so there is a reasonable chance that at least one bin has three balls. The chance a given bin has three balls is $frac {lambda^3e^{-lambda}}{3!}$. Since there are $n$ bins, we want this to be about $frac 1n$ So (using $=$ instead of $approx$) we have
$$frac {lambda^3e^{-lambda}}{3!}=frac 1n\
frac {(frac kn)^3e^{-frac kn}}{3!}=frac 1n\
e^{-frac kn}=frac {6n^2}{k^3}$$

I did an approximate solution of this for $n$ from $5$ to $65$ in steps of $5$ in a spreadsheet. The graph is below.



enter image description here






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Ok, thanks for your answer! But do you think i can progress somehow with my way?
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 18:00












  • $begingroup$
    I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:20






  • 2




    $begingroup$
    Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:23










  • $begingroup$
    First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
    $endgroup$
    – LonelyStudent
    Dec 22 '18 at 15:52






  • 1




    $begingroup$
    What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
    $endgroup$
    – Ross Millikan
    Dec 23 '18 at 17:06











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048669%2fbirthday-problem-variation-with-balls-and-bins%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









3












$begingroup$

You are asked to get the number of balls right within a factor of $10$ so we can be rather rough. If $n$ is fairly large you will have a Poisson distribution of the number of balls in each bin. If we throw $k$ balls the parameter in the Poisson distribution is $lambda=frac kn$. We want to choose this so there is a reasonable chance that at least one bin has three balls. The chance a given bin has three balls is $frac {lambda^3e^{-lambda}}{3!}$. Since there are $n$ bins, we want this to be about $frac 1n$ So (using $=$ instead of $approx$) we have
$$frac {lambda^3e^{-lambda}}{3!}=frac 1n\
frac {(frac kn)^3e^{-frac kn}}{3!}=frac 1n\
e^{-frac kn}=frac {6n^2}{k^3}$$

I did an approximate solution of this for $n$ from $5$ to $65$ in steps of $5$ in a spreadsheet. The graph is below.



enter image description here






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Ok, thanks for your answer! But do you think i can progress somehow with my way?
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 18:00












  • $begingroup$
    I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:20






  • 2




    $begingroup$
    Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:23










  • $begingroup$
    First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
    $endgroup$
    – LonelyStudent
    Dec 22 '18 at 15:52






  • 1




    $begingroup$
    What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
    $endgroup$
    – Ross Millikan
    Dec 23 '18 at 17:06
















3












$begingroup$

You are asked to get the number of balls right within a factor of $10$ so we can be rather rough. If $n$ is fairly large you will have a Poisson distribution of the number of balls in each bin. If we throw $k$ balls the parameter in the Poisson distribution is $lambda=frac kn$. We want to choose this so there is a reasonable chance that at least one bin has three balls. The chance a given bin has three balls is $frac {lambda^3e^{-lambda}}{3!}$. Since there are $n$ bins, we want this to be about $frac 1n$ So (using $=$ instead of $approx$) we have
$$frac {lambda^3e^{-lambda}}{3!}=frac 1n\
frac {(frac kn)^3e^{-frac kn}}{3!}=frac 1n\
e^{-frac kn}=frac {6n^2}{k^3}$$

I did an approximate solution of this for $n$ from $5$ to $65$ in steps of $5$ in a spreadsheet. The graph is below.



enter image description here






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Ok, thanks for your answer! But do you think i can progress somehow with my way?
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 18:00












  • $begingroup$
    I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:20






  • 2




    $begingroup$
    Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:23










  • $begingroup$
    First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
    $endgroup$
    – LonelyStudent
    Dec 22 '18 at 15:52






  • 1




    $begingroup$
    What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
    $endgroup$
    – Ross Millikan
    Dec 23 '18 at 17:06














3












3








3





$begingroup$

You are asked to get the number of balls right within a factor of $10$ so we can be rather rough. If $n$ is fairly large you will have a Poisson distribution of the number of balls in each bin. If we throw $k$ balls the parameter in the Poisson distribution is $lambda=frac kn$. We want to choose this so there is a reasonable chance that at least one bin has three balls. The chance a given bin has three balls is $frac {lambda^3e^{-lambda}}{3!}$. Since there are $n$ bins, we want this to be about $frac 1n$ So (using $=$ instead of $approx$) we have
$$frac {lambda^3e^{-lambda}}{3!}=frac 1n\
frac {(frac kn)^3e^{-frac kn}}{3!}=frac 1n\
e^{-frac kn}=frac {6n^2}{k^3}$$

I did an approximate solution of this for $n$ from $5$ to $65$ in steps of $5$ in a spreadsheet. The graph is below.



enter image description here






share|cite|improve this answer











$endgroup$



You are asked to get the number of balls right within a factor of $10$ so we can be rather rough. If $n$ is fairly large you will have a Poisson distribution of the number of balls in each bin. If we throw $k$ balls the parameter in the Poisson distribution is $lambda=frac kn$. We want to choose this so there is a reasonable chance that at least one bin has three balls. The chance a given bin has three balls is $frac {lambda^3e^{-lambda}}{3!}$. Since there are $n$ bins, we want this to be about $frac 1n$ So (using $=$ instead of $approx$) we have
$$frac {lambda^3e^{-lambda}}{3!}=frac 1n\
frac {(frac kn)^3e^{-frac kn}}{3!}=frac 1n\
e^{-frac kn}=frac {6n^2}{k^3}$$

I did an approximate solution of this for $n$ from $5$ to $65$ in steps of $5$ in a spreadsheet. The graph is below.



enter image description here







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 22 '18 at 2:19

























answered Dec 21 '18 at 16:58









Ross MillikanRoss Millikan

298k24200374




298k24200374












  • $begingroup$
    Ok, thanks for your answer! But do you think i can progress somehow with my way?
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 18:00












  • $begingroup$
    I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:20






  • 2




    $begingroup$
    Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:23










  • $begingroup$
    First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
    $endgroup$
    – LonelyStudent
    Dec 22 '18 at 15:52






  • 1




    $begingroup$
    What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
    $endgroup$
    – Ross Millikan
    Dec 23 '18 at 17:06


















  • $begingroup$
    Ok, thanks for your answer! But do you think i can progress somehow with my way?
    $endgroup$
    – LonelyStudent
    Dec 21 '18 at 18:00












  • $begingroup$
    I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:20






  • 2




    $begingroup$
    Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
    $endgroup$
    – Ross Millikan
    Dec 22 '18 at 2:23










  • $begingroup$
    First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
    $endgroup$
    – LonelyStudent
    Dec 22 '18 at 15:52






  • 1




    $begingroup$
    What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
    $endgroup$
    – Ross Millikan
    Dec 23 '18 at 17:06
















$begingroup$
Ok, thanks for your answer! But do you think i can progress somehow with my way?
$endgroup$
– LonelyStudent
Dec 21 '18 at 18:00






$begingroup$
Ok, thanks for your answer! But do you think i can progress somehow with my way?
$endgroup$
– LonelyStudent
Dec 21 '18 at 18:00














$begingroup$
I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
$endgroup$
– Ross Millikan
Dec 22 '18 at 2:20




$begingroup$
I found that I had located the wrong root in my previous graph. It was throwing so many balls that one would expect only one bin to have as few as three balls. The new graph has much smaller numbers of balls and I believe is correct.
$endgroup$
– Ross Millikan
Dec 22 '18 at 2:20




2




2




$begingroup$
Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
$endgroup$
– Ross Millikan
Dec 22 '18 at 2:23




$begingroup$
Your approach is not so different. You are saying that any given set of three balls has $frac 1{n^2} $ chance of hitting the same bin. There are about $frac {k^3}6$ sets of three balls. That gives the same combination as on my right side. I think your logic would then be to set that to $1$, while I use a number somewhat less than $1$, but not so much. You would then say $k=sqrt[3]{6n^2}$
$endgroup$
– Ross Millikan
Dec 22 '18 at 2:23












$begingroup$
First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
$endgroup$
– LonelyStudent
Dec 22 '18 at 15:52




$begingroup$
First of all thank you, second I tried doing what you said and reducing the number to 1 by $k = sqrt[3]{(6n^2)}$ but I cant seem to relate it to a function like requested in the question, when I use for example $n=10$ while making the function $f(n) = sqrt[3]{(6n^2)}$ then the result $ P(T > 0.1f(n))$ isnt really like expected because the number of balls must be larger then about $0.1*8.4$
$endgroup$
– LonelyStudent
Dec 22 '18 at 15:52




1




1




$begingroup$
What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
$endgroup$
– Ross Millikan
Dec 23 '18 at 17:06




$begingroup$
What you would have to do would be to make an argument that involves approximations, bound those approximations, and show that the product means the error is less than a factor of $10$. Maybe you have three approximations, each of which can be wrong by a factor $2$. The product is then good to a factor $8$, which is good enough. I don't see a way there.
$endgroup$
– Ross Millikan
Dec 23 '18 at 17:06


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048669%2fbirthday-problem-variation-with-balls-and-bins%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

How do I know what Microsoft account the skydrive app is syncing to?

When does type information flow backwards in C++?

Grease: Live!