• edited by
13,832 views
49 49 votes

A bag contains $10$ blue marbles, $20$ green marbles and $30$ red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process is repeated $3$ times. The probability that no two of the marbles drawn have the same colour is

  1. $\left(\dfrac{1}{36}\right)$
  2. $\left(\dfrac{1}{6}\right)$
  3. $\left(\dfrac{1}{4}\right)$
  4. $\left(\dfrac{1}{3}\right)$

5 Answers

Best answer
84 84 votes
No two marbles have the same color means, the final outcome of the three draws must be a permutation of

Blue, Green, Red

There are $3! = 6$ such permutations possible.

Now, probability of getting a Blue first, Green second and Red third $=\dfrac{10}{60}\times \dfrac{20}{60}\times \dfrac{30}{60}$

Required probability $=6\times \dfrac{10}{60}\times \dfrac{20}{60}\times \dfrac{30}{60} =\dfrac{1}{6}.$

Correct Answer: $B$
• edited by
6 6 votes
P (no two marble have the same colour) = 1 - P(Two or more marble have the same colour)

Case I --> P( Two marble same colour) = 3C2*P(both Red ,blue or Green) = 3*{(1/2*1/2*1/2)+(1/6*1/6*5/6)+(1/3*1/3*2/3)} ==> 24/36

Case II--> P(Three marble same colour) = 3C3*P(All Red, Blue or Green) = 1*{(1/2*1/2*1/2)+(1/3*1/3*1/3)+(1/6*1/6*1/6)} ==> 6/36

Therefore Probability of no two drawn marble have the same colour ==> { 1 - (30/36)} = 1/6 .
Answer:
Position:
Show:

Related questions

120 120 votes
17 answers 17 answers
65.0k
65.0k views
Ishrat Jahan asked Nov 3, 2014
64,962 views
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...
58 58 votes
6 answers 6 answers
15.5k
15.5k views
Ishrat Jahan asked Nov 3, 2014
15,522 views
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have ...
73 73 votes
7 answers 7 answers
26.7k
26.7k views
Ishrat Jahan asked Nov 3, 2014
26,716 views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...
31 31 votes
5 answers 5 answers
9.3k
9.3k views
Ishrat Jahan asked Nov 3, 2014
9,287 views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...