A binary string of 2n digits consists of n 0s (zeros) and n 1s (ones). A successful string is one where at any digit position, the number of ones (counting from the left) does not exceed the number of zeros.
eg for n = 3
001101 is a successful string.
011001 is not, since after 3 digits, there are more ones than zeros.
If the string is randomly generated from n 0s and n 1s, show that the probability of generating a successful string is 1/(n+1).
2007-06-11
07:52:53
·
5 answers
·
asked by
Dr D
7