A bag contains three cards numbered , and . A card is drawn, recorded, and returned; this is repeated times. The five recorded numbers are then arranged in decreasing order as
Find the probability that .
Translate the order statistic into a count. Sorting in decreasing order makes the second largest value. Since is the largest possible card, happens exactly when at least two of the five draws show a . (If only one appeared, would be but would be or .)
Identify the distribution of X. Draws are with replacement, so .
Use the complement — two terms instead of four. Rather than adding , subtract the two small cases:
Compute the two subtracted terms.
Subtract.
Check against the companion case b = 1. By the mirror argument, requires at most one draw to be or , giving . Since must be , or , the remaining case is , and all three sum to ✓.
Need to solve a different problem like this? Open the solver →