Difference between revisions of "Conditional probability"
(→Different approaches) |
|||
(72 intermediate revisions by the same user not shown) | |||
Line 3: | Line 3: | ||
==Example== | ==Example== | ||
− | Let us say that 2 fair 6 sided dice are rolled and their face up values sum is 6. What is the probability that the face up value of the one dice is 2? | + | Let us say that <math>2</math> fair <math>6</math> sided dice are rolled and their face up values sum is <math>6</math>. What is the probability that the face up value of the one dice is <math>2</math>? |
==Solution== | ==Solution== | ||
Line 21: | Line 21: | ||
==Different approaches== | ==Different approaches== | ||
<asy> | <asy> | ||
− | size( | + | size(150); |
import graph; | import graph; | ||
draw(circle((-1.5,0),3)); | draw(circle((-1.5,0),3)); | ||
real radius = 3; | real radius = 3; | ||
+ | label("$P(A)$",(-1,3),NW); | ||
draw(circle((1.5,0),3)); | draw(circle((1.5,0),3)); | ||
real radius = 3; | real radius = 3; | ||
+ | label("$P(B)$",(1,3),NE); | ||
+ | label("$P(A \cap B)$",(0,-3.5)); | ||
</asy> | </asy> | ||
+ | |||
+ | In the diagram above, it represents a diagram of the probabilities of A and B occurring, where event A doesn't have to happen, so that event B happens. For example, if we have a group of cats and dogs, and we pick two animals, and the first one is a dog, what is the probability that we pick a cat? Geometrically speaking, <math>P(A|B)</math> would be the ratio of <math>P(A \cap B)</math> to <math>P(A)</math>, since <math>P(B)</math> is <math>1</math>. | ||
+ | |||
+ | <asy> | ||
+ | size(150); | ||
+ | import graph; | ||
+ | |||
+ | draw(circle((0,0),3)); | ||
+ | real radius = 3; | ||
+ | label("$P(B)$",(1,3),NE); | ||
+ | filldraw(circle((0,-1.5),1), lightgray); | ||
+ | real radius = 3; | ||
+ | label("$P(A)$",(0,-3.5)); | ||
+ | |||
+ | </asy> | ||
+ | |||
+ | In this diagram the above <math>P(A)</math> (grey part) has to occur so that <math>P(B)</math> can occur. Let's take the cat and dog example, but instead we are given that the first pet chosen is a cat, and we want the probability of choosing a cat for the second one. Geometrically speaking, <math>P(A|B)</math> would be the <math>P(A)</math> since <math>P(B)</math> is <math>1</math>. | ||
+ | |||
+ | ==Let's make a deal== | ||
+ | |||
+ | The Monty Hall problem is related to conditional probability. Monty Hall runs the show, "Let's Make a Deal." The problem states, Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, and the host, who knows what's behind the doors, opens another door, which has a goat. He then says to you, "Do you want to pick door change your door?" Is it to your advantage to switch your choice? | ||
+ | |||
+ | The short answer is yes. The host doesn't just choose a door at random to reveal. He follows three rules, he doesn't reveal the door with a car, he doesn't reveal your door, and he always gives the option to switch. We start with a <math>\frac {1} {3}</math> chance of winning the car, and the host knowingly reveals a goat, which he always has the option to do, so why should your chance of winning increase to <math>\frac {1} {2}</math>. This is a bit skeptical, but we can use a sample space to see this. | ||
+ | |||
+ | <math>\begin{tabular}{c c c c} | ||
+ | Door 1 & Door 2 & Door 3 \\ | ||
+ | car & goat & goat \\ | ||
+ | goat & car & goat \\ | ||
+ | goat & goat & car \\ | ||
+ | \end{tabular}</math> | ||
+ | |||
+ | Remember that the host can always reveal a goat. | ||
+ | If we choose the car correctly on the first try, which happens at <math>\frac{1}{3}</math> chance, swapping would lose, but if we choose the goat on the first try, which happens at <math>\frac {2} {3}</math> chance, swapping would win. | ||
+ | |||
+ | |||
+ | But how can we solve this using conditional probability? Let's look at 60 different cases with equal probability, where we choose Door 1. (We label the goat <math>G_1</math> and <math>G_2</math>) There are 20 cases where we choose <math>G_1</math> and the host reveals the other goat. There are 10 cases where we choose the car and the host reveals <math>G_1</math>. There are 10 cases where we choose the car and the host reveals <math>G_2</math>. There are 20 cases where we choose <math>G_2</math> and the host reveals the other goat. <math>P(A)</math> will be the probability that we win by switching, and <math>P(B)</math> will be the probability that we choose Door 1, which makes <math>P(B)</math> constant at <math>1</math>. Since there are 40 cases out of 60 cases, or <math>\frac {2} {3}</math> that we win, by choosing Door 1, by conditional probability, we have <math>\frac {\frac {2} {3}}{1} = \frac {2} {3}</math>. | ||
==Review Problems== | ==Review Problems== | ||
Line 34: | Line 73: | ||
− | The probability that event A occurs is <math>\frac {3} {4}</math>, and the probability that event B occurs is <math>\frac {2} {3}</math>. | + | The probability that event A occurs is <math>\frac{3} {4}</math>, and the probability that event B occurs is <math>\frac {2} {3}</math>. |
What are the minimum and maximum possible values of <math>P(A \cap B)</math>? | What are the minimum and maximum possible values of <math>P(A \cap B)</math>? | ||
− | What are the minimum and maximum possible values of P(A|B) and P(B|A)? | + | What are the minimum and maximum possible values of <math>P(A|B)</math> and <math>P(B|A)</math>? |
+ | (Source AMC) | ||
+ | |||
+ | What fraction of all permutations of the numbers <math>1, 2, 3, 4, 5, 6</math> such that the first term is not <math>1</math> and the third has <math>3</math>? | ||
(Source AMC) | (Source AMC) | ||
Latest revision as of 11:40, 6 July 2024
Conditional probability is the probability of an event occurring, assuming that another event has already occurred. is said as the probability of event B given A
Contents
Example
Let us say that fair
sided dice are rolled and their face up values sum is
. What is the probability that the face up value of the one dice is
?
Solution
Let call the first dice and the second one
. There are 5 ways for
and 2 of those ways (distinct) includes a 2. Therefore, our answer is
.
Formula
The formula for conditional probability is where
represents the conditional probability.
is also said as the probability of event B occurring given event A occurs.
is the probability
. We can also represent
as
Different Problem
A fair standard die is tossed 3 times. Given that the sum of the first two tosses equals the third, what is the probability that at least one 2 is tossed? (Source AMC)
Solution: The probability that the sum of the first two die is equal to the 3rd die is just another way to also equivalent to the probability that the sum of the numbers on the first two die is less than 7, which is . The probability that a two is rolled and that it meets the first condition is
. dividing gets us
.
Different approaches
In the diagram above, it represents a diagram of the probabilities of A and B occurring, where event A doesn't have to happen, so that event B happens. For example, if we have a group of cats and dogs, and we pick two animals, and the first one is a dog, what is the probability that we pick a cat? Geometrically speaking, would be the ratio of
to
, since
is
.
In this diagram the above (grey part) has to occur so that
can occur. Let's take the cat and dog example, but instead we are given that the first pet chosen is a cat, and we want the probability of choosing a cat for the second one. Geometrically speaking,
would be the
since
is
.
Let's make a deal
The Monty Hall problem is related to conditional probability. Monty Hall runs the show, "Let's Make a Deal." The problem states, Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, and the host, who knows what's behind the doors, opens another door, which has a goat. He then says to you, "Do you want to pick door change your door?" Is it to your advantage to switch your choice?
The short answer is yes. The host doesn't just choose a door at random to reveal. He follows three rules, he doesn't reveal the door with a car, he doesn't reveal your door, and he always gives the option to switch. We start with a chance of winning the car, and the host knowingly reveals a goat, which he always has the option to do, so why should your chance of winning increase to
. This is a bit skeptical, but we can use a sample space to see this.
Remember that the host can always reveal a goat.
If we choose the car correctly on the first try, which happens at chance, swapping would lose, but if we choose the goat on the first try, which happens at
chance, swapping would win.
But how can we solve this using conditional probability? Let's look at 60 different cases with equal probability, where we choose Door 1. (We label the goat and
) There are 20 cases where we choose
and the host reveals the other goat. There are 10 cases where we choose the car and the host reveals
. There are 10 cases where we choose the car and the host reveals
. There are 20 cases where we choose
and the host reveals the other goat.
will be the probability that we win by switching, and
will be the probability that we choose Door 1, which makes
constant at
. Since there are 40 cases out of 60 cases, or
that we win, by choosing Door 1, by conditional probability, we have
.
Review Problems
Two fair coins are simultaneously flipped. This is done repeatedly until at least one of the coins comes up heads, at which point the process stops, what is the probability that the other coin also comes up heads on the last flip? (Source HMMT)
The probability that event A occurs is , and the probability that event B occurs is
.
What are the minimum and maximum possible values of
?
What are the minimum and maximum possible values of
and
?
(Source AMC)
What fraction of all permutations of the numbers such that the first term is not
and the third has
?
(Source AMC)