MHB What is the Probability of Certain Digits Not Appearing in a Random Selection?

  • Thread starter Thread starter WMDhamnekar
  • Start date Start date
  • Tags Tags
    Random
WMDhamnekar
MHB
Messages
376
Reaction score
28
What is the probability that among k random digits,

(a) 0 does not appear;

(b) 1 does not appear;

(c) neither 0 nor 1 appears;

(d) at least one of the two digits 0 and 1 does not appear?

Let A and B represents the events in (a) and (b). Express the other events in terms of A and B.

My answer to (a) : $\displaystyle\sum_{k=1}^{5}\binom{5}{k} (0.1)^k\cdot (0.9)^{5-k}= 0.40951$ = The probability that 0 appears in 5 random digits. So, 0 does not appear in 5 random digits is 1-0.40951 = 0.59049. ∴ In general terms, the answer is $(\frac{9}{10})^k$

My answer to (b):Same as computed for (a)

My answer to (c) :$(\frac{81}{100})^k$

My answer to (d): $ 2(\frac{9}{10})^k - (\frac{81}{100}) ^k$

If A= event (a) and B= event (b) , Other event can be expressed in terms of A and B as event (c)= A*B and event (d) = $A\cup B$
 
Last edited:
Physics news on Phys.org
WMDhamnekar said:
My answer to (a) : ## \sum_{k=1}^{5}\binom{5}{k} (0.1)^k\cdot (0.9)^{5-k}= 0.40951 ## = The probability that 0 appears in 5 random digits. So, 0 does not appear in 5 random digits is 1-0.40951 = 0.59049.
That's a very complicated way to work it out.

WMDhamnekar said:
In general terms, the answer is ## (\frac{9}{10})^k ##
That's correct, and a much simpler way to work it out that bears no relation to what came before, so what was the point in that?

WMDhamnekar said:
My answer to (b):Same as computed for (a)
Clearly.

WMDhamnekar said:
My answer to (c) : ## (\frac{81}{100})^k ##
So would your answer to the question "P(none of {0,1,2,3,4,5,6,7,8,9} appears)" be ## \left ( \frac{9^{10}}{10^{10}} \right )^k ##?

WMDhamnekar said:
My answer to (d): ## 2(\frac{9}{10})^k - (\frac{81}{100}) ^k ##
You've got the right idea here, but you need to get (c) right and this should follow.
 
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