plsss go ahead and tell your problem
We have 22 tickets sold, and 20 seats. This means that at least 2 passengers must not show up (otherwise, at least 21 passengers will be present, and there wouldn't be space for them).
Considering each passenger as independent, you can think of this experiment. Suppose you toss a coin for each passenger. If the coin lands on heads, the passenger shows up. If it lands on tails, the passenger doesn't show up.
But the coin is unfair: it has a 0.91 probability of landing on heads, and thus 0.09 probability of landing on tails.
This implies that the probability of having exactly
tails is

We already concluded that at least two passengers must not show up. So, if our coins lands on tails less than twice, we've lost. So, the losing probability is

Finally, remember the rule to negate events:

So, if we lose with probability 0.39, we win with probability

We have to divide using long division.
__4
4| 19
16
3
The divisor becomes the denominator, the remainder becomes the numerator, and the quotient becomes the whole number.
So we have:
Given:
Mason throws a coin 3 times.
The outcome of each throw is either Heads or Tails.
To find:
The list of all the possible outcomes of the 3 throws.
Solution:
Let H represents heads and T represents tails.
For each throw we have 2 choices either H or T.
For three throws the total number of possible outcomes is
Now, list the possible outcomes as shown below.
HHH, HHT, HTH, HTT, THH, THT, TTH, TTT
Therefore, the list of 8 possible outcomes is HHH, HHT, HTH, HTT, THH, THT, TTH, TTT.
Which of the following statements are true about line segments
Answer: that connect two endpoints