olymmath

AMC 12 2010a Problem 19

  • Paper

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}?

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

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

A

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc12/2010a/p19 · Tag SZGAS320BK · Edit this page on GitHub · Keys: j next, k previous