Difference between revisions of "2010 AMC 12A Problems/Problem 19"
m (→Solution 2) |
(→Solution 2) |
||
| Line 31: | Line 31: | ||
So <cmath>\frac{1}{n(n + 1)} < \frac{1}{2010}</cmath> <cmath>n(n+1) > 2010</cmath> | So <cmath>\frac{1}{n(n + 1)} < \frac{1}{2010}</cmath> <cmath>n(n+1) > 2010</cmath> | ||
| − | The minimum integer value of <math>n</math> is <math>\boxed{\textbf{(A)}45}</math>. | + | The minimum integer value of <math>n</math> is obviously <math>\boxed{\textbf{(A)}45}</math>. |
== See also == | == See also == | ||
Revision as of 22:26, 16 February 2014
Problem
Each of 2010 boxes in a line contains a single red marble, and for
, the box in the
position also contains
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
be the probability that Isabella stops after drawing exactly
marbles. What is the smallest value of
for which
?
Solution
Solution 1
The probability of drawing a white marble from box
is
. The probability of drawing a red marble from box
is
.
The probability of drawing a red marble at box
is therefore
It is then easy to see that the lowest integer value of
that satisfies the inequality is
.
Solution 2
The probability of drawing a white marble from the first box is
. The probability of drawing a white marble from the second box is
.
It follows that the probability of drawing a white marble from box
is
, and the probability of drawing a white marble is
.
From this, we find that
Clearly,
So
The minimum integer value of
is obviously
.
See also
| 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 | |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.