m1 practical answers
m1 practical answers
---
We have a deck of 52 cards, with 4 Kings. We want to find the probability that all three cards drawn
are Kings.
\[
\]
---
Possible sums when rolling two dice are 2 through 12. The prime numbers between 2 and 12 are 2, 3,
5, 7, and 11.
\[
\]
---
#### (a) Probability that all three balls are of the same color:
- Total balls = \( 5 + 4 + 6 = 15 \)
- Total ways to choose 3 balls: \( \binom{15}{3} = \frac{15 \times 14 \times 13}{3 \times 2 \times 1} =
455 \)
\[
\]
To find the probability of at least one red ball, we use the complement rule:
\[
\]
First, calculate the probability of drawing 3 non-red balls (i.e., from 9 non-red balls):
\[
\]
Thus:
\[
\]
---
The word "STATISTICS" has 10 letters, with the following counts of each letter:
- S: 3
- T: 3
- A: 1
- I: 2
- C: 1
We want the word to start and end with 'S'. For the remaining 8 positions, we can arrange the
remaining letters (T, A, I, C, T, I, T, S) in the other 8 spots.
\[
\]
Now, for the number of favorable outcomes where the word starts and ends with 'S':
- Fix the 'S' at the start and end, leaving us with 8 positions to arrange the remaining 8 letters.
\[
\]
\[
\]
---
### 5. **Probability of getting exactly 3 heads, given that at least 2 heads are obtained**
Favorable outcomes for getting at least 2 heads: the outcomes for 2, 3, 4, and 5 heads.
Now, calculate the conditional probability of exactly 3 heads, given that at least 2 heads are
obtained:
\[
\]
---
### 6. **Probability that at least two people have the same birthday (Birthday Paradox)**
\[
P(\text{no shared birthday}) = \frac{365}{365} \times \frac{364}{365} \times \cdots \times \frac{341}
{365}
\]
The probability that at least two people share a birthday is the complement:
\[
\]
---
\[
\]
#### (b) Probability that at least 1 defective item is selected:
\[
\]
\[
\]
Thus:
\[
\]
---
### 8. **Lottery with 100 tickets, 5 drawn, at least one divisible by 10**
The total number of ways to select 5 tickets from 100: \( \binom{100}{5} \).
Now, count the tickets divisible by 10: There are 10 tickets divisible by 10 (10, 20, ..., 100).
We need to find the probability that at least one of the 5 tickets has a number divisible by 10, using
the complement:
\[
\]
Calculate the number of ways to choose 5 tickets from the 90 that are not divisible by 10, and
subtract from 1:
\[
---
\[
\]
#### (b) If the first marble is red, the probability the second is red:
After drawing the first red marble, there are 7 red marbles left, and 17 marbles total:
\[
\]
---
\[
\]
\[
\]
If there are no women, all 4 members must be men. The number of ways to choose 4 men from 5 is \
( \binom{5}{4} = 5 \).
Thus:
\[
\]
Finally:
\[
\]
---