Conditional Probability & States
Conditional probability, states/Markov-style processes, sequential random events
What you need to know
- Conditional probability. , read "the probability of given ," is the chance of when you know happened. Keep only the outcomes in , and ask what fraction of them are in : . Example: if a die roll is even, it is , , or , so it is a with probability (the formula gives ).
- Multiplication rule. , used for draws in a row and for experiments in stages. Example: the top two cards of a deck are both aces with probability .
- Splitting into cases, and Bayes' Theorem. If the cases do not overlap and cover every possibility, then , and . Example: box 1 has red balls and blue, box 2 has red and blue, and a coin flip picks the box: , and .
- States. For a process moving among a few situations (states), let be the chance of reaching the goal from state . Write one equation per state based on the next step, with at the goal and at a failure, and solve.
- Restarts. A process that can return to its start gives an equation like : you win now with probability , or start over with probability . Example: Amy and Ben take turns flipping a coin, Amy first; the first head wins. For Amy's chance , (heads at once) and (two tails), so and .
How AMC 10 tests it
- Problems 12–20: two-stage experiments (choose a box, then a ball; roll a die, then flip that many coins), asking for an outcome's probability or the reverse, "given the outcome, which box was it?"
- Problems 15–22: "given that at least one is a girl" or "given that the sum is even," where the trap is which outcomes the condition has thrown away.
- Problems 18–25: a frog or token jumps at random until it reaches an end; find the probability of a particular end, using states and a small system of equations.
- Draws without replacement where you must keep track of what is left in the bag.
Standard approaches
- Draw the tree. Multiply along each branch, then add the branches that end in the event.
- For "given that," find , or count only among the outcomes where happened.
- For repeated processes, give each state an unknown , merge states that are alike by symmetry, and solve.
- Look at the first step when the future depends only on where you are, not how you got there.
- Check that the probabilities of all possible endings add up to .
Worked example
A token starts on square of a row of squares numbered through . Each second it moves to an adjacent square, right with probability and left with probability . The process stops when the token reaches square or square . What is the probability that it stops at square ?
(A) (B) (C) (D) (E)
Solution.
Step 1: unknowns. Let be the probability of stopping at from square . At the ends, and .
Step 2: equations. From square , the first move goes right (chance ) or left (chance ), so . Using and :
Step 3: solve for . Substitute the first and third into the middle: . Subtract from both sides: , so .
Step 4: answer. .
The answer is .
Pitfalls
- Conditioning on the wrong event: "at least one child is a boy" is not "the first child is a boy." With two children, two boys has probability given that at least one is a boy, and given that the first child is a boy.
- Giving as the answer and forgetting to divide by .
- Writing the state equations but leaving out the values at the ends ( at the goal, at a failure).
- Treating draws without replacement as independent: after an ace is drawn, the next card is an ace with probability , not .
Traps that recur
- Solving the ten linear equations by brute substitution and making a fraction error; the difference recurrence turns it into one clean sum. (2014 AMC 10B #25)
- Noticing only one of the two ways to fall 2 short of 63; keeping just the numbers with a single 7 gives 3 out of 7, which is (E). (2025 AMC 10B #22)
- Treating the three parities as independent coin flips or guessing 1/3, instead of noticing the odd total leaves four (nearly) equally likely parity patterns. (2023 AMC 10B #21)
- Ignoring the wraparound (an edge square's outward hop lands on the opposite edge, not off the board) or forgetting that Frieda stops once she reaches a corner. (2021 AMC 10A #23)
- 1.2023 AMC 10A #14
A number is chosen at random from among the first positive integers, and a positive integer divisor of that number is then chosen at random. What is the probability that the chosen divisor is divisible by ?
- A)
- B)
- C)
- D)
- E)
- 2.2020 AMC 10B #18
An urn contains one red ball and one blue ball. A box of extra red and blue balls lies nearby. George performs the following operation four times: he draws a ball from the urn at random and then takes a ball of the same color from the box and returns those two matching balls to the urn. After the four iterations the urn contains six balls. What is the probability that the urn contains three balls of each color?
- A)
- B)
- C)
- D)
- E)
- 3.2020 AMC 10A #13
A frog sitting at the point begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length , and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices and . What is the probability that the sequence of jumps ends on a vertical side of the square?
- A)
- B)
- C)
- D)
- E)
- 4.2017 AMC 10A #18
Amelia has a coin that lands heads with probability , and Blaine has a coin that lands on heads with probability . Amelia and Blaine alternately toss their coins until someone gets a head; the first one to get a head wins. All coin tosses are independent. Amelia goes first. The probability that Amelia wins is , where and are relatively prime positive integers. What is ?
- A)
- B)
- C)
- D)
- E)
- 5.2012 AMC 10B #18
Suppose that one of every 500 people in a certain population has a particular disease, which displays no symptoms. A blood test is available for screening for this disease. For a person who has this disease, the test always turns out positive. For a person who does not have the disease, however, there is a false positive rate--in other words, for such people, of the time the test will turn out negative, but of the time the test will turn out positive and will incorrectly indicate that the person has the disease. Let be the probability that a person who is chosen at random from this population and gets a positive test result actually has the disease. Which of the following is closest to ?
- A)
- B)
- C)
- D)
- E)
- 6.2003 AMC 10B #21
A bag contains two red beads and two green beads. You reach into the bag and pull out a bead, replacing it with a red bead regardless of the color you pulled out. What is the probability that all beads in the bag are red after three such replacements?
- A)
- B)
- C)
- D)
- E)
- 7.2025 AMC 10B #22
A seven-digit positive integer is chosen at random. What is the probability that the number is divisible by , given that the sum of its digits is
- A)
- B)
- C)
- D)
- E)
- 8.2023 AMC 10B #21
Each of balls is randomly placed into one of bins. Which of the following is closest to the probability that each of the bins will contain an odd number of balls?
- A)
- B)
- C)
- D)
- E)
- 9.2021 AMC Fall 10B #20
In a particular game, each of players rolls a standard -sided die. The winner is the player who rolls the highest number. If there is a tie for the highest roll, those involved in the tie will roll again and this process will continue until one player wins. Hugo is one of the players in this game. What is the probability that Hugo's first roll was a given that he won the game?
- A)
- B)
- C)
- D)
- E)
- 10.2021 AMC 10A #23
Frieda the frog begins a sequence of hops on a grid of squares, moving one square on each hop and choosing at random the direction of each hop-up, down, left, or right. She does not hop diagonally. When the direction of a hop would take Frieda off the grid, she "wraps around" and jumps to the opposite edge. For example if Frieda begins in the center square and makes two hops "up", the first hop would place her in the top row middle square, and the second hop would cause Frieda to jump to the opposite edge, landing in the bottom row middle square. Suppose Frieda starts from the center square, makes at most four hops at random, and stops hopping if she lands on a corner square. What is the probability that she reaches a corner square on one of the four hops?
- A)
- B)
- C)
- D)
- E)
- 11.2019 AMC 10B #22
Raashan, Sylvia, and Ted play the following game. Each starts with . A bell rings every seconds, at which time each of the players who currently have money simultaneously chooses one of the other two players independently and at random and gives to that player. What is the probability that after the bell has rung times, each player will have ? (For example, Raashan and Ted may each decide to give to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have , Sylvia will have , and Ted will have , and that is the end of the first round of play. In the second round Raashan has no money to give, but Sylvia and Ted might choose each other to give their to, and the holdings will be the same at the end of the second round.)
- A)
- B)
- C)
- D)
- E)
- 12.2019 AMC 10A #22
Real numbers between 0 and 1, inclusive, are chosen in the following manner. A fair coin is flipped. If it lands heads, then it is flipped again and the chosen number is 0 if the second flip is heads and 1 if the second flip is tails. On the other hand, if the first coin flip is tails, then the number is chosen uniformly at random from the closed interval . Two random numbers and are chosen independently in this manner. What is the probability that ?
- A)
- B)
- C)
- D)
- E)
- 13.2019 AMC 10B #21
Debra flips a fair coin repeatedly, keeping track of how many heads and how many tails she has seen in total, until she gets either two heads in a row or two tails in a row, at which point she stops flipping. What is the probability that she gets two heads in a row but she sees a second tail before she sees a second head?
- A)
- B)
- C)
- D)
- E)
- 14.2011 AMC 10A #21
Two counterfeit coins of equal weight are mixed with 8 identical genuine coins. The weight of each of the counterfeit coins is different from the weight of each of the genuine coins. A pair of coins is selected at random without replacement from the 10 coins. A second pair is selected at random without replacement from the remaining 8 coins. The combined weight of the first pair is equal to the combined weight of the second pair. What is the probability that all 4 selected coins are genuine?
- A)
- B)
- C)
- D)
- E)
- 15.2010 AMC 10A #23
Each of 2010 boxes in a line contains a single red marble, and for , the box in the position also contains white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let be the probability that Isabella stops after drawing exactly marbles. What is the smallest value of for which ?
- A)
- B)
- C)
- D)
- E)
- 16.2005 AMC 10A #18
Team and team play a series. The first team to win three games wins the series. Each team is equally likely to win each game, there are no ties, and the outcomes of the individual games are independent. If team wins the second game and team wins the series, what is the probability that team wins the first game?
- A)
- B)
- C)
- D)
- E)
- 17.2014 AMC 10B #25
In a small pond there are eleven lily pads in a row labeled through . A frog is sitting on pad . When the frog is on pad , , it will jump to pad with probability and to pad with probability . Each jump is independent of the previous jumps. If the frog reaches pad it will be eaten by a patiently waiting snake. If the frog reaches pad it will exit the pond, never to return. What is the probability that the frog will escape without being eaten by the snake?
- A)
- B)
- C)
- D)
- E)
Answers
| # | Answer | The idea it turns on |
|---|---|---|
| 1 | B | Only the 9 multiples of 11 up to 99 can work. For each, exactly half its divisors are multiples of 11, because each divisor d pairs with 11 times d. |
| 2 | B | Every order of two red and two blue draws has chance 1/30: denominators are always 2, 3, 4, 5 and numerators 1, 2, 1, 2. There are 6 orders. |
| 3 | B | The points (1,1), (1,3) and the center sit on diagonals of the square, so from them both kinds of side are equally likely. Look one jump ahead. |
| 4 | D | If both players miss in a round (chance 2/5), the game starts over. So Amelia's chance P satisfies P = 1/3 + (2/5)P. |
| 5 | C | Imagine 50,000 people: 100 are sick and test positive, but 2% of the 49,900 healthy people, 998 people, also test positive. So about 1 in 11 positives is real. |
| 6 | C | All beads end red exactly when two of the three draws are green. Remember the bag holds fewer greens after each green draw. |
| 7 | A | A digit sum of 61 is 2 short of seven 9s, leaving only 28 numbers. The test for 11 passes only when the whole shortfall is in even places. |
| 8 | E | Only odd or even matters for each bin. Track one question, 'do all three bins match?', ball by ball. The chance quickly settles at 1/4. |
| 9 | C | Hugo wins with chance 1/4 by fairness. After rolling 5 he wins with chance 41/96, splitting ties with other 5s evenly. Then divide. |
| 10 | D | Only three kinds of square matter: center, edge, corner. From an edge, half the hops reach a corner, a quarter return to center, a quarter wrap to an edge. |
| 11 | B | The money is always split 1, 1, 1 or 2, 1, 0 in some order. From either split, the next ring leaves everyone with 1 dollar with probability 1/4. |
| 12 | B | Each number is 0 (chance 1/4), 1 (chance 1/4) or a random point in between (chance 1/2). Split into cases by type and add: 1/8 + 1/4 + 1/16. |
| 13 | B | The first four flips are forced to be T, H, T, H. After that, list the ways to finish with two heads and add their probabilities. |
| 14 | D | The two pairs weigh the same only when both are all real coins or each holds exactly one fake. Count those two kinds of outcomes and compare. |
| 15 | A | Stopping at box n means white from every earlier box, then red. The chances 1/2 x 2/3 x ... cancel, leaving 1 / (n(n+1)). |
| 16 | A | List every way the series can go when B wins game 2 and A wins the series. Weight shorter series more, since each game is a coin flip. |
| 17 | C | Look at the gaps between escape chances on neighboring pads: each gap is the previous one times N/(10 - N), and all gaps add up to 1. |
Problems © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. The topic note, tags and key insights are original to this site.