Difference between revisions of "2001 AMC 12 Problems/Problem 11"

m (Problem)
(See Also)
Line 28: Line 28:
  
 
{{AMC12 box|year=2001|num-b=10|num-a=12}}
 
{{AMC12 box|year=2001|num-b=10|num-a=12}}
{{AMC10 box|year=2001|num-b=22|num-a=24}}
 
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 18:09, 13 June 2017

The following problem is from both the 2001 AMC 12 #11 and 2001 AMC 10 #23, so both problems redirect to this page.

Problem

A box contains exactly five chips, three red and two white. Chips are randomly removed one at a time without replacement until all the red chips are drawn or all the white chips are drawn. What is the probability that the last chip drawn is white?

$\text{(A) }\frac {3}{10} \qquad \text{(B) }\frac {2}{5} \qquad \text{(C) }\frac {1}{2} \qquad \text{(D) }\frac {3}{5} \qquad \text{(E) }\frac {7}{10}$

Solution

Imagine that we draw all the chips in random order, i.e., we do not stop when the last chip of a color is drawn. To draw out all the white chips first, the last chip left must be red, and all previous chips can be drawn in any order. Since there are 3 red chips, the probability that the last chip of the five is red (and so also the probability that the last chip drawn is white) is $\boxed{(\text{D}) \frac {3}{5}}$.

Solution 2

We wish to arrange the letters: W,W, R, R, R such that R appears last. The probability of this occurring is simply $\dfrac{\dbinom{4}{2,2}}{\dbinom{5}{3,2}} = \boxed{\text{(D)}\dfrac35}$

See Also

2001 AMC 12 (ProblemsAnswer KeyResources)
Preceded by
Problem 10
Followed by
Problem 12
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. AMC logo.png

Invalid username
Login to AoPS