AMC 10 Step by Step

2010 AMC 10A Problem 23

P21-25~5 minPrint

Each of 2010 boxes in a line contains a single red marble, and for 1≤k≤20101 \le k \le 2010 , the box in the kthk\text{th} position also contains kk white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let P(n)P(n) be the probability that Isabella stops after drawing exactly nn marbles. What is the smallest value of nn for which P(n)<12010P(n) < \frac{1}{2010} ?

Log in to save your progress.
Show solution without answering

Key insight

Stopping at box n means white from every earlier box, then red. The chances 1/2 x 2/3 x ... cancel, leaving 1 / (n(n+1)).

Solution

Start with small cases to see the pattern.

1. What is in each box. Box kk has 11 red and kk white marbles, so k+1k + 1 marbles. The chance of white is kk+1\dfrac{k}{k+1}, and the chance of red is 1k+1\dfrac{1}{k+1}.
2. Stopping after exactly nn draws means: white from box 11, white from box 22, and so on up to box n−1n - 1, and then red from box nn. Multiply these chances.
3. Small cases.
- n=1n = 1: red from box 1: 12\tfrac12.
- n=2n = 2: white from box 1, red from box 2: 12×13=16\tfrac12 \times \tfrac13 = \tfrac16.
- n=3n = 3: 12×23×14=224=112\tfrac12 \times \tfrac23 \times \tfrac14 = \tfrac{2}{24} = \tfrac1{12}.
4. The pattern. In general,
P(n)=12×23×34×⋯×n−1n×1n+1.P(n) = \frac12 \times \frac23 \times \frac34 \times \cdots \times \frac{n-1}{n} \times \frac{1}{n+1}.
Each top number cancels the bottom number just before it, so the white part shrinks to 1n\tfrac1n. So
P(n)=1n×1n+1=1n(n+1).P(n) = \frac{1}{n} \times \frac{1}{n+1} = \frac{1}{n(n+1)}.
Check: n=3n = 3 gives 13×4=112\tfrac{1}{3 \times 4} = \tfrac1{12}. It matches.
5. Solve the inequality. P(n)<12010P(n) < \dfrac{1}{2010} means n(n+1)>2010n(n+1) > 2010. Now 44×45=198044 \times 45 = 1980, which is too small, and 45×46=207045 \times 46 = 2070, which is big enough.

The smallest nn is 4545.

The answer is (A) 45\boxed{\textbf{(A)}\ 45}.

Why this works

"Stops at step nn" always means "keeps going at every step before nn, then stops at nn," so you multiply the chances. Fractions like 12×23×34\tfrac12 \times \tfrac23 \times \tfrac34 cancel in a chain, leaving a simple answer. Trying n=1,2,3n = 1, 2, 3 first shows the pattern and gives a check.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Box kk contains 11 red and kk white marbles, k+1k + 1 in all, so the chance of drawing white there is kk+1\dfrac{k}{k+1} and the chance of red is 1k+1\dfrac{1}{k+1}.

Isabella stops after exactly nn draws when she draws white from boxes 1,2,…,n−11, 2, \dots, n-1 and red from box nn. The draws are independent, so
P(n)=12⋅23⋅34⋯n−1n⋅1n+1.P(n) = \frac12 \cdot \frac23 \cdot \frac34 \cdots \frac{n-1}{n} \cdot \frac{1}{n+1}.
Every numerator cancels the previous denominator, leaving
P(n)=1n⋅1n+1=1n(n+1).P(n) = \frac{1}{n} \cdot \frac{1}{n+1} = \frac{1}{n(n+1)}.

We need the smallest nn with n(n+1)>2010n(n+1) > 2010. Since 44⋅45=1980<201044 \cdot 45 = 1980 < 2010 and 45⋅46=2070>201045 \cdot 46 = 2070 > 2010, the answer is n=45n = 45.

The answer is (A) 45\boxed{\textbf{(A)}\ 45}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.