AMC 10 Step by Step

Expected Value

Expected value, linearity of expectation, fair games

Print these 5
5
primary-topic problems (0.4% of all)
2
more as a secondary topic
Where it appears
0
P1-10
1
P11-15
3
P16-20
1
P21-25

What you need to know

  • Expected value is the long-run average. Multiply each possible value by its probability, then add. A game is fair when your expected net winnings (what you win minus what you paid) are 00. Example: a spinner pays 11, 44, or 1010 points with probabilities 12\frac12, 14\frac14, 14\frac14. Its expected value is 12⋅1+14⋅4+14⋅10=4\frac12\cdot1+\frac14\cdot4+\frac14\cdot10 = 4, so 44 points is a fair price to play.
  • Linearity of expectation. Write E(X)E(X) for the expected value of a random quantity XX. Then E(X+Y)=E(X)+E(Y)E(X+Y) = E(X)+E(Y), always, even when XX and YY affect each other. Example: one die averages 3.53.5, so the sum of two dice averages 77.
  • The indicator trick. The expected number of events (out of nn) that happen is the sum of their probabilities. Why: score each event 11 if it happens and 00 if not. The count is the sum of the scores, and each score averages out to that event's probability. Example: 55 letters go randomly into 55 addressed envelopes. Each is right with probability 15\frac15, so on average 5⋅15=15\cdot\frac15 = 1 is right.
  • Values to know. A fair die averages 1+2+⋯+66=3.5\frac{1+2+\dots+6}{6} = 3.5. If each try succeeds with probability pp, the expected number of tries until the first success is 1p\frac1p (a 66 takes 66 rolls on average).
  • Restart equations. Let TT be the expected number of steps for a process that can go back to the start. One step always happens, and with probability 1−p1-p it fails and you are back at the start, so T=1+(1−p) TT = 1+(1-p)\,T. Example: p=16p = \frac16 gives 16T=1\frac16T = 1, so T=6T = 6.

How AMC 10 tests it

  • Problems 8–15: the expected value of a die, a spinner, or a game with listed payoffs; add up value times probability, or find a ticket's fair price.
  • Problems 14–22: the expected number of something (neighboring beads of the same color, matches between two shuffled decks, runs of heads), meant for indicators and linearity.
  • Problems 18–24: the expected number of steps until a random process stops, using a restart equation or states.
  • Sometimes mixed with counting: the expected size of a random subset.

Standard approaches

  1. With few outcomes, list each value with its probability and add up value times probability.
  2. If the quantity counts how often something happens, write it as a sum of 00-or-11 scores and use linearity. You never need the full list of probabilities.
  3. Use symmetry: positions that look alike contribute the same amount.
  4. For "expected number of tries until," set up E=1+(probability of going on)⋅EE = 1 + (\text{probability of going on})\cdot E, or a small system with one unknown per state.
  5. Check that the answer is between the smallest and largest possible values.

Worked example

Ten cards numbered 11 through 1010 are shuffled and laid out in a row. What is the expected number of positions ii, with 1≤i≤91 \le i \le 9, for which the cards in positions ii and i+1i + 1 differ by exactly 11?

(A) 910\frac{9}{10} (B) 11 (C) 95\frac{9}{5} (D) 22 (E) 52\frac{5}{2}

Solution.

Step 1: scores. For each ii from 11 to 99, let Xi=1X_i = 1 if the cards in positions ii and i+1i+1 differ by 11, and Xi=0X_i = 0 if not. The number we want is X1+X2+⋯+X9X_1+X_2+\dots+X_9.

Step 2: linearity and symmetry. The expected total is the sum of the nine expected scores, and each is the probability that its score is 11. All nine neighboring pairs look alike in a random shuffle, so the answer is 99 times the probability for positions 11 and 22.

Step 3: one probability. The cards in positions 11 and 22 are a random ordered pair of different cards: 10⋅9=9010\cdot9 = 90 equally likely pairs. The pairs that differ by 11 are {1,2},{2,3},…,{9,10}\{1,2\}, \{2,3\}, \dots, \{9,10\}, each in 22 orders: 9⋅2=189\cdot2 = 18. The probability is 1890=15\frac{18}{90} = \frac15.

Step 4: multiply. 9⋅15=959\cdot\frac15 = \frac95.

The answer is (C) 95\boxed{\textbf{(C)}\ \frac{9}{5}}.

Pitfalls

  • Thinking linearity only works when the events do not affect each other. It always works.
  • Averaging the possible values without weighting them by probability. The spinner above averages 44, not 1+4+103=5\frac{1+4+10}{3} = 5.
  • Answering 33 or 3.53.5 for "the expected number of rolls until a 66." It is 1p=6\frac1p = 6.
  • Confusing the expected value with the most likely value. It need not even be a possible outcome: a die averages 3.53.5, which you can never roll.

Traps that recur

  • Counting 'exactly one die matches' as 3/16 instead of 6/16, forgetting that either die could be the matching one. (2007 AMC 10B #22)
  • Treating the three shapes 3-0-0, 2-1-0 and 1-1-1 as equally likely and averaging 3, 2, 1 to get 2, choice (E). (2025 AMC 10A #16)
  • Counting only the case where neither swap touches the ball (9/25) and forgetting the swap-and-swap-back case, giving 1.8. (2021 AMC Fall 10B #16)
  • Stopping after two tosses (probability 3/4 heads, giving 48) or adding 1/2 + 1/4 + 1/8 without recognizing it equals 7/8. (2015 AMC 10B #18)

Problems, easiest first

Open any of them to try it here; the worked solution is on the problem's own page.