2010 AMC 12A Problems/Problem 19

Problem

Each of $2010$ boxes in a line contains a single red marble, and for $1 \le k \le 2010$ , the box in the $k\text{th}$ position also contains $k$ 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)$ be the probability that Isabella stops after drawing exactly $n$ marbles. What is the smallest value of $n$ for which $P(n) < \frac{1}{2010}$ ?

$\textbf{(A)}\ 45 \qquad \textbf{(B)}\ 63 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 201 \qquad \textbf{(E)}\ 1005$

Solution

The probability of drawing a white marble from box $k$ is $\frac{k}{k + 1}$ , and the probability of drawing a red marble from box $k$ is $\frac{1}{k+1}$ .

To stop after drawing $n$ marbles, we must draw a white marble from boxes $1, 2, \ldots, n-1,$ and draw a red marble from box $n.$ Thus, $P(n) = (\frac{1}{2} \cdot \frac{2}{3} \cdot \frac{3}{4} \cdot \dots \cdot \frac {n - 1}{n}) \cdot \frac{1}{n +1} = P(n) = \frac{(n - 1)!}{(n + 1)!} = \frac{1}{n (n + 1)},$

so, we must have $\frac{1}{n(n + 1)} < \frac{1}{2010}$ or $n(n+1) > 2010.$

The minimum integer $n$ satisfying this equation is $\boxed{\textbf{(A)}45}$ .

2010 AMC 12A (Problems • Answer Key • Resources)
Preceded by Problem 18	Followed by Problem 20
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

Page

Toolbox

Search

2010 AMC 12A Problems/Problem 19

Problem

Solution

See also