Expected Value is the habit of using averages and linearity to avoid listing every possible outcome. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
A game pays $\$5$ if a fair die shows a $6$, pays $\$2$ if it shows a $4$ or $5$, and pays nothing otherwise. What is the expected payout of one play?
1
List the payouts with their probabilities: $\$5$ with probability $\tfrac{1}{6}$, $\$2$ with probability $\tfrac{2}{6}$, and $\$0$ with probability $\tfrac{3}{6}$.
2
Weight each value by its probability: $E[X] = 5 \cdot \tfrac{1}{6} + 2 \cdot \tfrac{2}{6} + 0 \cdot \tfrac{3}{6} = \tfrac{5}{6} + \tfrac{4}{6}$.
Two fair $6$-sided dice are rolled. What is the expected value of the larger of the two numbers (the maximum)?
1
There are $6^2 = 36$ equally likely ordered outcomes. For the maximum $M$, find $P(M = k)$ for $k = 1, \ldots, 6$.
2
The number of outcomes with both dice $\le k$ is $k^2$, so $P(M \le k) = \tfrac{k^2}{36}$ and $P(M = k) = \tfrac{k^2 - (k-1)^2}{36} = \tfrac{2k - 1}{36}$.
Compute $\sum k^2 = 91$ and $\sum k = 21$, so the sum is $2 \cdot 91 - 21 = 161$, giving $E[M] = \tfrac{161}{36}$.
Answer:
$\dfrac{161}{36} \approx 4.47$
Olympiad / Challenge
A fair coin is flipped repeatedly until it first shows heads. Let $N$ be the number of flips. What is $E[N]$?
1
$N$ is geometric: $P(N = k) = \left(\tfrac{1}{2}\right)^{k-1} \cdot \tfrac{1}{2} = 2^{-k}$ for $k = 1, 2, 3, \ldots$.
2
Use a one-step recurrence: the first flip costs $1$. With probability $\tfrac{1}{2}$ we are done; with probability $\tfrac{1}{2}$ we restart, expecting $E[N]$ more flips.
The definition extends to functions of $X$ via $E[g(X)] = \sum_x g(x)\,P(X = x)$ (the law of the unconscious statistician), and to continuous variables by replacing the sum with an integral against the density. The tail-sum formula $E[N] = \sum_{k \ge 1} P(N \ge k)$ for nonnegative integer $N$ often shortcuts a 'maximum' or 'waiting time' computation.
Expected value is the backbone of every 'on average,' 'expected number,' and fair-price (game/lottery) problem on AMC/AIME, and the one-step recurrence (condition on the first move, then write $E = 1 + \sum P \cdot E_{\text{next}}$) is the standard tool for expected waiting times and random walks.
Pitfall: $E[X]$ need not be an attainable value (a die averages $3.5$, never rolled), and in general $E[g(X)] \ne g(E[X])$ — you cannot push expectation through a nonlinear function. Compute $E[X^2]$ by averaging the squared values, not by squaring $E[X]$.
Spot the Signal
Look for problems where the key step is using averages and linearity to avoid listing every possible outcome.
You can describe the hard part as using averages and linearity to avoid listing every possible outcome, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the counting object that calls for expected value, then rewrite the givens around it.
Name the relation that makes Expected Value legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Expected Value just because the surface looks familiar; verify the required condition first.
Applying Expected Value because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let expected value reveal the counting structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is using averages and linearity to avoid listing every possible outcome.