"A jar contains a large number ( n ) of balls. m of these balls are red. We draw a relatively small number of balls: k < < m . What is the probability of drawing only red balls?"
The exact answer to this question is P = ( k m ) / ( k n ) . To save calculation work, and using k < < m , we may use the simple approximation P 1 ≈ ( ν μ ) k with μ = m − 2 1 ( k − 1 ) and ν = n − 2 1 ( k − 1 ) . This approximation is not bad, but it can be improved by the following "correction": P 2 ≈ P 1 ⋅ ( 1 − c 1 ( μ 2 1 − ν 2 1 ) k ( k 2 − 1 ) ) . How great is the integer c ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Extension: What is the probability that, when drawing k + ℓ < < m balls, precisely k of them are red and ℓ aren't?
First approximation: P 1 = ν k + ℓ κ k λ ℓ ( ℓ k ) , with κ = m − 2 1 ( k − 1 ) , λ = ( n − m ) − 2 1 ( ℓ − 1 ) , ν = n − 2 1 ( k + ℓ − 1 ) ;
second approximation: P 2 = P 1 ⋅ ( 1 − 2 4 1 ( κ 2 k ( k 2 − 1 ) + λ 2 ℓ ( ℓ 2 − 1 ) − ν 2 ( k + ℓ ) ( [ k + ℓ ] 2 − 1 ) ) ) .
See how well this approximation works with n = 1 0 0 , m = 6 0 , k = 5 , ℓ = 1 5 : P = ( 2 0 1 0 0 ) ( 5 6 0 ) ( 1 5 4 0 ) = 4 . 0 9 8 8 4 ⋅ 1 0 − 4 ; P 1 = ( 9 0 2 1 ) 2 0 5 8 5 ⋅ 3 3 1 5 ( 5 2 0 ) = 4 . 4 9 0 7 7 ⋅ 1 0 − 4 ; P 2 = P 1 ⋅ ( 1 − 0 . 0 8 9 4 5 ) = 4 . 0 8 9 0 9 ⋅ 1 0 − 4 . The first approximation is nearly 10% off; the second, less than 4 1 %.
Log in to reply
Thing is, with numbers this small, you can just work out the probabilities as you did. I would argue that what matters is how well the approximation works when the numbers are too big to do this.
Log in to reply
Try with n = 3 0 0 0 , m = 1 0 0 0 , ℓ = 1 0 0 , k = 2 0 0 : you get P 1 = 1 . 1 3 2 2 3 ⋅ 1 0 − 3 5 , P 2 = 0 . 8 1 1 1 8 6 ⋅ 1 0 − 3 5 . The exact value is P = 0 . 8 5 1 4 8 2 ⋅ 1 0 − 3 5 , an error of approx. 5%.
Problem Loading...
Note Loading...
Set Loading...
Assuming that k is odd, let k = 2 δ + 1 and start with P = ( ν + δ ) ( ν + δ − 1 ) ⋯ ( ν + 1 ) ν ( ν − 1 ) ⋯ ( ν − δ ) ( μ + δ ) ( μ + δ − 1 ) ⋯ ( μ + 1 ) μ ( μ − 1 ) ⋯ ( μ − δ ) . Combining positives and negatives, this becomes = ( ν 2 − δ 2 ) ( ν 2 − ( δ − 1 ) 2 ) ⋯ ( ν 2 − 1 2 ) ν ( μ 2 − δ 2 ) ( μ 2 − ( δ − 1 ) 2 ) ⋯ ( μ 2 − 1 2 ) μ . = ν k − ( δ 2 + ( δ − 1 ) 2 + ⋯ + 1 2 ) ν k − 2 + O ( ν k − 4 ) μ k − ( δ 2 + ( δ − 1 ) 2 + ⋯ + 1 2 ) μ k − 2 + O ( μ k − 4 ) = ( ν μ ) k ( 1 − C ν − 2 + O ( ν − 4 ) 1 − C μ − 2 + O ( μ − 4 ) ) , with C : = δ 2 + ( δ − 1 ) 2 + ⋯ + 1 2 = 6 δ ( δ + 1 ) ( 2 δ + 1 ) = 6 2 1 ( k − 1 ) ⋅ 2 1 ( k + 1 ) ⋅ k = 2 4 k ( k 2 − 1 ) .
Now for the approximation, we drop the O ( ⋅ ) terms and use 1 / ( 1 − x ) ≈ 1 + x for sufficiently small x ; thus P ≈ ( ν μ ) k ( 1 − C ( μ 2 1 − ν 2 1 ) ) . This is almost the desired expression for P 2 ; we see that C = c 1 ⋅ k ( k 2 − 1 ) = 2 4 k ( k 2 − 1 ) , showing that c = 2 4 .
An alternative solution is simply by trying the formula for a typical case, say n = 1 0 2 , m = 5 2 , and k = 5 . On one hand, P = 1 0 2 ⋅ 1 0 1 ⋅ 1 0 0 ⋅ 9 9 ⋅ 9 8 5 2 ⋅ 5 1 ⋅ 5 0 ⋅ 4 9 ⋅ 4 8 = 2 ⋅ 1 0 1 ⋅ 2 ⋅ 9 9 ⋅ 2 5 2 ⋅ 4 8 = 3 ⋅ 1 1 ⋅ 1 0 1 2 3 ⋅ 1 3 = 3 3 3 3 1 0 4 ; on the other hand, with ν = 1 0 0 , μ = 5 0 , k = 5 , we have P ≈ ( 1 0 0 5 0 ) 5 ⋅ ( 1 − c 1 ( 5 0 2 1 − 1 0 0 2 1 ) ⋅ 5 ⋅ ( 5 2 − 1 ) ) , 3 3 3 3 1 0 4 ≈ 3 2 1 ⋅ ( 1 − c 1 ⋅ 1 0 0 0 0 3 ⋅ 1 2 0 ) = 8 0 0 0 2 5 0 − 9 / c ; the solution is c = 3 3 3 3 ⋅ 2 5 0 − 1 0 4 ⋅ 8 0 0 0 3 3 3 3 ⋅ 9 = 1 2 5 0 2 9 9 9 7 ≈ 1 0 0 0 0 / 8 3 0 0 0 0 = 2 4 .