I Problems that could occur in estimating n from a Binomial distribution

lintmintskint
Hi, I am doing the following question:

https://i.gyazo.com/f2e651334bcbd5f1dcb6d661e4160956.png

I have estimated both n and theta. But the part that is throwing me off is what problem could you encounter in estimating n here? My only idea is that it might be something to do with the sample size.

Any help? Thanks!
 
Physics news on Phys.org
Think of how your estimate would look like for e.g. (5,7,6,5,4,6,7,6,10,7,7). Is that possible?

Another issue arises for small theta and large n.
 
mfb said:
Think of how your estimate would look like for e.g. (5,7,6,5,4,6,7,6,10,7,7). Is that possible?

Another issue arises for small theta and large n.

Is the issue with the data set that you listed that n wouldn't be an integer? So we would have to round up or down to the nearest integer in some cases? Am I on the right track?
 
Well, it is an estimate, it doesn't have to be an integer. But that was not the problem I was thinking of.
 
I don't know if this is an obvious/dumb question, but, when we consider the sample mean ##\frac {1}{m}\Sigma_{i=1}^m x_i ## , do we consider ##x_i## as binary ( depending on the success criterion),
mfb said:
Think of how your estimate would look like for e.g. (5,7,6,5,4,6,7,6,10,7,7). Is that possible?

Another issue arises for small theta and large n.
I don't understand, aren't the sample values given in binary, i.e., as success failures? Or do we have to consider different criteria for this?
 
If we would be given the binary results of n trials, there would be no need to estimate n, we could simply count. As far as I understood the question, we get multiple samples of the binomial distribution, i. e. each number in my post is the number of successful attempts (out of an unknown n) in a series of attempts.
 
  • Like
Likes WWGD
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top