Expected Value
Intermediate
8 min

Tail-Sum Formula

For a nonnegative integer-valued X, E[X] = Σ P(X ≥ k) — often far easier than summing k·P(X=k) directly.

1. The idea

For a random variable taking values in , the expectation can be rewritten as . This avoids computing individual pmf values and instead sums survival probabilities.

The formula is especially powerful for waiting times, minima, and maxima, where has a clean closed form (e.g., 'no success in the first trials') even though is messier to combine directly.

It follows from swapping the order of summation in , writing as a sum of 1's counted once for each .

2. Why it matters

Tail sums turn waiting-time and extreme-value expectation problems — very common in interviews — into a single geometric-style series instead of an awkward direct sum.

3. Core mathematics

Tail-sum formula

X nonnegative, integer-valued.

Continuous analogue

X nonnegative, continuous.

4. How to recognize it

Think of this when…

  • X counts trials until an event, or is a minimum/maximum of several variables
  • P(X ≥ k) or P(X > x) has a clean form, but the pmf is awkward
  • The question involves waiting times or 'first time that...' language

5. Worked example

Worked example

Let be geometric with success probability on (number of trials until first success). Use the tail-sum formula to find .

  1. 1

    is the probability of at least failures first.

  2. 2

    Sum the geometric series over .

  3. 3

    Simplify.

  4. Answer: , matching the known geometric mean

6. Common mistakes

  • Starting the sum at instead of (or mishandling the boundary convention)
  • Confusing with when applying the formula
  • Applying the discrete formula to a continuous variable without switching to the integral form
  • Forgetting the formula requires

7. Quick check

For uniform on , using the tail-sum formula, what is ?

8. Practice

28 QuantSolve questions use this concept.

Practice this concept

9. Related methods