Let be a positive multiple of . One red ball and green balls are arranged in a line in random order. Let be the probability that at least of the green balls are on the same side of the red ball. Observe that and that approaches as grows large. What is the sum of the digits of the least value of such that ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Only the red ball's position matters; with N = 5m it fails exactly when 2m+1 to 3m-1 greens lie to its left, so P(N) = 1 - (m-1)/(5m+1).
Solution
The arrangement is determined by where the red ball sits among the positions, and each position is equally likely. If green balls are to its left, then are to its right, and takes each value with probability .
Write . The condition fails when neither side holds at least greens, i.e. and , which means . The failing values are , a total of positions. Hence
(Check: gives , and as the fraction tends to , so .)
We need :
So the least is , whose digit sum is .
The answer is .
Why this works
A random line of identical green balls plus one red ball has a tiny sample space in disguise: only the red ball's slot matters, and all slots are equally likely. Counting the bad slots is easier than the good ones because they form one contiguous block. The problem's own sanity checks (, limit ) are there to catch off-by-one errors in that count; use them.
The trap
Off-by-one errors in the count of failing positions (using m or m+1 instead of m-1) or forgetting that there are N + 1 positions, not N.
Common mistakes
- Off-by-one errors in the count of failing positions (using m or m+1 instead of m-1) or forgetting that there are N + 1 positions, not N.
- Reporting or instead of the digit sum .
Techniques
Count the complement and subtract from the total · Set up the equation/formula and compute; no special trick needed