Probability of Bit Strings with 1 and 00 Endings: A 10-bit Analysis

  • Thread starter Thread starter cahiersujet
  • Start date Start date
  • Tags Tags
    Bits Probability
cahiersujet
Messages
5
Reaction score
0

Homework Statement


Find the probability that a randomly generated bit string of length 10 begins
with a 1 or ends with 00 if the probability that a bit is a 0 is 0.4.


Homework Equations





The Attempt at a Solution


The probability that a bit is a 0 is 0.4 and that a bit is a 1 is 0.6.
1 - - - - - - - 0 0
I'm not sure how to move on?
 
Physics news on Phys.org


In this case, it's easier to compute the probability that the bit string will neither begin with 1 nor end with two 0s.
 


Your probability is P(bit string begins with a 1 OR bit string ends with 00). Seems to me that these are independent events, so you can break this probability into the sum of two probabilities, P(bit string begins with a 1) + P(bit string ends with 00).

Hopefully you can just do some fairly simple counting to come up with the two probabilities. For the first one, how many of the 2^10 bit strings start with a 1? For the second one, how many of the 2^10 bit strings end with 00?
 


The other posts give a pretty good start.
Here's a complete solution, for posterity's sake:

The probability that the first digit is a 1 is $latex P_1 = 0.6$.
The probability the the last two digits are 00 is $latex P_{00} = (0.4)^2$.

The probability that the string either begins with a 1 or ends with 00 is given by $latex P_1 + P_{00} - P_1 P_{00} = 0.664$. (That's the probability that you get a 1 in the beginning, plus a probability that you get 00 in the end, minus the probability that both happens. The subtraction at the end avoids double-counting the possibility of both happening).

You'll notice that we never used the number of digits in the string. That's because if we don't care what values they take, then it doesn't matter. The problem would be the same for a 3-digit string.
 


Oops! Here it is, sans formatting errors:

The probability that the first digit is a 1 is P_1 = 0.6.
The probability the the last two digits are 00 is P_{00} = (0.4)^2.

The probability that the string either begins with a 1 or ends with 00 is given by P_1 + P_{00} - P_1 P_{00} = 0.664. (That's the probability that you get a 1 in the beginning, plus a probability that you get 00 in the end, minus the probability that both happens. The subtraction at the end avoids double-counting the possibility of both happening).

You'll notice that we never used the number of digits in the string. That's because if we don't care what values they take, then it doesn't matter. The problem would be the same for a 3-digit string.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top