• retagged by
955 views
6 6 votes

Let $C_{n}$ be the number of strings $w$ consisting of $n$ $X's$ and $n$ $Y's$ such that no initial segment of $w$ has more $Y's$ than $X's.$ Now consider the following problem. A person stands on the edge of a swimming pool holding a bag of $n$ red and $n$ blue balls. He draws a ball out one at a time and discards it. If he draws a blue ball, he takes one step back, if he draws a red ball, he moves one step forward. What is the probability that the person remains dry?

  1. $\frac{C_{n}}{2^{2n}}$
  2. $\frac{C_{n}}{\binom{2n}{n}}$
  3. $\frac{n\cdot C_{n}}{(2n)!}$
  4. $\frac{n\cdot C_{n}}{\binom{2n}{n}}$

2 Answers

1 1 vote

$\mathbf{\underline{Answer:}\Rightarrow} \mathbf{B}$

$\mathbf{\underline{Explanation:}\Rightarrow} \mathbf{}$


Total ways in which $\color {green} {\Large {2\mathrm n}}$ balls can be chosen where $\color {red} {\mathrm {\Large n}}$ are of $ \color {red} {\text{Red Colour}}$ and other $\color {blue}{\Large {\mathrm n}}$ are of $\color {blue} {\text{Blue Colour}}$ = $\dfrac{(2\mathrm n)!}{\mathrm n!.\mathrm n!}$ = $\dfrac{2}{\mathrm n!}$ = $\Large \binom{2\mathrm n}{\mathrm {C_n}}$

For the person to remain dry he should have chosen more Red balls than the blue balls which is given by $\Large \color {darkgreen} {\mathrm {C_n}}$.

$\therefore$ The answer $=\color {green} {\Large {\dfrac{\mathrm {C_n}}{\binom{2\mathrm n}{\mathrm {C_n}}}}}$

$\therefore $ B is the correct option.

• edited by
Answer:
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
1.3k
1.3k views
gatecse asked Sep 13, 2019
1,323 views
You are given two coins $A$ and $B$ that look identical. The probability that coin $A$ turns up heads is $\frac{1}{4}$, while the probability that coin $B$ turns up heads...
5 5 votes
2 2 answers
1.4k
1.4k views
gatecse asked Sep 13, 2019
1,435 views
There are $7$ switches on a switchboard, some of which are on and some of which are off. In one move, you pick any $2$ switches and toggle each of them-if the switch you ...
2 2 votes
3 3 answers
1.6k
1.6k views
gatecse asked Sep 13, 2019
1,555 views
A First In First Out queue is a data structure supporting the operation Enque, Deque, Print, Enque(x) adds the item $x$ to the tail of the queue. Deque removes the elemen...
4 4 votes
4 4 answers
2.0k
2.0k views
gatecse asked Sep 13, 2019
1,984 views
Which of the words below matches the regular expression $a(a+b)^{\ast}b+b(a+b)^{\ast}a$?$aba$$bab$$abba$$aabb$