Drawing/Selecting/Picking Two/Three/More balls from a Box/Bag/Urn
Problem 7
a) | The probability of drawing 3 white and 4 green balls from a bag containing 5 white and 6 green balls if the seven balls are drawn at random simultaneously |
b) | Three balls are drawn from a bag containing 10 white and 15 red and 5 green balls. Find the probability that a) They are white b) They are red c) They are green |
c) | A box contains 2 red, 3 blue and 4 black balls. Three black are drawn from the box at random. What is the probability that (i) the three balls are of different colours? (ii) two balls are of the same colour and the third of different colour? (iii) all the balls are of the same colour? |
Solution a
Total number of balls in the bag
= | 5 White + 6 Green |
= | 11 |
Number of balls drawn = 7
Experiment : Drawing 7 balls from the bag
Total Number of Possible Choices
= | Number of ways in which the seven balls can be drawn from the total 11 | |||
⇒ n | = | 11C7 | ||
---|---|---|---|---|
= | 11C(11 − 7) nCr = nC(n − r) | |||
= | 11C4 | |||
= |
| |||
= | 330 |
Let A be the event of drawing 3 white and 4 green balls
For Event A [White] [Green] Total Available 5 6 11 To Choose 3 4 7 Choices 5C3 6C4 11C7
Number of Favorable Choices
= The number of ways in which the 3 whtie and 4 green balls can be
drawn from the total 11 mA = (Number of ways in which the 3 white balls can be drawn from the total 5)
× (Number of ways in which the 4 green balls can be drawn from the total 6) Fundamental Counting Theorem (of Multiplication): Where an event can be sub divided into two or more independent sub-events, the total number of ways in which the total event can be accomplished is equal to the product of the number of ways in which the sub-events can be accomplished.
= 5C3 × 6C4 = 5C(5 − 3) × 6C(6 − 4) = 5C2 × 6C2 = 5 × 4 2 × 1
× 6 × 5 2 × 1
= 10 × 15 = 150
[White] | [Green] | Total | |
---|---|---|---|
Available | 5 | 6 | 11 |
To Choose | 3 | 4 | 7 |
Choices | 5C3 | 6C4 | 11C7 |
Number of Favorable Choices
= | The number of ways in which the 3 whtie and 4 green balls can be drawn from the total 11 | ||||||||
mA | = | (Number of ways in which the 3 white balls can be drawn from the total 5) × (Number of ways in which the 4 green balls can be drawn from the total 6)
| |||||||
---|---|---|---|---|---|---|---|---|---|
= | 5C3 × 6C4 | ||||||||
= | 5C(5 − 3) × 6C(6 − 4) | ||||||||
= | 5C2 × 6C2 | ||||||||
= |
| ||||||||
= | 10 × 15 | ||||||||
= | 150 |
Solution (b)
Total number of balls in the bag
= | 10 White + 15 Red + 5 Green |
= | 30 |
Number of balls drawn = 3
Experiment : Drawing 3 balls from the bag
Total Number of Possible Choices
= | Number of ways in which the seven balls can be drawn from the total 11 | |||
⇒ n | = | 30C3 | ||
---|---|---|---|---|
= |
| |||
= | 4,060 |
Let
- A be the event of the three balls being white
- B be the event of the three balls being red
- C be the event of the three balls being green
For Event A [White] [Red] [Green] Total Available 10 15 5 30 To Choose 3 0 0 3 Choices 10C3 15C0 5C0 30C3
Number of Favorable Choices
= The number of ways in which the 3 white balls can be drawn
from the total 30 mA = Number of ways in which the 3 white balls can be drawn from the total 10 = 10C3 = 10 × 9 × 8 3 × 2 × 1
= 120
For Event B [White] [Red] [Green] Total Available 10 15 5 30 To Choose 0 3 0 3 Choices 10C0 15C3 5C0 30C3
Number of Favorable Choices
= The number of ways in which the 3 red balls can be drawn
from the total 30 mA = Number of ways in which the 3 red balls can be drawn from the total 15 = 15C3 = 15 × 14 × 13 3 × 2 × 1
= 455
For Event C [White] [Red] [Green] Total Available 10 15 5 30 To Choose 0 0 3 3 Choices 10C0 15C0 5C3 30C3
Number of Favorable Choices
= The number of ways in which the 3 green balls can be drawn
from the total 30 mA = Number of ways in which the 3 green balls can be drawn from the total 5 = 5C3 = 5 × 4 × 3 3 × 2 × 1
= 10
[White] | [Red] | [Green] | Total | |
---|---|---|---|---|
Available | 10 | 15 | 5 | 30 |
To Choose | 3 | 0 | 0 | 3 |
Choices | 10C3 | 15C0 | 5C0 | 30C3 |
Number of Favorable Choices
= | The number of ways in which the 3 white balls can be drawn from the total 30 | |||
mA | = | Number of ways in which the 3 white balls can be drawn from the total 10 | ||
---|---|---|---|---|
= | 10C3 | |||
= |
| |||
= | 120 |
[White] | [Red] | [Green] | Total | |
---|---|---|---|---|
Available | 10 | 15 | 5 | 30 |
To Choose | 0 | 3 | 0 | 3 |
Choices | 10C0 | 15C3 | 5C0 | 30C3 |
Number of Favorable Choices
= | The number of ways in which the 3 red balls can be drawn from the total 30 | |||
mA | = | Number of ways in which the 3 red balls can be drawn from the total 15 | ||
---|---|---|---|---|
= | 15C3 | |||
= |
| |||
= | 455 |
For Event C [White] [Red] [Green] Total Available 10 15 5 30 To Choose 0 0 3 3 Choices 10C0 15C0 5C3 30C3
Number of Favorable Choices
= The number of ways in which the 3 green balls can be drawn
from the total 30 mA = Number of ways in which the 3 green balls can be drawn from the total 5 = 5C3 = 5 × 4 × 3 3 × 2 × 1
= 10
[White] | [Red] | [Green] | Total | |
---|---|---|---|---|
Available | 10 | 15 | 5 | 30 |
To Choose | 0 | 0 | 3 | 3 |
Choices | 10C0 | 15C0 | 5C3 | 30C3 |
Number of Favorable Choices
= | The number of ways in which the 3 green balls can be drawn from the total 30 | |||
mA | = | Number of ways in which the 3 green balls can be drawn from the total 5 | ||
---|---|---|---|---|
= | 5C3 | |||
= |
| |||
= | 10 |
Solution (c)
Total number of balls in the bag
= | 2 Red + 3 Blue + 4 Black |
= | 9 |
Number of balls drawn = 3
Experiment : Drawing 3 balls from the bag
Total Number of Possible Choices
= | Number of ways in which the three balls can be drawn from the total 9 | |||
⇒ n | = | 9C3 | ||
---|---|---|---|---|
= |
| |||
= | 84 |
Let
- "P" be the event of the three balls being of different colors/colours
- "Q" be the event of two balls being of the same color/colour and the third of a different color/colour
- "R" be the event of the three balls being of the same color/colour
For Event "P" [Red] [Blue] [Black] Total Available 2 3 4 9 To Choose 1 1 1 3 Choices 2C1 3C1 4C1 9C3
Number of Favorable Choices
= The number of ways in which the 3 balls of different colors/colours
can be drawn from the total 9 mP = (Number of ways in which 1 red ball can be drawn from the total 2)
× (Number of ways in which 1 blue ball can be drawn from the total 3)
× (Number of ways in which 1 black ball can be drawn from the total 4) Fundamental Counting Theorem (of Multiplication): Where an event can be sub divided into two or more independent sub-events, the total number of ways in which the total event can be accomplished is equal to the product of the number of ways in which the sub-events can be accomplished.
= 2C1 × 3C1 × 4C1 = 2 × 3 × 4 = 24
For Event "Q" Fundamental Counting Theorem (of Addition): Where an event can be accomplished in a number of alternative ways, the total number of ways in which the event can be accomplished is equal to the sum of the number of ways in which the alternative events can be accomplished.
Event "Q" can be accomplished in 6 alternative ways
- Q1 : Drawing 2 Red balls and 1 Blue ball
- Q2 : Drawing 2 Red balls and 1 Black ball
- Q3 : Drawing 2 Blue balls and 1 Red ball
- Q4 : Drawing 2 Blue balls and 1 Black ball
- Q5 : Drawing 2 Black balls and 1 Red ball
- Q6 : Drawing 2 Blue balls and 1 Black ball
[Red] [Blue] [Black] Total Available 2 3 4 9 To Choose 2 1 0 3 Q1 Choices 2C2 3C1 4C0 9C3 To Choose 2 0 1 3 Q2 Choices 2C2 3C0 4C1 9C3 To Choose 1 2 0 3 Q3 Choices 2C1 3C2 4C0 9C3 To Choose 2 0 1 3 Q4 Choices 2C2 3C0 4C1 9C3 To Choose 1 0 2 3 Q5 Choices 2C1 3C0 4C2 9C3 To Choose 0 1 2 3 Q6 Choices 2C0 3C1 4C2 9C3
Total number of Favorable/Favorable choices for Event "Q"
⇒ mQ = mQ1 + mQ2 + mQ3 + mQ4 + mQ5 + mQ6 = (2C2 × 3C1 × 4C0) + (2C2 × 3C0 × 4C1) + (2C1 × 3C2 × 4C0)
+ (2C0 × 3C2 × 4C1) + (2C1 × 3C0 × 4C2) + (2C0 × 3C1 × 4C2) Fundamental Counting Theorem (of Multiplication): Where an event can be sub divided into two or more independent sub-events, the total number of ways in which the total event can be accomplished is equal to the product of the number of ways in which the sub-events can be accomplished.
= (1 × 3 × 1) + (1 × 1 × 4) + (2 × 3 × 1) + (1 × 3 × 4) + (2 × 1 × 6) + (1 × 3 × 6) = 3 + 4 + 6 + 12 + 12+ 18 = 55
For Event "R" Fundamental Counting Theorem (of Addition): Where an event can be accomplished in a number of alternative ways, the total number of ways in which the event can be accomplished is equal to the sum of the number of ways in which the alternative events can be accomplished.
Event "R" can be accomplished in 2 alternative ways
- R1 : Drawing 3 Blue ball
- R2 : Drawing 3 Black ball
[Red] [Blue] [Black] Total Available 2 3 4 9 To Choose 0 3 0 3 R1 Choices 2C0 3C3 4C0 9C3 To Choose 0 0 3 3 R2 Choices 2C0 3C0 4C3 9C3
Total number of Favorable/Favorable choices for Event "R"
⇒ mR = mR1 + mR2 = (2C0 × 3C3 × 4C0) + (2C0 × 3C0 × 4C3) Fundamental Counting Theorem (of Multiplication): Where an event can be sub divided into two or more independent sub-events, the total number of ways in which the total event can be accomplished is equal to the product of the number of ways in which the sub-events can be accomplished.
= (1 × 1 × 1) + (1 × 1 × 4) = 1 + 4 = 5
[Red] | [Blue] | [Black] | Total | |
---|---|---|---|---|
Available | 2 | 3 | 4 | 9 |
To Choose | 1 | 1 | 1 | 3 |
Choices | 2C1 | 3C1 | 4C1 | 9C3 |
Number of Favorable Choices
= | The number of ways in which the 3 balls of different colors/colours can be drawn from the total 9 | ||
mP | = | (Number of ways in which 1 red ball can be drawn from the total 2) × (Number of ways in which 1 blue ball can be drawn from the total 3) × (Number of ways in which 1 black ball can be drawn from the total 4)
| |
---|---|---|---|
= | 2C1 × 3C1 × 4C1 | ||
= | 2 × 3 × 4 | ||
= | 24 |
Fundamental Counting Theorem (of Addition): Where an event can be accomplished in a number of alternative ways, the total number of ways in which the event can be accomplished is equal to the sum of the number of ways in which the alternative events can be accomplished. |
Event "Q" can be accomplished in 6 alternative ways
- Q1 : Drawing 2 Red balls and 1 Blue ball
- Q2 : Drawing 2 Red balls and 1 Black ball
- Q3 : Drawing 2 Blue balls and 1 Red ball
- Q4 : Drawing 2 Blue balls and 1 Black ball
- Q5 : Drawing 2 Black balls and 1 Red ball
- Q6 : Drawing 2 Blue balls and 1 Black ball
[Red] | [Blue] | [Black] | Total | ||
---|---|---|---|---|---|
Available | 2 | 3 | 4 | 9 | |
To Choose | 2 | 1 | 0 | 3 | Q1 |
Choices | 2C2 | 3C1 | 4C0 | 9C3 | |
To Choose | 2 | 0 | 1 | 3 | Q2 |
Choices | 2C2 | 3C0 | 4C1 | 9C3 | |
To Choose | 1 | 2 | 0 | 3 | Q3 |
Choices | 2C1 | 3C2 | 4C0 | 9C3 | |
To Choose | 2 | 0 | 1 | 3 | Q4 |
Choices | 2C2 | 3C0 | 4C1 | 9C3 | |
To Choose | 1 | 0 | 2 | 3 | Q5 |
Choices | 2C1 | 3C0 | 4C2 | 9C3 | |
To Choose | 0 | 1 | 2 | 3 | Q6 |
Choices | 2C0 | 3C1 | 4C2 | 9C3 |
Total number of Favorable/Favorable choices for Event "Q"
⇒ mQ | = | mQ1 + mQ2 + mQ3 + mQ4 + mQ5 + mQ6 | |
---|---|---|---|
= | (2C2 × 3C1 × 4C0) + (2C2 × 3C0 × 4C1) + (2C1 × 3C2 × 4C0) + (2C0 × 3C2 × 4C1) + (2C1 × 3C0 × 4C2) + (2C0 × 3C1 × 4C2)
| ||
= | (1 × 3 × 1) + (1 × 1 × 4) + (2 × 3 × 1) + (1 × 3 × 4) + (2 × 1 × 6) + (1 × 3 × 6) | ||
= | 3 + 4 + 6 + 12 + 12+ 18 | ||
= | 55 |
For Event "R" Fundamental Counting Theorem (of Addition): Where an event can be accomplished in a number of alternative ways, the total number of ways in which the event can be accomplished is equal to the sum of the number of ways in which the alternative events can be accomplished.
Event "R" can be accomplished in 2 alternative ways
- R1 : Drawing 3 Blue ball
- R2 : Drawing 3 Black ball
[Red] [Blue] [Black] Total Available 2 3 4 9 To Choose 0 3 0 3 R1 Choices 2C0 3C3 4C0 9C3 To Choose 0 0 3 3 R2 Choices 2C0 3C0 4C3 9C3
Total number of Favorable/Favorable choices for Event "R"
⇒ mR = mR1 + mR2 = (2C0 × 3C3 × 4C0) + (2C0 × 3C0 × 4C3) Fundamental Counting Theorem (of Multiplication): Where an event can be sub divided into two or more independent sub-events, the total number of ways in which the total event can be accomplished is equal to the product of the number of ways in which the sub-events can be accomplished.
= (1 × 1 × 1) + (1 × 1 × 4) = 1 + 4 = 5
Fundamental Counting Theorem (of Addition): Where an event can be accomplished in a number of alternative ways, the total number of ways in which the event can be accomplished is equal to the sum of the number of ways in which the alternative events can be accomplished. |
Event "R" can be accomplished in 2 alternative ways
- R1 : Drawing 3 Blue ball
- R2 : Drawing 3 Black ball
[Red] | [Blue] | [Black] | Total | ||
---|---|---|---|---|---|
Available | 2 | 3 | 4 | 9 | |
To Choose | 0 | 3 | 0 | 3 | R1 |
Choices | 2C0 | 3C3 | 4C0 | 9C3 | |
To Choose | 0 | 0 | 3 | 3 | R2 |
Choices | 2C0 | 3C0 | 4C3 | 9C3 |
Total number of Favorable/Favorable choices for Event "R"
⇒ mR | = | mR1 + mR2 | |
---|---|---|---|
= | (2C0 × 3C3 × 4C0) + (2C0 × 3C0 × 4C3)
| ||
= | (1 × 1 × 1) + (1 × 1 × 4) | ||
= | 1 + 4 | ||
= | 5 |