MHB What is the Least Value of K for Advancement in a Binomial Distribution Game?

Punch
Messages
44
Reaction score
0
A bag contains 4 red, 5 blue and 6 green balls. The balls are indistinguishable except for their colour. A trial consists of drawing a ball at random from the bag, noting its colour and replacing it in the bag. A game is plated by performing 10 trials in all.

At the start of the tournament, each player plays the above game once. Players who earned more than k dollars proceed to the next round. Find the least value of k such that, in a random sample of 10 players, the probability that all 10 players proceed to the next round is less than 0.1.

Let X be the number of blue balls drew.

X~B(10,$\frac{1}{3}$)

$[P(X>n)]^{10} < 0.1$ where $n=\frac{k}{0.50}$

$1-P(X $≤ $n) <0.794$

$P(X $≤ $n) > 0.206$
 
Mathematics news on Phys.org
Punch said:
A bag contains 4 red, 5 blue and 6 green balls. The balls are indistinguishable except for their colour. A trial consists of drawing a ball at random from the bag, noting its colour and replacing it in the bag. A game is plated by performing 10 trials in all.

At the start of the tournament, each player plays the above game once. Players who earned more than k dollars proceed to the next round. Find the least value of k such that, in a random sample of 10 players, the probability that all 10 players proceed to the next round is less than 0.1.

Let X be the number of blue balls drew.

X~B(10,$\frac{1}{3}$)

$[P(X>n)]^{10} < 0.1$ where $n=\frac{k}{0.50}$

$1-P(X $≤ $n) <0.794$

$P(X $≤ $n) > 0.206$

Incomplete question. Please include all the relevant information to the question in the thread with the question.

CB
 
CaptainBlack said:
Incomplete question. Please include all the relevant information to the question in the thread with the question.

CB

Sorry! The missing part is: For each blue ball obtained, the player earns $0.50
 
Punch said:
Sorry! The missing part is: For each blue ball obtained, the player earns $0.50

OK, so make a table of b(i,10,1/3):

Code:
            i     b(i,10,1/3)
            ----------------
            0     0.0173415 
            1     0.0867076 
            2      0.195092 
            3      0.260123 
            4      0.227608 
            5      0.136565 
            6     0.0569019 
            7     0.0162577 
            8    0.00304832 
            9   0.000338702 
           10  1.69351e-005

Now you need another column with the cumulative sum ...

(n=2 is the smallest number of wins such that P(X<=n)>0.206)

CB
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top